Generic Algorithms and Key Agreement Protocols Based on Group Actions
We propose a Diffie-Hellman-like key agreement protocol based on the computational intractability of reversing group action. The concept of a group action generalizes exponentiation and provides an algorithmic problem harder than the discrete logarithm problem. Using the action of the general linear group on the direct product of two cyclic groups, we invent a key agreement protocol secure against an attacker who has power to solve the discrete logarithm problem. We discuss a semantic secure asymmetric encryption scheme as well. Its security is evaluated in terms of a generic algorithm, which is a model of probabilistic algorithms over black box groups (similar to a straight-line program) and does not depend on any specific property of the group representation.
KeywordsGeneric Algorithm Cyclic Group Group Element Discrete Logarithm Discrete Logarithm Problem
Unable to display preview. Download preview PDF.
- 1.L. Babai and E. Szemerédi On the complexity of matrix group problems, IEEE Symp. Found. of Computer Scienece (1984) 229–240.Google Scholar
- 4.M. Fischlin, A note on security proofs in the generic model, Advances in Cryptology (Asiacrypt’00) Lecture Notes in Computer Science, vol 1976 Springer-Verlag (2000) 458–469.Google Scholar
- 7.C. P. Schnorr, Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys, Infor. Proc. Letters, 79 (2001) 93–98.Google Scholar
- 10.V. Shoup, Lower bounds for discrete logarithms and related problems, Advances in Cryptology (Eurocrypt’97) Lecture Notes in Computer Science, vol 1233 Springer-Verlag (1997) 256–266.Google Scholar