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 Hybrid Intelligent Systems (HIS)

Research on Reconciliation Algorithm in Quantum Key Distribution

Changqing Gong, Hong-yuan Zhou, Jian-li Feng

Published Jan 1, 2009• 5 citations
Publisher

Abstract

The quantum cryptography is an emerging technology, which uses quantum mechanics properties of micro-particles to encode information. In the theory and practice, it has been proved to be totally safe. Because of quantum channel being susceptible to be interfered by noise, error correction in quantum communication is facing a big problem today. This article will focus on cyclic redundancy check (CRC) replacing parity check in the protocol binary mainly in order to improve the efficiency of error correction and reduce the frequency of communication. And then its performance will be contrasted with the protocol binary with parity check by the self-designed simulation platform. The result shows that protocol binary with CRC can improve efficiency by up to around 50%.

DOI
10.1109/his.2009.102

Related papers

An Improvement of Protocol Binary in Reconciliation of Quantum Key Distribution

Changqing Gong, Hong-yuan Zhou, Jian-li Feng

As the quantum channel being susceptible to be interfered by noise, the reconciliation in a quantum communication is so important. Though its security is high, the efficiency of protocol binary is low because it needs to repeat the algorithm many times for the even-digit mistakes not being able to be founded. This article will focus on an improvement of protocol binary with the Message-digest Algorithm 5 (MD5) replacing parity check and the advantage is that all kinds of mistakes can be found while the security keeps still high. And then its performance will be contrasted with the protocol binary with parity check by the self-designed simulation platform. The result shows that protocol binary with MD5 can improve efficiency by up to around 45%.

International Conference on Management and Service Science (MASS)•Sep 1, 2009•5 citations

Improved reconciliation with polar codes in quantum key distribution

Sunghoon Lee, Joo Youn Park, Jun Heo

Quantum key distribution (QKD) is a cryptographic system that generates an information-theoretically secure key shared by two legitimate parties. QKD consists of two parts: quantum and classical. The latter is referred to as classical post-processing (CPP). Information reconciliation is a part of CPP in which parties are given correlated variables and attempt to eliminate the discrepancies between them while disclosing a minimum amount of information. The elegant reconciliation protocol known as \emph{Cascade} was developed specifically for QKD in 1992 and has become the de-facto standard for all QKD implementations. However, the protocol is highly interactive. Thus, other protocols based on linear block codes such as Hamming codes, low-density parity-check (LDPC) codes, and polar codes have been researched. In particular, reconciliation using LDPC codes has been mainly studied because of its outstanding performance. Nevertheless, with small block size, the bit error rate performance of polar codes under successive-cancellation list (SCL) decoding with a cyclic redundancy check (CRC) is comparable to state-of-the-art turbo and LDPC codes. In this study, we demonstrate the use of polar codes to improve the performance of information reconciliation in a QKD system with small block size. The best decoder for polar codes, a CRC-aided SCL decoder, requires CRC-precoded messages. However, messages that are sifted keys in QKD are obtained arbitrarily as a result of a characteristic of the QKD protocol and cannot be CRC-precoded. We propose a method that allows arbitrarily obtained sifted keys to be CRC precoded by introducing a virtual string. Thus the best decoder can be used for reconciliation using polar codes and improves the efficiency of the protocol.

arXiv:1805.05046•Quantum Information and Computation•Aug 1, 2018•4 citations

Error correction and detection techniques in quantum cryptography protocol

S H Sreelatha, G. Murali

Quantum Cryptography evolves a technology which provides secure communication. In this work error correction and detection techniques are used to correct and detect the errors which occur either due to noise or attacks while transferring bits. The main objective of this paper is using error correction and detection techniques to correct and detect the error and analyze the comparison between BB84 Protocol, BB84 using Parity Bits and BB84 using Cyclic Redundancy Check for the number of bits match and mismatch frequency between sender and receiver. This methodology can be implemented using Mat lab simulator. It is very easy to analyze mathematically when compared to theoretical process.

International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS)•Aug 1, 2017•3 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•1 citation

OPTIMIZED CASCADE PROTOCOL FOR EFFICIENT INFORMATION RECONCILIATION IN QUANTUM KEY DISTRIBUTION SYSTEMS

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.

•Jan 1, 2018•2 citations

High efficiency continuous-variable quantum key distribution based on QC-LDPC codes

Ying Guo, Kangshuai Wang, Duan Huang +1 more

Seeking good error correcting codes to improve the efficiency of continuous-variable quantum key distribution (CVQKD) reconciliation is a concerning issue. Due to the introduction of multidimensional reconciliation, the error correcting techniques in the classical binary-input additive white Gaussian noise channel are applicable to CVQKD. In this Letter, we apply the quasi-cyclic low-density parity-check (QC-LDPC) codes, which are specified in 5G protocol, to the reconciliation process. Simulation results show that the reconciliation efficiency can reach 92.6% when the code rate is 22/68 and the signal-to-noise ratio is 0.623. Such a new error correcting code points out a new direction for the development of CVQKD.

Chinese Optics Letters•Jan 1, 2019•8 citations
The quantum cryptography is an emerging technology, which uses quantum mechanics properties of micro-particles to encode information. In the theory and practice, it has been proved to be totally safe. Because of quantum channel being susceptible to be interfered by noise, error correction in quantum communication is facing a big problem today. This article will focus on cyclic redundancy check (CRC) replacing parity check in the protocol binary mainly in order to improve the efficiency of error correction and reduce the frequency of communication. And then its performance will be contrasted with the protocol binary with parity check by the self-designed simulation platform. The result shows that protocol binary with CRC can improve efficiency by up to around 50%.
As the quantum channel being susceptible to be interfered by noise, the reconciliation in a quantum communication is so important. Though its security is high, the efficiency of protocol binary is low because it needs to repeat the algorithm many times for the even-digit mistakes not being able to be founded. This article will focus on an improvement of protocol binary with the Message-digest Algorithm 5 (MD5) replacing parity check and the advantage is that all kinds of mistakes can be found while the security keeps still high. And then its performance will be contrasted with the protocol binary with parity check by the self-designed simulation platform. The result shows that protocol binary with MD5 can improve efficiency by up to around 45%.
Quantum key distribution (QKD) is a cryptographic system that generates an information-theoretically secure key shared by two legitimate parties. QKD consists of two parts: quantum and classical. The latter is referred to as classical post-processing (CPP). Information reconciliation is a part of CPP in which parties are given correlated variables and attempt to eliminate the discrepancies between them while disclosing a minimum amount of information. The elegant reconciliation protocol known as \emph{Cascade} was developed specifically for QKD in 1992 and has become the de-facto standard for all QKD implementations. However, the protocol is highly interactive. Thus, other protocols based on linear block codes such as Hamming codes, low-density parity-check (LDPC) codes, and polar codes have been researched. In particular, reconciliation using LDPC codes has been mainly studied because of its outstanding performance. Nevertheless, with small block size, the bit error rate performance of polar codes under successive-cancellation list (SCL) decoding with a cyclic redundancy check (CRC) is comparable to state-of-the-art turbo and LDPC codes. In this study, we demonstrate the use of polar codes to improve the performance of information reconciliation in a QKD system with small block size. The best decoder for polar codes, a CRC-aided SCL decoder, requires CRC-precoded messages. However, messages that are sifted keys in QKD are obtained arbitrarily as a result of a characteristic of the QKD protocol and cannot be CRC-precoded. We propose a method that allows arbitrarily obtained sifted keys to be CRC precoded by introducing a virtual string. Thus the best decoder can be used for reconciliation using polar codes and improves the efficiency of the protocol.
Quantum Cryptography evolves a technology which provides secure communication. In this work error correction and detection techniques are used to correct and detect the errors which occur either due to noise or attacks while transferring bits. The main objective of this paper is using error correction and detection techniques to correct and detect the error and analyze the comparison between BB84 Protocol, BB84 using Parity Bits and BB84 using Cyclic Redundancy Check for the number of bits match and mismatch frequency between sender and receiver. This methodology can be implemented using Mat lab simulator. It is very easy to analyze mathematically when compared to theoretical process.
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.
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.
Seeking good error correcting codes to improve the efficiency of continuous-variable quantum key distribution (CVQKD) reconciliation is a concerning issue. Due to the introduction of multidimensional reconciliation, the error correcting techniques in the classical binary-input additive white Gaussian noise channel are applicable to CVQKD. In this Letter, we apply the quasi-cyclic low-density parity-check (QC-LDPC) codes, which are specified in 5G protocol, to the reconciliation process. Simulation results show that the reconciliation efficiency can reach 92.6% when the code rate is 22/68 and the signal-to-noise ratio is 0.623. Such a new error correcting code points out a new direction for the development of CVQKD.