technologybriefs
10:41in productionCh. 1 · The First Public Key/ 10:41 · ceiling 15 min
Security

Diffie–Hellman key exchange

It gave us public keys—but no way to know who sent them.

Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to derive a shared secret over an insecure channel using modular exponentiation in a finite group. Published in 1976, it introduced the first publicly known private–public key concept and remains embedded in internet infrastructure. But it provides no authentication—making it vulnerable to man-in-the-middle attacks unless combined with digital signatures or certificates.

SecurityCryptographyMathematicsComputingCryptography across the network →
Chapters & takeaways5
  1. 0:54
    The First Public Key

    It lets strangers agree on a secret key without ever meeting—or trusting each other.

  2. 2:34
    What Stays Secret

    Only private exponents stay hidden; everything else—including the base and modulus—travels in plain sight.

  3. 3:32
    Why It Holds Up

    Security depends entirely on the hardness of reversing modular exponentiation—a one-way function with no known efficient classical inversion.

  4. 4:56
    The Origin Point

    It was the earliest publicly known proposal of private–public key pairs—and one of the first practical public key exchanges.

  5. 6:21
    The Authentication Gap

    It establishes shared secrets over insecure channels—but never verifies who’s on the other end.

Worth your time?

Yes. Study the whole thing.

4.5/ 5
What works
  • shared-secret-establishment
  • public-channel-key-agreement
  • foundation-for-tls-ssh-ipsec
What does not
  • authenticate
  • provide-forward-secrecy-by-default
  • resist-active-attacks
Study it if
  • protocol-designers
  • security-engineers
  • cryptographers
Skip it if
  • application-developers-who-assume-it-authenticates
The written brief1 min read

What it is and the problem it solves

It is a mathematical method for securely generating a symmetric cryptographic key over a public channel. It solves the problem of exchanging secret keys without prior contact or secure physical delivery.

How it works

It uses modular exponentiation in a finite cyclic group. Each party picks a private integer (a or b), computes a public value (g^a mod p or g^b mod p), and exchanges it openly. Both then compute the shared secret as (g^b)^a mod p = (g^a)^b mod p = g^(ab) mod p.

What works

The core mechanism works: two parties with no prior knowledge can jointly establish a shared secret over an insecure channel. Its security holds as long as computing g^(ab) mod p from g, g^a mod p, and g^b mod p remains computationally infeasible for classical algorithms.

What does not

It does not authenticate identities. It provides no protection against active attackers who intercept and substitute public values. It offers no forward secrecy unless ephemeral keys are used.

What it changes

It changed cryptography from a symmetric, pre-shared-key discipline into a public-key paradigm—enabling trustless key establishment across open networks, which underpins HTTPS, SSH, and IPsec.

Is it worth your time

Yes—if you work on network protocols, TLS, or cryptographic system design. It remains foundational, but modern implementations require careful parameter selection and hybrid authentication to avoid downgrade and man-in-the-middle attacks.

Same field · Security4 of 29
10:46
Elliptic-curve cryptographyVictor S. Miller and Neal KoblitzECC is a public-key method based on elliptic curves over finite fields. Proposed independently by Koblitz and Miller in 1985. Delivers equivalent security to RSA and ElGamal with smaller keys. Security rests on the hardness of the elliptic curve discrete logarithm problem — specifically, recovering scalar k from points P and Q = kP — and on efficient yet irreversible point multiplication for appropriate parameters.
9:26
Zero-knowledge proofZero-knowledge proof redefines verification: truth without exposure. Its 1985 formulation was precise, narrow, and assumption-bound. It works—but only where assumptions hold, only where implementation avoids side channels, and only after significant computational cost.
12:36
RSA cryptosystemRon Rivest, Adi Shamir and Leonard Adleman · 1977RSA is the first publicly described, usable public-key cryptosystem. It works by exploiting the asymmetry between modular exponentiation and root extraction modulo a composite number whose factorisation is secret. Its security depends on factoring difficulty—but that dependence is not proven equivalent. No published attack breaks it with large keys. It changed cryptography by enabling open protocols, trustless key exchange, and standardised role names like Alice and Bob.
8:43
Advanced Encryption StandardJoan Daemen and Vincent Rijmen · 1998AES is a narrow, standardised, symmetric cipher mandated by NIST in 2001. It works reliably only when implemented correctly. It solves no problems beyond confidentiality of bulk data under fixed parameters. It demands careful key handling and side-channel mitigation — which it does not provide.
Up next in Technology

Docker (software)

2013 · 9:29

Docker did not invent containers—it weaponised Linux kernel primitives into a developer-facing deployment standard.

Play nextBack to Security
9:29