KnowraDiffie–Hellman key exchangeLinked fromLinked fromThe 16 pages that link to Diffie–Hellman key exchange, each with the reason it gives.All 16Broader topic 3Related 11Narrower topic 1Compared with 1Prime numberRelated: Its finite-group implementations often use arithmetic modulo a large prime.Modular arithmeticRelated: Its common finite-field implementation performs powers modulo a prime.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.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.