Quantum 1
Talkat Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 · 2025-05-19..05-23·
summary
Quick quantum primer explains amplitudes, collapse, no cloning and why measurement changes later outcomes, then shows the algorithmic tool: the quantum Fourier transform drives period finding which yields Shor’s breaks of discrete log and factoring; Grover gives a generic quadratic speedup against symmetric keys. Post‑quantum proposals focus on group actions (isogenies as leading candidates) but face a generic poly‑query reduction and Kuperberg’s subexponential attack, and attempts to port Schnorr signatures inflate signature sizes by a security‑parameter factor.
AI-written summary · about
chapters (8)
- 0:00Quantum computing basics
- 8:15Quantum vs classical probability
- 16:22Quantum computing and period finding
- 29:52Quantum computing and cryptography
- 35:28Post-quantum cryptographic assumptions
- 39:13Group actions as cryptographic primitives
- 55:36Challenges in group action crypto
- 1:01:23Future of post-quantum crypto
related talks
28mPost-Quantum Manifesto
25mCrypto's Quantum Leap: Blockchain vs Quantum Computer
14mWhy post-quantum cryptography?
43mEverything is quantum!
01h 05mNew Quantum Cryptographic Primitives I
24mMonero Post-Quantum
37mPost-Quantum Cryptography and HashiCorp Vault
40mQuantum Computing: One Weird Trick to Break RSA Encryption