Public Key Exchange Using Semidirect Product of (Semi)Groups
In this paper, we describe a brand new key exchange protocol based on a semidirect product of (semi)groups (more specifically, on extension of a (semi)group by automorphisms), and then focus on practical instances of this general idea. Our protocol can be based on any group, in particular on any non-commutative group. One of its special cases is the standard Diffie-Hellman protocol, which is based on a cyclic group. However, when our protocol is used with a non-commutative (semi)group, it acquires several useful features that make it compare favorably to the Diffie-Hellman protocol. Here we also suggest a particular non-commutative semigroup (of matrices) as the platform and show that security of the relevant protocol is based on a quite different assumption compared to that of the standard Diffie-Hellman protocol.
KeywordsSemidirect Product Group Ring Invertible Element Elliptic Curve Cryptography Practical Instance
Unable to display preview. Download preview PDF.
- 3.Habeeb, M., Kahrobaei, D., Shpilrain, V.: A public key exchange using semidirect products of groups (extended abstract). In: Proceedings of the International Conference in Symbolic Computations and Cryptography, SCC 2010, Royal Holloway, University of London, Egham, United Kingdom (June 2010)Google Scholar
- 4.Kahrobaei, D., Koupparis, C., Shpilrain, V.: Public key exchange using matrices over group rings, Groups, Complexity, and Cryptology (to appear), http://arxiv.org/abs/1302.1625
- 5.Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC-Press (1996) Google Scholar
- 6.Myasnikov, A.G., Shpilrain, V., Ushakov, A.: Group-based cryptography. Birkha ̈user (2008) Google Scholar
- 7.Myasnikov, A.G., Shpilrain, V., Ushakov, A.: Non-commutative cryptography and complexity of group-theoretic problems. Amer. Math. Soc. Surveys and Monographs (2011) Google Scholar