Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0901.2140 · IEEE International Symposium on Information Theory (ISIT)

Efficient reconciliation protocol for discrete-variable quantum key distribution

David Elkouss, Anthony Leverrier, Romain Alléaume, Joseph J. Boutros

Published Jun 1, 2009• 177 citations
arXivHTMLPDF

Abstract

Reconciliation is an essential part of any secret-key agreement protocol and hence of a quantum key distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel (BSC). In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.

DOI
10.1109/isit.2009.5205475

Related papers

Rate compatible protocol for information reconciliation: An application to QKD

David Elkouss, Jesús Martínez-Mateo, Daniel Lancho Lancho +1 more

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.

arXiv:1006.2660•IEEE Information Theory Workshop (ITW)•Jan 1, 2010•47 citations

High-efficiency reconciliation for continuous variable quantum key distribution

Zengliang Bai, Shenshen Yang, Yongmin Li

Abstract Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 10 6 . Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.

Japanese Journal of Applied Physics•Mar 13, 2017•34 citations

Performance of a reconciliation method operating on a discreet quantum key distribution system

Nedra Benletaief, Houria Rezig, Ammar Bouallègue

Reconciliation is a mechanism allowing to weed out the discrepancies between two correlated variables. It has great role in every Quantum Key Distribution protocol where the key has to be transmitted through a noisy channel or as in our case of study in presence of an eavesdropping. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Turbo codes. In particular, we demonstrate that our method leads to a significant improvement of Bit Error Rate, may divide it by three in presence of a eavesdropper even with great eavesdropping capability.

arXiv:2002.07841•Feb 16, 2020•0 citations

Information reconciliation methods in secret key distribution

David Elkouss

We consider in this thesis the problem of information reconciliation in the context of secret key distillation between two legitimate parties. In some scenarios of interest this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel. In particular, we demonstrate that our method leads to a significant efficiency improvement, with respect to earlier interactive reconciliation methods. We propose a protocol based on LDPC codes that can be adapted to changes in the communication channel extending the original source. The efficiency of our protocol is only limited by the quality of the code and, while transmitting more information than needed to reconcile Alice’s and Bob’s sequences, it does not reveal any more information on the original source than an ad-hoc code would have revealed.---ABSTRACT---En esta tesis estudiamos el problema de la reconciliación de información en el contexto de la destilación de secreto entre dos partes. En algunos escenarios de interés, códigos de baja densidad de ecuaciones de paridad (LDPC) adaptados al canal binario simétrico ofrecen una buena solución al problema estudiado. Demostramos que nuestro método mejora significativamente la eficiencia de la reconciliación. Proponemos un protocolo basado en códigos LDPC que puede ser adaptado a cambios en el canal de comunicaciones mediante una extensión de la fuente original. La eficiencia de nuestro protocolo está limitada exclusivamente por el código utilizado y no revela información adicional sobre la fuente original que la que un código con la tasa de información adaptada habría revelado.

•Jan 1, 2011•1 citation

Efficient Reconciliation Protocol with Polar Codes for Quantum Key Distribution

Sunghoon Lee, Jun Heo

Information reconciliation is a critical process of any Quantum Key Distribution (QKD) protocol, where two legitimate parties agree on a secret key. Two parties attempt to eliminate the discrepancies between their correlated keys in the presence of an adversary, while revealing a minimum amount of information. In this paper, we propose a reconciliation protocol using polar codes with a soft-output decoder. We demonstrate that our method is better than a conventional protocol using polar codes in the view of reconciliation efficiency.

International Conference on Ubiquitous and Future Networks•Jul 1, 2018•12 citations

Efficient information reconciliation in quantum key distribution systems using informed design of non-binary LDPC codes

Debarnab Mitra, Jayanth Shreekumar, Lev Tauz +3 more

Abstract In quantum key distribution (QKD), two users extract a shared secret key using a quantum communication channel in the presence of an eavesdropper. Among QKD protocols, the ones based on energy-time (ET) entanglement of photons have been studied extensively due to their ability to generate high key rates from the arrival times of entangled photons. For the information reconciliation (IR) stage of ET-QKD protocols (where the users communicate using a classical channel in order to reconcile differences in their data), a scheme called multi-level coding (MLC) was proposed by Zhou et al. in prior work. The MLC scheme splits the raw key symbols into bit layers and utilizes binary low-density parity check (LDPC) codes to encode each layer. Although binary LDPC codes are able to offer low complexity decoding for IR, they have poor error-correcting performance compared to their non-binary counterparts, thus leading to low key rates. Additionally, existing LDPC codes do not fully utilize the properties of the QKD channel to optimize the key rates. In this paper, we mitigate the above issues by proposing a flexible protocol for IR in ET-QKD systems called non-binary multi-level coding ( a ) which is parameterized by a positive integer a . The ( a ) protocol is a generalization of the MLC scheme and utilizes NB-LDPC codes from a Galois field of size $$2^a$$ 2 a . We show that by using a small value of a , the ( a ) protocol significantly improves the key rate without much increase in complexity. To further improve the key rates of the ( a ) protocol, we propose (i) a joint rate and degree distribution optimization (JRDO) algorithm to design the NB-LDPC codes for the protocol and (ii) an interleaved decoding and communication (IDC) scheme to decode the different layers of the ( a ) protocol. The JRDO algorithm is designed to use the QKD channel information, and we show that it results in a higher key rate than codes used in prior work. Additionally, the IDC scheme improves the key rate compared to the decoding and communication methods utilized previously in literature. Overall, the ( a ) protocol that uses JRDO-LDPC codes and the IDC scheme results in a significant 40–60 $$\%$$ % improvement in key rates compared to prior work for ET-QKD systems.

Quantum Information Processing•Apr 3, 2024•5 citations
Reconciliation is an essential part of any secret-key agreement protocol and hence of a quantum key distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel (BSC). In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.
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.
Abstract Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 10 6 . Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.
Reconciliation is a mechanism allowing to weed out the discrepancies between two correlated variables. It has great role in every Quantum Key Distribution protocol where the key has to be transmitted through a noisy channel or as in our case of study in presence of an eavesdropping. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Turbo codes. In particular, we demonstrate that our method leads to a significant improvement of Bit Error Rate, may divide it by three in presence of a eavesdropper even with great eavesdropping capability.
We consider in this thesis the problem of information reconciliation in the context of secret key distillation between two legitimate parties. In some scenarios of interest this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel. In particular, we demonstrate that our method leads to a significant efficiency improvement, with respect to earlier interactive reconciliation methods. We propose a protocol based on LDPC codes that can be adapted to changes in the communication channel extending the original source. The efficiency of our protocol is only limited by the quality of the code and, while transmitting more information than needed to reconcile Alice’s and Bob’s sequences, it does not reveal any more information on the original source than an ad-hoc code would have revealed.---ABSTRACT---En esta tesis estudiamos el problema de la reconciliación de información en el contexto de la destilación de secreto entre dos partes. En algunos escenarios de interés, códigos de baja densidad de ecuaciones de paridad (LDPC) adaptados al canal binario simétrico ofrecen una buena solución al problema estudiado. Demostramos que nuestro método mejora significativamente la eficiencia de la reconciliación. Proponemos un protocolo basado en códigos LDPC que puede ser adaptado a cambios en el canal de comunicaciones mediante una extensión de la fuente original. La eficiencia de nuestro protocolo está limitada exclusivamente por el código utilizado y no revela información adicional sobre la fuente original que la que un código con la tasa de información adaptada habría revelado.
Information reconciliation is a critical process of any Quantum Key Distribution (QKD) protocol, where two legitimate parties agree on a secret key. Two parties attempt to eliminate the discrepancies between their correlated keys in the presence of an adversary, while revealing a minimum amount of information. In this paper, we propose a reconciliation protocol using polar codes with a soft-output decoder. We demonstrate that our method is better than a conventional protocol using polar codes in the view of reconciliation efficiency.
Abstract In quantum key distribution (QKD), two users extract a shared secret key using a quantum communication channel in the presence of an eavesdropper. Among QKD protocols, the ones based on energy-time (ET) entanglement of photons have been studied extensively due to their ability to generate high key rates from the arrival times of entangled photons. For the information reconciliation (IR) stage of ET-QKD protocols (where the users communicate using a classical channel in order to reconcile differences in their data), a scheme called multi-level coding (MLC) was proposed by Zhou et al. in prior work. The MLC scheme splits the raw key symbols into bit layers and utilizes binary low-density parity check (LDPC) codes to encode each layer. Although binary LDPC codes are able to offer low complexity decoding for IR, they have poor error-correcting performance compared to their non-binary counterparts, thus leading to low key rates. Additionally, existing LDPC codes do not fully utilize the properties of the QKD channel to optimize the key rates. In this paper, we mitigate the above issues by proposing a flexible protocol for IR in ET-QKD systems called non-binary multi-level coding ( a ) which is parameterized by a positive integer a . The ( a ) protocol is a generalization of the MLC scheme and utilizes NB-LDPC codes from a Galois field of size 2a2^a2a 2 a . We show that by using a small value of a , the ( a ) protocol significantly improves the key rate without much increase in complexity. To further improve the key rates of the ( a ) protocol, we propose (i) a joint rate and degree distribution optimization (JRDO) algorithm to design the NB-LDPC codes for the protocol and (ii) an interleaved decoding and communication (IDC) scheme to decode the different layers of the ( a ) protocol. The JRDO algorithm is designed to use the QKD channel information, and we show that it results in a higher key rate than codes used in prior work. Additionally, the IDC scheme improves the key rate compared to the decoding and communication methods utilized previously in literature. Overall, the ( a ) protocol that uses JRDO-LDPC codes and the IDC scheme results in a significant 40–60 %\%% % improvement in key rates compared to prior work for ET-QKD systems.