Advertisement

Public Key Exchange Using Semidirect Product of (Semi)Groups

  • Maggie Habeeb
  • Delaram Kahrobaei
  • Charalambos Koupparis
  • Vladimir Shpilrain
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7954)

Abstract

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.

Keywords

Semidirect Product Group Ring Invertible Element Elliptic Curve Cryptography Practical Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anshel, I., Anshel, M., Goldfeld, D., Lemieux, S.: Key agreement, the Algebraic Eraser, and lightweight cryptography. Algebraic Methods in Cryptography, Contemp. Math. Amer. Math. Soc. 418, 1–34 (2006)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-22, 644–654 (1976)MathSciNetMATHCrossRefGoogle Scholar
  3. 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. 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. 5.
    Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC-Press (1996) Google Scholar
  6. 6.
    Myasnikov, A.G., Shpilrain, V., Ushakov, A.: Group-based cryptography. Birkha ̈user (2008) Google Scholar
  7. 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
  8. 8.
    Paeng, S.-H., Ha, K.-C., Kim, J.H., Chee, S., Park, C.S.: New public key cryptosystem using finite non abelian groups. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 470–485. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Maggie Habeeb
    • 1
  • Delaram Kahrobaei
    • 2
  • Charalambos Koupparis
    • 3
  • Vladimir Shpilrain
    • 4
  1. 1.California University of PennsylvaniaUSA
  2. 2.CUNY Graduate Center and City TechCity University of New YorkUSA
  3. 3.CUNY Graduate CenterCity University of New YorkUSA
  4. 4.CUNY Graduate CenterThe City College of New YorkUSA

Personalised recommendations