Algebraic aspects of key generation systems
- 144 Downloads
the collection of sets and maps which are used by each subscriber for various computations;
a protocol describing information exchange;
a mathematical problem whose complexity provides for the security of the key generation system.
In this paper we consider the first objective in its simplest form: a protocol that includes only one round of information exchange.
KeywordsPermutation Group Multiplicative Group Universal Algebra Finite Automaton Commutative Semigroup
Unable to display preview. Download preview PDF.
- 1.W.Diffie and M. Hellman, New Directions in Cryptography. IEEE Trans. Inform. Theory 22 (1976), 472–492.Google Scholar
- 2.V.M.Sidelnikov, M.A.Cherepniov, W.W.Yaschenko. The key distribution system based on the use of noncommutative groups. (In Russian) Doklady RAN, v. 332, N.5, 1993.Google Scholar
- 3.V.M.Sidelnikov. A key generation system based on the exponentiation presentation of the linear group GLn(Fp). Problemy Peredachi Informatcii (to appear)Google Scholar
- 4.V.M.Sidelnikov. A key generation system based exponentiation and noncommutative group. IEEE Intern. Symp. on Inform. Theory. 27 June–1 July 1994, Trondheim Norway.Google Scholar