Linked from

The 16 pages that link to Diffie–Hellman key exchange, each with the reason it gives.

• Prime numberRelated: Its finite-group implementations often use arithmetic modulo a large prime.

• Modular arithmeticRelated: Its common finite-field implementation performs powers modulo a prime.

• CryptographyBroader topic: Its 1976 publication introduced practical public-key key agreement.

• Euler's totient functionRelated: Its modular-group setting uses groups whose orders are related to totients.

• Public-key cryptographyRelated: It uses public-key mathematics to establish a symmetric key rather than directly encrypting messages.

• Elliptic-curve cryptographyNarrower topic: Elliptic-curve key exchange adapts this foundational idea to elliptic-curve groups.

• RSA cryptosystemCompared with: Unlike RSA encryption, Diffie–Hellman establishes shared keys rather than encrypting messages directly.

• Modular exponentiationBroader topic: Its classic form computes powers modulo a prime, relying on modular exponentiation's efficiency.

• Shor's algorithmRelated: Shor's discrete-logarithm capability threatens finite-field versions of this key exchange.

• Discrete logarithmRelated: Its security in common groups depends on the difficulty of recovering exponents from public powers.

• Finite cyclic groupRelated: Its security can rely on the difficulty of discrete logarithms in finite cyclic groups.

• Multiplicative orderRelated: Its security parameters rely on the subgroup order governing repeated powers.

• Sophie Germain primeRelated: Safe primes derived from Sophie Germain primes are often used to choose groups for key exchange.

• Adi ShamirRelated: Its 1976 publication helped open the era in which RSA was developed.

• Artin's conjecture on primitive rootsRelated: Primitive roots can generate the multiplicative group used in classic finite-field versions.

• History of cryptographyBroader topic: Its 1970s development made secure communication possible without first arranging a shared secret in person.