Rate Compatible Protocol for Information Reconciliation: An application to QKD
David Elkouss, Jesus Martinez-Mateo, Daniel Lancho, Vicente Martin

TL;DR
This paper introduces a rate compatible Low Density Parity Check code-based protocol for information reconciliation in QKD, enhancing efficiency across various error rates and reducing information leakage.
Contribution
It presents a novel, adaptable reconciliation protocol using rate compatible LDPC codes optimized for quantum key distribution.
Findings
Improved reconciliation efficiency across all error rates in QKD.
Low interactivity makes the protocol suitable for practical QKD systems.
Enhanced security by minimizing information leakage during reconciliation.
Abstract
Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rate compatible construction of Low Density Parity Check codes. Our protocol improves the efficiency of the reconciliation for the whole range of error rates in the discrete variable QKD context. Its adaptability together with its low interactivity makes it specially well suited for QKD reconciliation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
