From Caesar Cipher To Quantum Cryptography
summary
A clear throughline from Caesar shifts to quantum claims how concrete problems get solved: historical one-time pad is provably unbreakable but logistics kill it, Polish machines and Turing-style electromechanics actually break Enigma, practical attacks reduce DES from DES uses 56‑bit keys to trivial in decades while AES 128–256 remains expensive to brute force, RSA depends on factoring and a 512‑bit key was factored in 73 days, and looming quantum computers factor large N quickly threatens current public‑key systems.
AI-written summary · about
chapters (20)
- 0:00Start
- 0:50History of Cryptography
- 4:14Encryption by Transposition
- 5:32Cryptography
- 5:57The Caesar Cipher
- 7:07Use a Random Cipher
- 9:21Monoalphabetic Substitution
- 10:11Frequency Analysis
- 10:53Shift Cipher
- 11:19Europe in the 1500s
- 12:07Visionnaire Square
- 16:48Charles Babbage
- 25:40The Simplified Des
- 34:11Aes
- 34:53Side Channel Attack
- 36:06Schrodinger's Cat
- 37:17Light Is a Wave
- 37:51Quantum Cryptography
- 39:19Modern Encryption Libraries
- 40:03Resources Modern Encryption Algorithms
related talks
55mThe secrets of Cryptography
58mKeynote: Crypto means Cryptography!
19mPost-Quantum Cryptography
57mQuantum Computing and the future of cryptography
01h 02mFrom Basic Idea to Impact: the story of modern cryptography
19mThe Quantum Threat – When Should We Act and What Should We Do?
44mWhy Quantum Safe Encryption Is the Next Y2K, and How To Be Prepared
43mWhen the Internet Is Ruled by Schrödinger's Cats