Non-binary LDPC codes for Information Reconciliation in QKD Protocols
summary
Presents optimized nonbinary LDPC designs that use an NB-MLCa split of Q-bit symbols and interleaved decoding to trade complexity for performance, evaluated on an empirical energy-time QKD channel from UCLA via Monte Carlo FER estimates. Reports 40–60% improvement in secret key yield versus prior binary MLC schemes, uses degree-distribution optimization and quasi-cyclic constructions, and introduces block MDS quasi-cyclic LDPC codes so only a high-confidence subset needs decoding, with circulant sizes chosen (primes) to meet algebraic rank conditions.
AI-written summary · about
chapters (7)
- 0:00QKD and reconciliation intro
- 3:10QKD protocol overview
- 7:54Nonbinary LDPC codes for QKD
- 13:12Multi-level coding protocol
- 24:40Privacy amplification approach
- 35:00New QKD error correction results
- 41:42Q&A: Detector noise & channel modeling
related talks
40mPost-quantum Key Exchange—A New Hope
35mQuantum Cryptography: From Theory to Practice
44mTutorial on List Decodable Coding Schemes and Interactive Communication in Networks (Part 2 of 2)
32mNew Techniques for Building Information-Theoretic Asynchronous MPC with Linear Communication
24mLocally Differentially Private Protocols for Frequency Estimation
51mDistributed Zero-Knowledge Proofs and Applications to Secure Computation
35mEfficient Zero Knowledge Protocols: The Modular Approach
27mImplementing Post Quantum algorithms in PKCS #11