The Quanta Podcast Einstein’s Parable of Quantum Insanity
9 snips
Sep 16, 2015 A brisk dive into why the NSA is racing toward quantum-resistant encryption and how quantum computers threaten RSA and Diffie-Hellman. A clear look at lattice-based cryptography, efficiency trade-offs, and the Soliloquy disclosure. A thoughtful discussion on Einstein’s unease with quantum randomness, Bell’s theorem, and whether the wave function makes unpredictability ordinary.
AI Snips
Chapters
Transcript
Episode notes
Migrate To Quantum-Resistant Encryption
- Transition government and military encryption to quantum-resistant schemes proactively.
- Favor lattice-based cryptography now while evaluating trade-offs between security and efficiency.
Security Via High-Dimensional Lattices
- Lattice-based schemes encode hardness as getting lost in very high-dimensional grids.
- Their security comes from the practical difficulty of finding nearest lattice points in hundreds of dimensions.
NTRU's Long Run Without Being Broken
- In 1995 Jeff Hoffstein, Jill Pfeiffer, and Joe Silverman created NTRU using cyclic lattices to boost efficiency.
- NTRU remained unbroken for two decades, increasing confidence despite lacking formal hardness proofs.