Abstract
In this paper we study a key exchange protocol similar to the Diffie-Hellman key exchange protocol, using abelian subgroups of the automorphism group of a non-abelian nilpotent group. We also generalize group no. 92 of the Hall-Senior table [16] to an arbitrary prime p and show that, for those groups, the group of central automorphisms is commutative. We use these for the key exchange we are studying.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. E. Adney and Ti Yen, Automorphisms of p-group, Illinois Journal of Mathematics 9 (1965), 137–143.
I. Anshel, M. Anshel, B. Fisher, and D. Goldfield, New key agreement protocols in braid group cryptography, Topics in cryptology—CT-RSA 2001 (San Francisco, CA), Lecture Notes in Computer Science, vol. 2020, Springer, 2001, pp. 1–15.
I. Anshel, M. Anshel and D. Goldfeld, An algebraic method for public-key cryptography, Math. Research Letters 6 (1999), 287–291.
J. S. Birman, Braids, Links and Mapping Class Groups, Annals of Mathematics Studies, vol. 82, Princeton University Press, Princeton, N.J., 1974.
I. F. Blake and T. Garefalakis, On the complexity of the Discrete Logarithm and Diffie-Hellman problems, Journal of Complexity 20 (2004), 148–170.
I. F. Blake, G. Seroussi and N. Smart, Eliptic curves in cryptography, London Mathematical Society, Lecture Note Series, vol. 265, Cambridge University Press, Cambridge, 1999.
D. Boneh, The Decision Diffie-Hellman problem, Algorithmic number theory (Portland, OR, 1998), Lecture Notes in Computer Science, vol. 1423, Springer, Berlin, 1998, pp. 48–63.
J. H. Cheon and B. Jun, An polynomial time algoritm for tha braid Diffie-Hellman conjugacy problem, Advances in cryptography — CRYPTO 2003, Lecture Notes in Computer Science, vol. 2729, Springer, Berlin, 2003, pp. 212–225.
M. J. Curran, Semidirect product groups with abelian automorphism groups, Australian Mathematical Society. Journal. Series A. Pure Mathematics and Statistics (1987), 84–91.
P. Dehornoy, Braid-based cryptogrpahy, Contemporary Mathematics 360 (2004), 1–33.
B. E. Earnley, On Finite Groups whose Group of Automorphisms is Abelian, Ph.D. thesis, Wayne State University, MI, 1975.
T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms., Advances in Cryptology (Santa Barbara, Calif., 1984), Lecture Notes in Comput. Sci., vol. 196, Springer, Berlin, 1985, pp. 10–18.
T. A. Fournelle, Elementary abelian p-groups as automorphism group of infinite groups. I, Mathematische Zeitschrift 167 (1979), 259–270.
S. Galbraith and V. Rotger, Easy decision Diffie-Hellman groups, LMS Journal of Computation and Mathematics 7 (2004), 201–218.
The GAP Group, GAP — Groups, Algorithms, and Programming, Version 4.3, 2002, (http://www.gap-system.org).
M. Hall and J.K. Senior, The Groups of Order 2 n (n ≤ 6), The Macmillan Co., New York, 1964.
P. Hall, The Edmonton Notes on Nilpotent Groups, Queen Mary College Mathematics Notes, Mathematics Department, Queen Mary College, London, 1969.
H. Heineken and H. Liebeck, The occurrence of finite groups in the automorphism group of nilpotent groups of class 2, Archives of Mathematics 25 (1974), 8–16.
C. Hopkins, Non-abelian groups whose groups of isomorphism are abelian, Ann. of Math 29 (1927), 508–520.
A.-R. Jamali, Some new non-abelian 2-groups with abelian automorphism groups, Journal of Group Theory 5 (2002), 53–57.
D. Jonah and M. Konvisser, Some non-abelian p-groups with abelian automorphism groups, Archives of Mathematics 26 (1975), 131–133.
I. Kaplansky, Infinite abelian groups, The University of Michigan Press, Ann Arbor, Mich., 1969.
E. I. Khukhro, p-automorphisms of finite p-groups, London Mathematical Society Lecture Note Series, vol. 246, Cambridge University Press, Cambridge, 1998.
K. H. Ko, D. H. Choi, M. S. Cho, and J. W. Lee, New signature scheme using conjugacy problem, http://eprint.iacr.org/2002/168, 2002.
K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J.-S Kang, and Ch. Park, New public-key cryptosystem using braid groups, Advances in Cryptology — CRYPTO 2000 (Mihir Bellare, ed.), Lecture Notes in Computer Science, vol. 1880, 2000, pp. 166–183.
N. Koblitz, A Course in Number Theory and Cryptography, second ed., Graduate Texts in Mathematics, vol. 114, Springer-Verlag, New York, 1994.
N. Koblitz, Algebraic Aspects of Cryptography, Algorithms and Computation in Mathematics, vol. 3, Springer-Verlag, Berlin, 1998.
N. Koblitz, A. Menezes and S. Vanstone, The state of Elliptic Curve Cryptography, Designs, Codes and Cryptography 19 (2000), 173–193.
A. G. Kurosh, The Theory of Groups, vol. 1 & 2, Chelsea Publishing Company, New York, 1960.
A. Mahalanobis, Diffie-Hellman Key Exchange Protocol, its Generalization and Nilpotent Groups, Ph.D. thesis, Florida Atlantic University, 2005, http://eprint.iacr.org/2005/223.
A. Mahalanobis, Abelian groups, homomorphisms and central automorphisms of nilpotent groups, JP Journal of Algebra, Number Theory and Applications 7 (2007), 69–81.
A. J. Menezes and S. A. Vanstone, A note on cyclic group, finite fields and discrete logarithm problem, Applicable Algebra in Engineering, Communication and Computing 3 (1992), 67–74.
A. J. Menezes and Y.-H. Wu, The discrete logarithm problem in GL(n, q), Ars Combinatoria 47 (1997), 23–32.
G. A. Miller, A non-abelian group whose group of isomorphism is abelian, Messenger of Mathematics 43 (1913), 124–125.
M. Morigi, On p-groups with abelian automorphism group, The Mathematical Journal of the University of Padova 92 (1994), 47–58.
J. J. Rotman, An introduction to the theory of groups, Springer-Verlag, 1994.
P. R. Sanders, The central automorphism of a finite group, Journal of the London Mathematical Society. Second Series 44 (1969), 225–228.
W. R. Scott, Group theory, Prentice-Hall Inc., Englewood Cliffs, N.J., 1964.
I. E. Shparlinski, Security of polynomial transformations of Diffe-Hellman key, Finite fields and their applications 10 (2004), 123–131.
V. Shpilrain and G. Zapata, Combinatorial group theory and public key cryptography, Applicable Algebra in Engineering, Communication and Computing 17 (2006), 291–302.
C. Sims, Computation with finitely presented groups, Cambridge University Press, Cambridge, 1994.
D. Stinson, Cryptography, second ed., CRC Press Series on Discrete Mathematics and its Applications, Chapman & Hall/CRC, Boca Raton, FL, 2002, Theory and practice.
R. R. Struik, Some non-abelian 2-groups with abelian automorphism groups, Archives of Mathematics 39 (1982), 299–302.
M. I. G. Vasco and I. E. Sharlinski, On the security of Diffie-Hellman bits, Cryptography and computational number theory, Progress in Computer Science and Applied Logic, Birkhäuser, Basel, 2001, pp. 257–268.
M. S. Voloshina, On the holomorph of a discrete group, Ph.D. thesis, University of Rochester, 2003.
H. Zassenhaus, The Theory of Groups, Chelsea, New York, 1958.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mahalanobis, A. The Diffie-Hellman key exchange protocol and non-abelian nilpotent groups. Isr. J. Math. 165, 161–187 (2008). https://doi.org/10.1007/s11856-008-1008-z
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11856-008-1008-z