Post-quantum Key Exchange—A New Hope
summary
Post-quantum key-exchange called New Hope targets Ring-LWE at 1024-dimension and swaps BCNS’s discrete Gaussian for a portable binomial noise from Hamming weights, shrinking q and halving bandwidth to ~2 KB per direction while increasing conservative post‑quantum hardness (≈200–300 bits under chosen model). Design uses per‑handshake seed‑per‑run via SHAKE‑128, NTT-domain polynomials, a 1‑bit‑from‑4‑coefficients reconciliation, and implements Chacha20/AES‑NI sampling; reference C is >8× faster and AVX2 >27× faster than prior work with a 2^-60 failure probability.
AI-written summary · about
chapters (21)
- 0:00Introduction
- 0:37Quantum Computers
- 1:18End of Asymmetric Crypto
- 2:30Perfect Forward Secrecy
- 4:46Ring Learning with Errors
- 6:08Discrete Gaussian
- 6:59History of RingLWE
- 9:11RingLWE Parameters
- 10:58RingLWE Protocol
- 12:50Contributions
- 13:28Noise
- 18:17PostQuantum Security
- 20:07Analysis
- 21:11No fixed system parameter
- 21:56lattice script analysis
- 23:02solution
- 26:05speed comparison
- 27:34Google experiment
- 29:09Software
- 29:23Questions
- 32:38Security Proof
related talks
27mPost-Quantum Cryptography
28mPost-Quantum Manifesto
46mKey Agreement
32mCybersecurity in Post Quantum Era
23mFireside Chat with Charles on Post Quantum World
32mSymmetric Key Exchange: Lightweight Alternatives for a Post-Quantum IoT
30mPost-Quantum Crypto Integration for Enterprise Applications
45mPost‑Quantum Cryptography: The Fundamentals of Tomorrow's Digital World