Quantum Computing and the future of cryptography
summary
Quantum computers will break current public‑key schemes via Shor's algorithm (exponential speedup for factoring and discrete logs) while symmetric ciphers face only Grover's quadratic speedup so doubling key sizes suffices. Practical steps shown: library demos of Kyber key exchange and Dilithium signatures (Bouncy Castle / OQS integrations), Cloudflare and Signal rollouts, and working QKD links for one‑time‑pad distribution. Timeline consensus: widespread break in ~15–30 years, but recorded traffic is already at risk.
AI-written summary · about
chapters (12)
- 0:00Quantum computing intro
- 3:36Modern encryption limits
- 7:47Quantum threats to crypto
- 9:52Quantum bits and superposition explained
- 16:37RSA encryption and flaws
- 20:49Shor's algorithm vs RSA
- 26:25Grover's impact on AES
- 29:16Post-quantum crypto standards
- 35:20PQC demo in .NET
- 45:44Quantum key distribution
- 53:50One-time pad security
- 55:14Resources and closing
related talks
32mCybersecurity in Post Quantum Era
01h 05mChallenges and Opportunities from Quantum-Safe Cryptography
19mPost-Quantum Cryptography
13mQuantum Computing Encryption
19mThe Quantum Threat – When Should We Act and What Should We Do?
40mWhy Quantum Safe Encryption Is the Next Y2K and How to Be Prepared
11mWhy we should be scared of Shor's Algorithm right now
45mPost‑Quantum Cryptography: The Fundamentals of Tomorrow's Digital World