Researched
Public-Key Cryptography
Two keys instead of one: strangers can communicate encrypted and verify signatures without any prior exchange, the basis of HTTPS.
Open in the interactive tree →Whitfield Diffie and Martin Hellman published key exchange over open lines in 1976; RSA by Rivest, Shamir and Adleman followed in 1977, whose security rests on the difficulty of prime factorization. British intelligence staff (Ellis, Cocks, Williamson) had discovered it in the early 1970s but could only reveal it in 1997. Today the method (now also with elliptic curves) secures online banking, certificates and software updates.
Prerequisites
- Number Systems & Place Value~3000-2000 BC
- Number Theory & Group Theory1801RSA and Diffie-Hellman rest on number theory and group theory
- Prime Number Theorem1896RSA needs large primes; the theorem says they are plentiful
- Abstract Algebra (Noether)1921-1931RSA works in rings of integers mod n; key exchange and elliptic curves in finite groups and fields
- Programmable Computer1941
- Information Theory1948
Unlocks
- Quantum Algorithms (Shor)1994Shor's target, factoring, is the hard problem behind RSA
- SSL/TLS secure connections1995
- Bitcoin & Blockchain2008
- Encrypted Web (Let's Encrypt)2015
- Crypto & Stablecoin Rules2024-2026
- Post-Quantum Cryptography2024
- Digital Euro2026
- Digital Identity & Trustopen
- Verifiable Information World2030s?
- Provably Secure Encryptionopen
More in Communication & Networks · Atomic & Space Age
- Information Theory1948
- Error-Correcting Codes1950
- Communications Satellites1962
- Packet Switching1965
- The Internet1969
- Optical Fiber1970
- ALOHAnet1971
- E-mail1971