Discrete Logarithms and Diffie–Hellman

  • Jeffrey Hoffstein
  • Jill Pipher
  • Joseph H. Silverman
Part of the Undergraduate Texts in Mathematics book series (UTM)


In 1976, Whitfield Diffie and Martin Hellman published their now famous paper [38] entitled “New Directions in Cryptography.” In this paper they formulated the concept of a public key encryption system and made several groundbreaking contributions to this new field. A short time earlier, Ralph Merkle had independently isolated one of the fundamental problems and invented a public key construction for an undergraduate project in a computer science class at Berkeley, but this was little understood at the time. Merkle’s work “Secure communication over insecure channels” appeared in 1982 [83].


  1. [37]
    W. Diffie, The first ten years of public key cryptology, G.J. Simmons (ed.), in Contemporary Cryptology (IEEE, New York, 1992), pp. 135–175Google Scholar
  2. [38]
    W. Diffie, M.E. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory IT-22(6), 644–654 (1976)MathSciNetCrossRefGoogle Scholar
  3. [40]
    D.S. Dummit, R.M. Foote, Abstract Algebra, 3rd edn. (Wiley, Hoboken, 2004)zbMATHGoogle Scholar
  4. [41]
    T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469–472 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  5. [42]
    J. Ellis, The story of non-secret encryption, 1987 (released by CSEG in 1997).
  6. [45]
    J. Fraleigh, A First Course in Abstract Algebra, 7th edn. (Addison Welsley, Boston/London, 2002)Google Scholar
  7. [53]
    I.N. Herstein, Topics in Algebra, 2nd edn. (Xerox College Publishing, Lexington, 1975)zbMATHGoogle Scholar
  8. [59]
    K. Ireland, M. Rosen, A Classical Introduction to Modern Number Theory. Volume 84 of Graduate Texts in Mathematics (Springer, New York, 1990)Google Scholar
  9. [63]
    D. Kahn, The Codebreakers: The Story of Secret Writing (Scribner Book, New York, 1996)Google Scholar
  10. [83]
    R.C. Merkle, Secure communications over insecure channels, in Secure Communications and Asymmetric Cryptosystems, ed. by G.J. Simmons. Volume 69 of AAAS Selected Symposium Series (Westview, Boulder, 1982), pp. 181–196Google Scholar
  11. [84]
    R.C. Merkle, M.E. Hellman, Hiding information and signatures in trapdoor knapsacks, in Secure Communications and Asymmetric Cryptosystems, ed. by G.J. Simmons. Volume 69 of AAAS Selected Symposium Series (Westview, Boulder, 1982), pp. 197–215Google Scholar
  12. [110]
    R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  13. [124]
    A. Shamir, A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. IEEE Trans. Inf. Theory 30(5), 699–704 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  14. [137]
    J.H. Silverman, A Friendly Introduction to Number Theory, 4th edn. (Pearson, Upper Saddle River, 2013)Google Scholar
  15. [139]
    S. Singh, The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography Reprint edn. (Anchor, New York, 2000)Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Jeffrey Hoffstein
    • 1
  • Jill Pipher
    • 1
  • Joseph H. Silverman
    • 1
  1. 1.Department of MathematicsBrown UniversityProvidenceUSA

Personalised recommendations