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

Quantum Information and Computation

Study on error reconciliation in quantum key distribution

Qiong Li, Dan Le, Haokun Mao, Xiamu Niu, Tian Liu, Hong Mei Guo

Published Oct 1, 2014• 12 citations
Publisher

Abstract

As one of the most important procedure in quantum key distribution system, the error reconciliation algorithm has drew many attentions. However, studies on the error reconciliation algorithm mainly focuses on the reconciliation efficiency. Since the ultimate goal of study on the error reconciliation is to find the most suitable algorithm for a quantum key distribution system and maximize the throughput rate of the whole system, the indicator of reconciliation efficiency is not full-scale enough to evaluate an error reconciliation algorithm. In this paper we propose a new evaluation scheme, including four direct indicators and one composite indicator to solve the problem. Following the new scheme, seven representative error reconciliation algorithms are simulated and compared thoroughly, i.e. BBBSS, the original Cascade and two improved Cascade algorithms, Winnow, and two LDPC based algorithms. Our works are very beneficial to the evaluation, comparison, selection and optimization of error reconciliation algorithms for a practical quantum key distribution system.

DOI
10.26421/qic14.13-14-5

Related papers

An analysis of error reconciliation protocols used in Quantum Key Distribution systems

James Samuel Johnson, Michael R. Grimaila, Jeffrey W. Humphries +1 more

Quantum Key Distribution (QKD) is a revolutionary security technology that exploits the laws of quantum mechanics to achieve information-theoretic secure key exchange. QKD enables two parties to “grow” a shared secret key without placing any limits on an adversary’s computational power. Error reconciliation protocols have been developed that preserve security while allowing a sender and receiver to reconcile the errors in their respective keys. The most famous of these is the Cascade protocol, which is effective but suffers from a high communication complexity and low throughput. The Winnow protocol reduces the communication complexity over Cascade, but has the disadvantage of introducing errors. Finally, Low Density Parity Check (LDPC) codes have been shown to reconcile errors at rates higher than those of Cascade and Winnow, but with greater computational complexity. In this paper we evaluate the effectiveness of LDPC codes by comparing the runtime, throughput and communication complexity empirically with the Cascade and Winnow algorithms. The effects of inaccurate error estimation, non-uniform error distribution and varying key length on all three protocols are evaluated for identical input key strings. Analyses are performed on the results in order to characterize the strengths and weaknesses of each protocol.

The Journal of Defense Modeling and Simulation Applications Methodology Technology•Sep 11, 2013•28 citations

A Novel Error Correction Scheme In Quantum Key Distribution (Qkd) Protocol

Siao Ping Lee, Chee Kyun Ng, Makhfudzah Binti Mokhtar

Ideally, in any quantum key distribution (QKD) communication system, each sifted key is expected to be received without error. However in practice, due to infeasibility of generating pure single photon and device impairment problem, some of the sifted key may experience errors. This results to the increment of quantum bit error rate (QBER) that requires error reconciliation for correcting error. The main concept in error reconciliation is very much related to the capability of correcting all errors while minimizing eavesdrop information. The quantum error correcting code such as Hamming code which used in Winnow protocol is found to be more attractive. However the Winnow protocol can only correct one error out of seven bits. Adopting this classical error correcting code, an improved reconciliation scheme namely Siao Ping 1985 (SP 1985) protocol is proposed in this paper to correct more errors in faster pace without additional formulation for the overall simplicity criterion. This research is aimed at building up efficiency and effectiveness of reconciliation of the robust BB84 protocol in coping with noise interference. The proposed SP 1985 reconciliation protocol utilizes a pair of forward and reverse order syndromes for error pattern recognition. It is carried out in a simple structure which can correct up to double erroneous bits and detect four erroneous bits for each seven bits. Therefore, it is sufficient to deliver the desirable outcome after investigating its capability by correcting two errors out of seven bits compared to Winnow protocol. Its effectiveness can be measured based on simulation result which leads to reducing the QBER.

Malaysian Journal of Computer Science•Sep 23, 2017•1 citation

An Analysis of Error Reconciliation Protocols for use in Quantum Key Distribution

James Samuel Johnson

Abstract : Quantum Key Distribution (QKD) is a method for transmitting a cryptographic key between a sender and receiver in a theoretically unconditionally secure way. Unfortunately, the present state of technology prohibits the flawless quantum transmission required to make QKD a reality. For this reason, error reconciliation protocols have been developed which preserve security while allowing a sender and receiver to reconcile the errors in their respective keys. The most famous of these protocols is Brassard and Salvail's Cascade, which is effective, but suffers from a high communication complexity and therefore results in low throughput. Another popular option is Buttler's Winnow protocol, which reduces the communication complexity over Cascade, but has the added detriment of introducing errors, and has been shown to be less effective than Cascade. Finally, Gallager's Low Density Parity Check (LDPC) codes have recently been shown to reconcile errors at rates higher than those of Cascade and Winnow with a large reduction in communication, but with greater computational complexity. This research seeks to evaluate the effectiveness of these LDPC codes in a QKD setting, while comparing real-world parameters such as runtime, throughput and communication complexity empirically with the well-known Cascade and Winnow algorithms. Additionally, the effects of inaccurate error estimation, non-uniform error distribution and varying key length on all three protocols are evaluated for identical input key strings. Analyses are performed on the results in order to characterize the performance of all three protocols and determine the strengths and weaknesses of each.

•Feb 1, 2012•8 citations

A Novel Error Correction Scheme in Quantum Key Distribution (QKD) Protocol

Siao Ping Lee, Chee Kyun Ng, Makhfudzah Binti Mokhtar

Ideally, in any quantum key distribution (QKD) communication system, each sifted key is expected to be received without error. However in practice, due to infeasibility of generating pure single photon and device impairment problem, some of the sifted key may experience errors. This results to the increment of quantum bit error rate (QBER) that requires error reconciliation for correcting error. The main concept in error reconciliation is very much related to the capability of correcting all errors while minimizing eavesdrop information. The quantum error correcting code such as Hamming code which used in Winnow protocol is found to be more attractive. However the Winnow protocol can only correct one error out of seven bits. In this paper, a modified Hamming encoder/decoder to improve Winnow protocol by correcting two errors out of seven bits which leads to reducing the QBER is presented. This design utilizes a pair of forward and reverse order syndromes for error pattern recognition. A new reconciliation protocol has been developed to enhance the error correcting capability in BB84 protocol. It is carried out in a simple structure which can correct up to double erroneous bits and detect four erroneous bits for each seven bits.

Proceedings of the Asia-Pacific Advanced Network•Oct 21, 2015•0 citations

Multi-matrix error estimation and reconciliation for quantum key distribution

Chaohui Gao, Dong Jiang, Yu Guo +1 more

Post-processing is a significant step in quantum key distribution (QKD), which is used for correcting the quantum-channel noise errors and distilling identical corrected keys between two distant legitimate parties. Efficient error reconciliation protocol, which can lead to an increase in the secure key generation rate, is one of the main performance indicators of QKD setups. In this paper, we propose a multi-low-density parity-check codes based reconciliation scheme, which can provide remarkable perspectives for highly efficient information reconciliation. By testing our approach through data simulation, we show that the proposed scheme combining multi-syndrome-based error rate estimation allows for a more accurate estimation of the error rate as compared with random sampling and single-syndrome estimation techniques before the error correction, as well as a significant increase in the efficiency of the procedure without compromising security and sacrificing reconciliation efficiency.

arXiv:1902.05263•Optics Express•May 6, 2019•23 citations

Study on Scrambling Algorithms of Error Reconciliation in QKD

Qiong Li, Zhiyu Yang, Haokun Mao +1 more

Quantum key distribution (referred to as QKD) is a technology that can produce and distribute secret keys unconditionally secure based on the principle of quantum mechanics. In a practical QKD system, the reconciliation efficiency is crucial to the final key rate of the system. A practical QKD system may produce the uneven error distribution of the sifted key due to the instabilities of optical and electronic devices and some other reasons, which will lead to the low reconciliation efficiency. Therefore, to scramble the sifted key is adopted in many QKD systems. In this paper, an Arnold-based Scrambling Algorithm and Fast Exchange Scrambling Algorithm are proposed mainly for the CASCADE class and WINNOW class error reconciliation algorithms. The experimental results demonstrate that the proposed algorithms provide the lower computational complexity and higher scrambling efficiency than the representative scrambling algorithm in QKD.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Jul 1, 2018•4 citations
As one of the most important procedure in quantum key distribution system, the error reconciliation algorithm has drew many attentions. However, studies on the error reconciliation algorithm mainly focuses on the reconciliation efficiency. Since the ultimate goal of study on the error reconciliation is to find the most suitable algorithm for a quantum key distribution system and maximize the throughput rate of the whole system, the indicator of reconciliation efficiency is not full-scale enough to evaluate an error reconciliation algorithm. In this paper we propose a new evaluation scheme, including four direct indicators and one composite indicator to solve the problem. Following the new scheme, seven representative error reconciliation algorithms are simulated and compared thoroughly, i.e. BBBSS, the original Cascade and two improved Cascade algorithms, Winnow, and two LDPC based algorithms. Our works are very beneficial to the evaluation, comparison, selection and optimization of error reconciliation algorithms for a practical quantum key distribution system.
Quantum Key Distribution (QKD) is a revolutionary security technology that exploits the laws of quantum mechanics to achieve information-theoretic secure key exchange. QKD enables two parties to “grow” a shared secret key without placing any limits on an adversary’s computational power. Error reconciliation protocols have been developed that preserve security while allowing a sender and receiver to reconcile the errors in their respective keys. The most famous of these is the Cascade protocol, which is effective but suffers from a high communication complexity and low throughput. The Winnow protocol reduces the communication complexity over Cascade, but has the disadvantage of introducing errors. Finally, Low Density Parity Check (LDPC) codes have been shown to reconcile errors at rates higher than those of Cascade and Winnow, but with greater computational complexity. In this paper we evaluate the effectiveness of LDPC codes by comparing the runtime, throughput and communication complexity empirically with the Cascade and Winnow algorithms. The effects of inaccurate error estimation, non-uniform error distribution and varying key length on all three protocols are evaluated for identical input key strings. Analyses are performed on the results in order to characterize the strengths and weaknesses of each protocol.
Ideally, in any quantum key distribution (QKD) communication system, each sifted key is expected to be received without error. However in practice, due to infeasibility of generating pure single photon and device impairment problem, some of the sifted key may experience errors. This results to the increment of quantum bit error rate (QBER) that requires error reconciliation for correcting error. The main concept in error reconciliation is very much related to the capability of correcting all errors while minimizing eavesdrop information. The quantum error correcting code such as Hamming code which used in Winnow protocol is found to be more attractive. However the Winnow protocol can only correct one error out of seven bits. Adopting this classical error correcting code, an improved reconciliation scheme namely Siao Ping 1985 (SP 1985) protocol is proposed in this paper to correct more errors in faster pace without additional formulation for the overall simplicity criterion. This research is aimed at building up efficiency and effectiveness of reconciliation of the robust BB84 protocol in coping with noise interference. The proposed SP 1985 reconciliation protocol utilizes a pair of forward and reverse order syndromes for error pattern recognition. It is carried out in a simple structure which can correct up to double erroneous bits and detect four erroneous bits for each seven bits. Therefore, it is sufficient to deliver the desirable outcome after investigating its capability by correcting two errors out of seven bits compared to Winnow protocol. Its effectiveness can be measured based on simulation result which leads to reducing the QBER.
Abstract : Quantum Key Distribution (QKD) is a method for transmitting a cryptographic key between a sender and receiver in a theoretically unconditionally secure way. Unfortunately, the present state of technology prohibits the flawless quantum transmission required to make QKD a reality. For this reason, error reconciliation protocols have been developed which preserve security while allowing a sender and receiver to reconcile the errors in their respective keys. The most famous of these protocols is Brassard and Salvail's Cascade, which is effective, but suffers from a high communication complexity and therefore results in low throughput. Another popular option is Buttler's Winnow protocol, which reduces the communication complexity over Cascade, but has the added detriment of introducing errors, and has been shown to be less effective than Cascade. Finally, Gallager's Low Density Parity Check (LDPC) codes have recently been shown to reconcile errors at rates higher than those of Cascade and Winnow with a large reduction in communication, but with greater computational complexity. This research seeks to evaluate the effectiveness of these LDPC codes in a QKD setting, while comparing real-world parameters such as runtime, throughput and communication complexity empirically with the well-known Cascade and Winnow algorithms. Additionally, the effects of inaccurate error estimation, non-uniform error distribution and varying key length on all three protocols are evaluated for identical input key strings. Analyses are performed on the results in order to characterize the performance of all three protocols and determine the strengths and weaknesses of each.
Ideally, in any quantum key distribution (QKD) communication system, each sifted key is expected to be received without error. However in practice, due to infeasibility of generating pure single photon and device impairment problem, some of the sifted key may experience errors. This results to the increment of quantum bit error rate (QBER) that requires error reconciliation for correcting error. The main concept in error reconciliation is very much related to the capability of correcting all errors while minimizing eavesdrop information. The quantum error correcting code such as Hamming code which used in Winnow protocol is found to be more attractive. However the Winnow protocol can only correct one error out of seven bits. In this paper, a modified Hamming encoder/decoder to improve Winnow protocol by correcting two errors out of seven bits which leads to reducing the QBER is presented. This design utilizes a pair of forward and reverse order syndromes for error pattern recognition. A new reconciliation protocol has been developed to enhance the error correcting capability in BB84 protocol. It is carried out in a simple structure which can correct up to double erroneous bits and detect four erroneous bits for each seven bits.
Post-processing is a significant step in quantum key distribution (QKD), which is used for correcting the quantum-channel noise errors and distilling identical corrected keys between two distant legitimate parties. Efficient error reconciliation protocol, which can lead to an increase in the secure key generation rate, is one of the main performance indicators of QKD setups. In this paper, we propose a multi-low-density parity-check codes based reconciliation scheme, which can provide remarkable perspectives for highly efficient information reconciliation. By testing our approach through data simulation, we show that the proposed scheme combining multi-syndrome-based error rate estimation allows for a more accurate estimation of the error rate as compared with random sampling and single-syndrome estimation techniques before the error correction, as well as a significant increase in the efficiency of the procedure without compromising security and sacrificing reconciliation efficiency.
Quantum key distribution (referred to as QKD) is a technology that can produce and distribute secret keys unconditionally secure based on the principle of quantum mechanics. In a practical QKD system, the reconciliation efficiency is crucial to the final key rate of the system. A practical QKD system may produce the uneven error distribution of the sifted key due to the instabilities of optical and electronic devices and some other reasons, which will lead to the low reconciliation efficiency. Therefore, to scramble the sifted key is adopted in many QKD systems. In this paper, an Arnold-based Scrambling Algorithm and Fast Exchange Scrambling Algorithm are proposed mainly for the CASCADE class and WINNOW class error reconciliation algorithms. The experimental results demonstrate that the proposed algorithms provide the lower computational complexity and higher scrambling efficiency than the representative scrambling algorithm in QKD.