This voyage is an editorial path for understanding, not a claim of direct historical influence or sole invention.
Understand it in one breath
Design confidentiality, integrity, and authentication so that only holders of the right keys can perform the required operations. RSA is one public-key scheme relying on the classical difficulty of factoring large integers. HTTPS, finance, and messengers combine public-key methods, symmetric encryption, hashes, certificates, and careful implementation. A sufficiently large fault-tolerant quantum computer could use Shor's algorithm against RSA and classical ECC, motivating migration to post-quantum standards.
At a glance
Year
Cipher
Underlying hard mathematical problem
Broken?
BCE 50
Caesar cipher
None (simple shift)
✗ Frequency analysis
1553/1586
Bellaso/Vigenère-style polyalphabetic cipher
Repeated keys and obscured frequencies
✗ Kasiski, 1863, and other attacks
1918–1940s
Enigma
Rotors, wiring, and plugboard settings
✗ Polish Cipher Bureau and Bletchley Park teams
1976
Diffie-Hellman
Discrete logarithms are hard
✓ against classical computers / ✗ against quantum computers (Shor)
1977
RSA
Factoring a product of large primes is hard
✓ against classical computers / ✗ against quantum computers (Shor)
1985
ECC (elliptic curves)
Elliptic-curve discrete logarithm
✓ against classical computers / ✗ against quantum computers
2024+
Post-quantum ML-KEM and ML-DSA
Lattice problems
Believed secure against known quantum attacks; standardized by NIST
Cryptographic security depends not only on hardness assumptions but also on parameters, protocols, implementation, and key management. Quantum risk is driving a staged transition from RSA/ECC toward hybrid and post-quantum systems.
Concept
The mathematics of secrets — from Caesar ciphers to quantum key distribution. Information security is fundamentally a question of which math is hard.
Key formula
c=me(modn),m=cd(modn)(RSA)
Ports in time
This concept was not invented in one instant
Follow the scenes to see problems, notation, standards of proof, and applications changing across different times and places.
1
BC 50Scene 1 / 4Continue through the world of this year
The Caesar cipher — shifting the alphabet
Julius Caesar used a fixed shift of the alphabet for military communication — one of the simplest substitution ciphers.
No reliable place is given, so time continues without an invented pin
AD 1994Scene 4 / 4Continue through the world of this year
Shor’s algorithm — quantum computing casts a shadow
Peter Shor found a quantum algorithm for factoring large integers efficiently, revealing a future threat to RSA and accelerating research into post-quantum cryptography.
No reliable place is given, so time continues without an invented pin