Editing Diffie–Hellman key exchange (section)

== External links ==
{{External links|date=March 2016}}
* [https://conservancy.umn.edu/handle/11299/107353 Oral history interview with Martin Hellman], [[Charles Babbage Institute]], University of Minnesota. Leading cryptography scholar Martin Hellman discusses the circumstances and fundamental insights of his invention of public key cryptography with collaborators Whitfield Diffie and Ralph Merkle at [[Stanford University]] in the mid-1970s.
* {{IETF RFC|2631|link=no}} – ''Diffie–Hellman Key Agreement Method''. E. Rescorla. June 1999.
* {{IETF RFC|3526|link=no}} – ''More Modular Exponential (MODP) Diffie–Hellman groups for Internet Key Exchange (IKE)''. T. Kivinen, M. Kojo, SSH Communications Security. May 2003.
* [https://web.archive.org/web/20040903080553/http://csrc.nist.gov/CryptoToolkit/kms/summary-x9-42.pdf Summary of ANSI X9.42: Agreement of Symmetric Keys Using Discrete Logarithm Cryptography] (64K PDF file) ([https://web.archive.org/web/20040816210145/http://www.rsasecurity.com/rsalabs/node.asp?id=2306 Description of ANSI 9 Standards])
* [https://www.youtube.com/watch?v=zTGqP0nxX08 Talk by Martin Hellman in 2007, YouTube video]
* [https://www.networkworld.com/article/948802/crypto-dream-team-diffie-hellman-win-nobel-prize-of-computing.html Crypto dream team Diffie & Hellman wins $1M 2015 Turing Award (a.k.a. "Nobel Prize of Computing")]
* [http://neilrieck.net/dh_demo.html A Diffie–Hellman demo written in Python3]{{snd}} This demo properly supports very-large key data and enforces the use of prime numbers where required.

{{Cryptography navbox | public-key}}

{{DEFAULTSORT:Diffie-Hellman key exchange}}
[[Category:Key-agreement protocols]]
[[Category:Public-key cryptography]]