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:2002.07778 · Mediterranean Microwave Symposium

Reconciliation for practical quantum key distribution with BB84 protocol

N. Benletaief, H. Rezig, A. Bouallegue

Published Sep 1, 2011• 8 citations
arXivHTMLPDF

Abstract

This paper investigates a new information reconciliation method for quantum key distribution in the case where two parties exchange key in the presence of a malevolent eavesdropper. We have observed that reconciliation is a special case of channel coding and for that existing techniques can be adapted for reconciliation. We describe an explicit reconciliation method based on Turbo codes. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on discrete quantum states.

DOI
10.1109/mms.2011.6068566

Related papers

Toward Efficient Quantum Key Distribution Reconciliation

Nedra Benletaief, Houria Rezig, Ammar Bouallègue

In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low- Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability.

arXiv:2002.04887•Feb 12, 2020•0 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

Toward Efficient Quantum Key Distribution Reconciliation

Nedra Benletaief, Houria Rezig, Ammar Bouallègue

In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low-Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability.

Journal of Quantum Information Science•Jan 1, 2014•13 citations

Efficient information reconciliation with turbo codes over the quantum channel

Sungsik Yoon, Jun Heo

In this paper, we introduce a new error correcting protocol in quantum key distribution. With this method, leakage information during the information reconciliation is reduced and a longer key can be obtained. In order to correct errors on the quantum key, we apply the turbo codes and transmit the parity information over the quantum channel. We compare loss rate of the proposed information reconciliation method with a conventional scheme in quantum key distribution.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 1, 2013•2 citations

Efficient reconciliation protocol for discrete-variable quantum key distribution

David Elkouss, Anthony Leverrier, Romain Alléaume +1 more

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.

arXiv:0901.2140•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•167 citations

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
This paper investigates a new information reconciliation method for quantum key distribution in the case where two parties exchange key in the presence of a malevolent eavesdropper. We have observed that reconciliation is a special case of channel coding and for that existing techniques can be adapted for reconciliation. We describe an explicit reconciliation method based on Turbo codes. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on discrete quantum states.
In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low- Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability.
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.
In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low-Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability.
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 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.