Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Diffie-Hellman Key Exchange Algorithm

Cryptographic Algorithm

The Diffie-Hellman key exchange algorithm lets two parties establish a shared secret key over a communication channel that anyone else can openly observe, without having exchanged any secret information beforehand, so the shared key can then be used to encrypt their actual messages under an ordinary symmetric cipher. Each party generates its own private number and uses it to compute a public value through modular exponentiation; the two parties exchange their public values openly, and each combines the other party's public value with its own private number to arrive at the identical shared secret, a computation that an eavesdropper who has seen only the exchanged public values cannot feasibly reproduce because doing so requires solving the discrete logarithm problem. Whitfield Diffie and Martin Hellman published the method in 1976, describing it as one of the earliest practical public-key techniques in cryptography; it later came to light that researchers at Britain's GCHQ had developed the same underlying idea in 1969 but kept it classified. Diffie-Hellman and its later elliptic-curve variant remain the basis for establishing forward-secret session keys in widely used protocols such as TLS.

Facts
Time Complexity
Time Complexity (category)
Polynomial Time -- O(n^k) 1
Connections

Credited To

Source Wikipedia: Diffie-Hellman key exchange
Source Wikipedia: Diffie-Hellman key exchange

In Field

Cryptography, Fields
Source Wikipedia: Diffie-Hellman key exchange

Invented By

Source Wikipedia: Diffie-Hellman key exchange
Source Wikipedia: Diffie-Hellman key exchange
Sources
1. Diffie-Hellman Key Exchange Algorithm (Wikipedia)
Wikipedia infobox: time complexity polynomial
Quote, Wikipedia infobox: time complexity polynomial
polynomial
View the Source
Wikipedia: Diffie-Hellman key exchange
Wikimedia Foundation
  • In Field: Cryptography, Lead
    Diffie-Hellman (DH) key exchange is a mathematical method of securely generating a symmetric cryptographic key over a public channel.
  • Credited To: Whitfield Diffie, Lead
    It is named after Whitfield Diffie and Martin Hellman who published it in 1976.
  • Credited To: Martin Hellman, Lead
    It is named after Whitfield Diffie and Martin Hellman who published it in 1976.
  • Invented By: Whitfield Diffie, Lead
    It is named after Whitfield Diffie and Martin Hellman who published it in 1976.
  • Invented By: Martin Hellman, Lead
    It is named after Whitfield Diffie and Martin Hellman who published it in 1976.
View the Source
IETF RFC Editor: RFC 2631: Diffie-Hellman Key Agreement Method
IETF RFC EditorIn Group: Key Exchange Protocols, Section 1
Quote, In Group: Key Exchange Protocols, Section 1
Diffie-Hellman is a key agreement algorithm used by two parties to agree on a shared secret.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.