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

International Conference on Information and Communication Technology Convergence (ICTC)

Efficient information reconciliation with turbo codes over the quantum channel

Sungsik Yoon, Jun Heo

Published Oct 1, 2013• 2 citations
Publisher

Abstract

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.

DOI
10.1109/ictc.2013.6675563

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•Journal of Quantum Information Science•Jan 1, 2014•14 citations

Optimized CASCADE protocol for efficient information reconciliation

Metin Toyran, Mustafa Toyran, Sıtkı Öztürk

CASCADE protocol is an error detection and correction (EDC) method proposed firstly for use in quantum key distribution (QKD) systems. It is used to detect and correct all the errors in keys transmitted over a noisy quantum channel. This is done by sending some redundant information about the key to receiver as usual. However, just as differently, this extra information is sent over another noiseless classical channel after the quantum transmission is completely finished. Briefly, all the errors in noisy quantum communication are detected and corrected by a later noiseless classical communication using CASCADE protocol. In QKD literature, this EDC process is also called as information reconciliation (IR) or secret key reconciliation (SKR). For an IR protocol in QKD, one of the main performance measures is efficiency which depends on the amount of redundant information sent to make EDC possible. Since this extra information is transmitted over public channels, everyone can get it easily. Because this can damage the secrecy of keys that must be kept secret from third parties, more efficient, that is revealing less information about keys, IR methods are needed. In this paper, we present more efficient implementations of CASCADE protocol, using some inherent information already available in the protocol, exactly known bits and already known parities. This information is used in error detection and correction steps of the protocol to decrease the redundancy in redundant information. Our experiments have shown that the resulting protocols have higher efficiency than both all the previous CASCADE versions and several other more recently proposed IR methods.

Quantum Information and Computation•Jun 1, 2018•3 citations

Reconciliation for practical quantum key distribution with BB84 protocol

N. Benletaief, H. Rezig, A. Bouallegue

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.

arXiv:2002.07778•Mediterranean Microwave Symposium•Sep 1, 2011•9 citations

One-way information reconciliation schemes of quantum key distribution

Li Yang, Hua Dong, Li Zhao

With the rapid improvement of quantum computing technology, quantum key distribution(QKD) is a hot technology. Information reconciliation is a key step of QKD which is useful for correcting key error. Classical message interaction is necessary in a practical information reconciliation scheme, which makes the efficiency of these protocols decreased. Therefore, some one-way information reconciliation schemes based on low-density parity-check(LDPC) codes and polar codes are proposed. Here we propose a concatenated method of IR schemes which can achieve any given error rate level without the need of interactions. Compared with the one-way IR schems based on LDPC codes and polar codes, the IR schemes based on the proposed concatenated method can get lower bit error rates after error correction, which can also reduce the communication delay and system complexity of QKD, improve the final key generation rate and enhance the practicability of QKD system.

Cybersecurity•May 22, 2019•11 citations

Reconciliation of Quantum Gaussian Distributed Key based on Turbo Codes

郭大波 Guo Dabo, 张宁 Zhang Ning, 刘纲 LIU Gang

Two legitimate users of an encryption system,Alice and Bob,want to acquire the key from the related Gaussian continuous variables X and Y transferred through a quantum channel,by exchanging parts of information through an ideal public authorized channel,and they get consistent binary keys from the inconsistent X and Y.This process is referred to reconciliation.This paper builds a reconciliation scheme for continuous-variables quantum key distribution using Turbo codes as the primitive code,on the basis of Sliced Error Correction(SEC) and Multi Level coding/Multi Stage Decoding(MLC/MSD).Parity bits of Turbo code are employed as the redundant information in the Slepian-Wolf encoding and decoding scheme.The simulation results show that the reconciliation convergences when the SNR is 7dB above whilst the block size is 20000.

Acta Sinica Quantum Optica•Jan 1, 2013•1 citation

A Polynomial Interpolation based Quantum Key Reconciliation Protocol: Error Correction without Information Leakage

Güneş Karabulut Kurt, Enver Ozdemır, Neslihan Ayşen Özkirişçi +2 more

In this work, we propose a novel key reconciliation protocol for the quantum key distribution (QKD). Based on Newton's polynomial interpolation, the proposed protocol aims to correct all erroneous bits at the receiver without revealing information to the eavesdropper. We provide the exact frame error rate (FER) expression of the proposed protocol. The inherent nature of the proposed algorithm ensures correcting all erroneous bits if the algorithm succeeds. We present an information-theoretical proof that the revealed information during the key reconciliation process is equal to zero. We also provide a numerical comparison of our algorithm with the asymptotic performance of the error-correcting codes and two exemplary low-density-parity-check (LDPC) codes. The results highlight that our algorithm provides superior performance when compared to the LDPC codes, regardless of the distance between Alice and Bob. Furthermore, the proposed key reconciliation protocol is usable for the longer quantum link distances than the state-of-the-art protocols.

arXiv:2004.07061•Apr 15, 2020•4 citations
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.
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.
CASCADE protocol is an error detection and correction (EDC) method proposed firstly for use in quantum key distribution (QKD) systems. It is used to detect and correct all the errors in keys transmitted over a noisy quantum channel. This is done by sending some redundant information about the key to receiver as usual. However, just as differently, this extra information is sent over another noiseless classical channel after the quantum transmission is completely finished. Briefly, all the errors in noisy quantum communication are detected and corrected by a later noiseless classical communication using CASCADE protocol. In QKD literature, this EDC process is also called as information reconciliation (IR) or secret key reconciliation (SKR). For an IR protocol in QKD, one of the main performance measures is efficiency which depends on the amount of redundant information sent to make EDC possible. Since this extra information is transmitted over public channels, everyone can get it easily. Because this can damage the secrecy of keys that must be kept secret from third parties, more efficient, that is revealing less information about keys, IR methods are needed. In this paper, we present more efficient implementations of CASCADE protocol, using some inherent information already available in the protocol, exactly known bits and already known parities. This information is used in error detection and correction steps of the protocol to decrease the redundancy in redundant information. Our experiments have shown that the resulting protocols have higher efficiency than both all the previous CASCADE versions and several other more recently proposed IR methods.
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.
With the rapid improvement of quantum computing technology, quantum key distribution(QKD) is a hot technology. Information reconciliation is a key step of QKD which is useful for correcting key error. Classical message interaction is necessary in a practical information reconciliation scheme, which makes the efficiency of these protocols decreased. Therefore, some one-way information reconciliation schemes based on low-density parity-check(LDPC) codes and polar codes are proposed. Here we propose a concatenated method of IR schemes which can achieve any given error rate level without the need of interactions. Compared with the one-way IR schems based on LDPC codes and polar codes, the IR schemes based on the proposed concatenated method can get lower bit error rates after error correction, which can also reduce the communication delay and system complexity of QKD, improve the final key generation rate and enhance the practicability of QKD system.
Two legitimate users of an encryption system,Alice and Bob,want to acquire the key from the related Gaussian continuous variables X and Y transferred through a quantum channel,by exchanging parts of information through an ideal public authorized channel,and they get consistent binary keys from the inconsistent X and Y.This process is referred to reconciliation.This paper builds a reconciliation scheme for continuous-variables quantum key distribution using Turbo codes as the primitive code,on the basis of Sliced Error Correction(SEC) and Multi Level coding/Multi Stage Decoding(MLC/MSD).Parity bits of Turbo code are employed as the redundant information in the Slepian-Wolf encoding and decoding scheme.The simulation results show that the reconciliation convergences when the SNR is 7dB above whilst the block size is 20000.
In this work, we propose a novel key reconciliation protocol for the quantum key distribution (QKD). Based on Newton's polynomial interpolation, the proposed protocol aims to correct all erroneous bits at the receiver without revealing information to the eavesdropper. We provide the exact frame error rate (FER) expression of the proposed protocol. The inherent nature of the proposed algorithm ensures correcting all erroneous bits if the algorithm succeeds. We present an information-theoretical proof that the revealed information during the key reconciliation process is equal to zero. We also provide a numerical comparison of our algorithm with the asymptotic performance of the error-correcting codes and two exemplary low-density-parity-check (LDPC) codes. The results highlight that our algorithm provides superior performance when compared to the LDPC codes, regardless of the distance between Alice and Bob. Furthermore, the proposed key reconciliation protocol is usable for the longer quantum link distances than the state-of-the-art protocols.