Skip to main content

Using Semidirect Product of (Semi)groups in Public Key Cryptography

  • Conference paper
  • First Online:
Pursuit of the Universal (CiE 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9709))

Included in the following conference series:

Abstract

In this survey, we describe a general key exchange protocol based on semidirect product of (semi)groups (more specifically, on extensions of (semi)groups by automorphisms), and then focus on practical instances of this general idea. This protocol can be based on any group or semigroup, 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 this protocol is used with a non-commutative (semi)group, it acquires several useful features that make it compare favorably to the Diffie-Hellman protocol. The focus then shifts to selecting an optimal platform (semi)group, in terms of security and efficiency. We show, in particular, that one can get a variety of new security assumptions by varying an automorphism used for a (semi)group extension.

Research of Delaram Kahrobaei was partially supported by a PSC-CUNY grant from the CUNY research foundation, as well as the City Tech foundation. Research of Delaram Kahrobaei and Vladimir Shpilrain was also supported by the ONR (Office of Naval Research) grant N000141512164.

Research of Vladimir Shpilrain was partially supported by the NSF grant CNS-1117675.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Anshel, I., Anshel, M., Goldfeld, D., Lemieux, S.: Key agreement, the algebraic eraser, and lightweight cryptography, algebraic methods in cryptography. Contemp. Math. Am. Math. Soc. 418, 1–34 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory IT 22, 644–654 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ding, J., Miasnikov, A. D., Ushakov, A.: A linear attack on a key exchange protocol using extensions of matrix semigroups. (preprint). http://eprint.iacr.org/2015/018

  4. Habeeb, M., Kahrobaei, D., Koupparis, C., Shpilrain, V.: Public key exchange using semidirect product of (semi)groups. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 475–486. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Janusz, G.J.: Faithful representations of p-groups at characteristic p. J. Algebra 15, 335–351 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kahrobaei, D., Koupparis, C., Shpilrain, V.: Public key exchange using matrices over group rings. Groups Complex. Cryptol. 5, 97–115 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kahrobaei, D., Lam, H., Shpilrain, V.: Public key exchange using extensions by endomorphisms and matrices over a Galois field. (preprint)

    Google Scholar 

  8. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC-Press, Boca Raton (1996)

    Book  MATH  Google Scholar 

  9. Myasnikov, A.G., Romankov, V.: A linear decomposition attack. Groups Complex. Cryptol. 7, 81–94 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  10. Myasnikov, A.G., Shpilrain, V., Ushakov, A.: Group-Based Cryptography. Birkhäuser, Basel (2008)

    MATH  Google Scholar 

  11. Myasnikov, A.G., Shpilrain, V., Ushakov, A.: Non-commutative Cryptography and Complexity of Group-Theoretic Problems. Surveys and Monographs. American Mathematical Society, Providence (2011)

    Book  MATH  Google Scholar 

  12. Nickel, W.: Matrix representations for torsion-free nilpotent groups by deep thought. J. Algebra 300, 376–383 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Paeng, S.-H., Ha, K.-C., Kim, J.H., Chee, S., Park, C.: New public key cryptosystem using finite non abelian groups. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, p. 470. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Romankov, V.: Linear decomposition attack on public key exchange protocols using semidirect products of (semi)groups. (preprint). http://arxiv.org/abs/1501.01152

  15. Shpilrain, V.: Cryptanalysis of Stickel’s key exchange scheme. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science – Theory and Applications. LNCS, vol. 5010, pp. 283–288. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Stickel, E.: A new method for exchanging secret keys. In: Proceedings of the Third International Conference on Information Technology and Applications (ICITA 2005), Contemporary Mathematics, vol. 2, pp. 426–430. IEEE Computer Society (2005)

    Google Scholar 

  17. Washington, L.C.: Elliptic Curves: Number Theory and Cryptography. Chapman and Hall/CRC, Boca Raton (2008)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Delaram Kahrobaei .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kahrobaei, D., Shpilrain, V. (2016). Using Semidirect Product of (Semi)groups in Public Key Cryptography. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds) Pursuit of the Universal. CiE 2016. Lecture Notes in Computer Science(), vol 9709. Springer, Cham. https://doi.org/10.1007/978-3-319-40189-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40189-8_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40188-1

  • Online ISBN: 978-3-319-40189-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics