Code-based Cryptography
summary
Code-based cryptography remains a decades-old candidate for post-quantum standards but trades huge keys for well-studied hardness: classic McEliece parameters like n=124, k=524, t=50 give security yet produce a 260 kilobytes public key. Security relies on algorithms such as information set decoding and ISD variants; recent dual/statistical decoding attacks shift focus to low-rate codes. Practical failures arise from decoding failure attacks and side channels that can yield key recovery with surprisingly few failures, and some sparse-code (LDPC) constructions have been broken in polynomial time.
AI-written summary · about
chapters (20)
- 0:00Introduction
- 1:29What is code-based crypto
- 3:16Why code-based crypto lagged
- 4:21How code-based crypto works
- 8:00Linear code basics
- 11:02Minimum distance and error correction
- 12:26Encoding and syndrome decoding
- 14:12McEliece and Niederreiter
- 17:03Modern code-based variants
- 18:26NIST PQC and code-based
- 20:56Performance comparison
- 22:01Security analysis
- 27:30Information set decoding
- 28:35Dual and statistical attacks
- 29:39Code One Out of Many
- 31:03Decoding failures and reactions
- 34:58CCA security and side channels
- 37:25Code-based signatures round
- 39:12Rank metric equivalence
- 40:21Q&A
related talks
14mWhy post-quantum cryptography?
32mCybersecurity in Post Quantum Era
28mPost-Quantum Manifesto
23mOverview of the NIST Post Quantum Algorithms
53mPanel: Migrating to Post-Quantum Schemes
10mCryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation
46mAchieving Quantum Readiness: A Comprehensive Approach
50mPost‑Quantum Cryptography for dummies. Challenges and opportunities