Post-Quantum Manifesto
summary
Quantum computers run Shor's algorithm to factor and solve discrete log in polynomial time by using the quantum Fourier transform to recover periods, which breaks RSA, Diffie‑Hellman and ECC; Grover only halves symmetric security so doubling keys suffices. Post‑quantum candidates include lattice schemes (shortest/closest vector hardness, noise‑added ciphertexts with a secret good basis), hash‑based signatures (Lamport one‑time keys + Merkle trees and state management), multivariate and code‑based (add errors to codewords) approaches. Act now: data with long secrecy windows faces harvest‑now / decrypt‑later risk.
AI-written summary · about
chapters (11)
- 0:00Intro
- 1:39The Public Key Revolution
- 2:33Public Key Cryptography
- 6:18Quantum Information
- 9:48Shor's Factoring Algorithm in a Nutshell
- 11:24The Aftermath
- 12:51Finding New Hard Problems
- 14:28Lattice-based Cryptography
- 20:13Multivariate Cryptography
- 22:46Code-based Cryptography
- 26:01Takeaways
related talks
01h 04mQuantum 1
32mCybersecurity in Post Quantum Era
37mPost-Quantum Cryptography and HashiCorp Vault
14mWhy post-quantum cryptography?
25mCrypto's Quantum Leap: Blockchain vs Quantum Computer
19mAgile is the new black – Why Preparing for Postquantum Crypto also Matters to You!
40mQuantum Computing: One Weird Trick to Break RSA Encryption
43mEverything is quantum!