Primitives of the public key cryptosystems: finite non-commutative groups of four-dimension vectors
Keywords:
cryptography, public key cryptosystem, public key agreement protocol, public encryption, finite groups, non-commutative groups, vector groups, hard problemAbstract
A new computationally difficult problem over finite non-commutative groups is proposed in this article. The problem is used to design a fast public key agreement scheme and a public encryption algorithm. An approach for constructing the finite non-commutative groups of four-dimension vectors over the finite ground field is proposed. A formula for computing the group order is derived.
Published
2010-10-20
How to Cite
Moldovyan, D. (2010). Primitives of the public key cryptosystems: finite non-commutative groups of four-dimension vectors. Information and Control Systems, (5), 43-50. Retrieved from http://ia.spcras.ru/index.php/ius/article/view/14263
Issue
Section
Information coding and transmission