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

Communications technology

Termination of Information Reconciliation Process

Bao Xiao-min

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

Information reconciliation is an important step in both quantum key distribution and unconditional secure key distribution,with the purpose to transform the two non-identical bit strings into two identical ones by exchanging error-correcting information through an authenticated public channel.However,the present known schemes all have the problem that the reconciliation process couldn't be terminated in good time.In this paper,a new scheme for terminating information reconciliation process is proposed,the main idea is to perform r(the value of r is determined by existing experiment results) round of reconciliations first,and then use error-correcting code to check if the two bit strings are identical or not,and if not,errors are corrected.In the new scheme,the round number of reconciliations is fixed and thus a higher efficiency could be achieved,particularly in the case of bit pair reconciliation,all the information exchanged in each round between the two communicating parties,no matter it is the error correction information for error correction code or the parity check sums for bisection method,could be send to the other party all in one time,so the number of information exchanges performed on public channel could be reduced.Simulation on the scheme,which is based on bit pair reconciliation protocol and uses Hamming code or(24,12) Golay code for identical verification,is also performed.

Related papers

An Information Reconciliation Protocol Based on QC-LDPC Code

QU Yun-yu

An information reconciliation protocol based on QC-LDPC code and Winnow protocol is presented in this paper.The main idea is to perform r(the value of r is determined by existing experiment results)rounds of reconciliation first,and then use QC-LDPC code to check whether the two remaining bit strings are identical or not,and if not,errors are corrected.All the information exchanged in each round between the two communicating parties,the parity check sums for bit strings and the error correction information for error correction code could be sent to the other party all in one time,so the number of information exchanges performed on the public channel could be reduced.In the new scheme,the round number of reconciliations is fixed and thus a higher efficiency could be achieved.Simulation on the scheme based on Winnow protocol is performed and QC-LDPC code,whose error correcting capability is 1,is used for identical verification in the simulation.

Journal of Southwest University•Jan 1, 2013•0 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•10 citations

The information reconciliation protocol basing on error codes

Sun Niuniu, Zhang Shui-lian, Xin Gang +1 more

Information reconciliation (IR) is an important step in quantum key distribution (QKD). The error correcting codes are widely used in IR, which can also be seen as error correction. But it proved that this approach contains deleting the leaked information in practical applications. Error coding is not always a guarantee of the reconciliation. It only require of the data's consistency and security. In this paper, Author proposed an improvement scheme of LDPC code on the property of reconciliation and performed some number simulations to evaluate that method. It's shown that this method would achieve a higher efficiency than the original algorithm. Therefore, this algorithm has special important meaning to the key generation.

IEEE International Conference on Software Engineering and Service Science (ICSESS)•May 1, 2013•2 citations

An Efficient Reconciliation in Removing Errors Using Bose, Chaudhuri, Hocquenghem Code for Quantum Key Distribution

Riaz Ahmad Qamar, Mohd Aizaini Maarof, Subariah Ibrahim

A quantum key distribution protocol(QKD), known as BB84, was developed in 1984 by Charles Bennett and Gilles Brassard. The protocol works in two phases which are quantum state transmission and conventional post processing. In the first phase of BB84, raw key elements are distributed between two legitimate users by sending encoded photons through quantum channel whilst in the second phase, a common secret-key is obtained from correlated raw key elements by exchanging messages through a public channel e.g.; network or internet. The secret-key so obtained is used for cryptography purpose. Reconciliation is a compulsory part of post processing and hence of quantum key distribution protocol. The performance of a reconciliation protocol depends on the generation rate of common secret-key, number of bits disclosed and the error probability in common secrete-key. These characteristics of a protocol can be achieved by using a less interactive reconciliation protocol which can handle a higher initial quantum bit error rate (QBER). In this paper, we use a simple Bose, Chaudhuri, Hocquenghem (BCH) error correction algorithm with simplified syndrome table to achieve an efficient reconciliation protocol which can handle a higher quantum bit error rate and outputs a common key with zero error probability. The proposed protocol efficient in removing errors such that it can remove all errors even if QBER is 60%. Assuming the post processing channel is an authenticated binary symmetric channel (BSC).

Jurnal Teknologi•Nov 2, 2012•1 citation

High-Efficient Syndrome-Based LDPC Reconciliation for Quantum Key Distribution

Haokun Mao, Yucheng Qiao, Qiong Li

Quantum key distribution (QKD) is a promising technique to share unconditionally secure keys between remote parties. As an essential part of a practical QKD system, reconciliation is responsible for correcting the errors due to the quantum channel noise by exchanging information through a public classical channel. In the present work, we propose a novel syndrome-based low-density parity-check (LDPC) reconciliation protocol to reduce the information leakage of reconciliation by fully utilizing the syndrome information that was previously wasted. Both theoretical analysis and simulation results show that our protocol can evidently reduce the information leakage as well as the number of communication rounds.

Entropy•Oct 31, 2021•17 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
Information reconciliation is an important step in both quantum key distribution and unconditional secure key distribution,with the purpose to transform the two non-identical bit strings into two identical ones by exchanging error-correcting information through an authenticated public channel.However,the present known schemes all have the problem that the reconciliation process couldn't be terminated in good time.In this paper,a new scheme for terminating information reconciliation process is proposed,the main idea is to perform r(the value of r is determined by existing experiment results) round of reconciliations first,and then use error-correcting code to check if the two bit strings are identical or not,and if not,errors are corrected.In the new scheme,the round number of reconciliations is fixed and thus a higher efficiency could be achieved,particularly in the case of bit pair reconciliation,all the information exchanged in each round between the two communicating parties,no matter it is the error correction information for error correction code or the parity check sums for bisection method,could be send to the other party all in one time,so the number of information exchanges performed on public channel could be reduced.Simulation on the scheme,which is based on bit pair reconciliation protocol and uses Hamming code or(24,12) Golay code for identical verification,is also performed.
An information reconciliation protocol based on QC-LDPC code and Winnow protocol is presented in this paper.The main idea is to perform r(the value of r is determined by existing experiment results)rounds of reconciliation first,and then use QC-LDPC code to check whether the two remaining bit strings are identical or not,and if not,errors are corrected.All the information exchanged in each round between the two communicating parties,the parity check sums for bit strings and the error correction information for error correction code could be sent to the other party all in one time,so the number of information exchanges performed on the public channel could be reduced.In the new scheme,the round number of reconciliations is fixed and thus a higher efficiency could be achieved.Simulation on the scheme based on Winnow protocol is performed and QC-LDPC code,whose error correcting capability is 1,is used for identical verification in the simulation.
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.
Information reconciliation (IR) is an important step in quantum key distribution (QKD). The error correcting codes are widely used in IR, which can also be seen as error correction. But it proved that this approach contains deleting the leaked information in practical applications. Error coding is not always a guarantee of the reconciliation. It only require of the data's consistency and security. In this paper, Author proposed an improvement scheme of LDPC code on the property of reconciliation and performed some number simulations to evaluate that method. It's shown that this method would achieve a higher efficiency than the original algorithm. Therefore, this algorithm has special important meaning to the key generation.
A quantum key distribution protocol(QKD), known as BB84, was developed in 1984 by Charles Bennett and Gilles Brassard. The protocol works in two phases which are quantum state transmission and conventional post processing. In the first phase of BB84, raw key elements are distributed between two legitimate users by sending encoded photons through quantum channel whilst in the second phase, a common secret-key is obtained from correlated raw key elements by exchanging messages through a public channel e.g.; network or internet. The secret-key so obtained is used for cryptography purpose. Reconciliation is a compulsory part of post processing and hence of quantum key distribution protocol. The performance of a reconciliation protocol depends on the generation rate of common secret-key, number of bits disclosed and the error probability in common secrete-key. These characteristics of a protocol can be achieved by using a less interactive reconciliation protocol which can handle a higher initial quantum bit error rate (QBER). In this paper, we use a simple Bose, Chaudhuri, Hocquenghem (BCH) error correction algorithm with simplified syndrome table to achieve an efficient reconciliation protocol which can handle a higher quantum bit error rate and outputs a common key with zero error probability. The proposed protocol efficient in removing errors such that it can remove all errors even if QBER is 60%. Assuming the post processing channel is an authenticated binary symmetric channel (BSC).
Quantum key distribution (QKD) is a promising technique to share unconditionally secure keys between remote parties. As an essential part of a practical QKD system, reconciliation is responsible for correcting the errors due to the quantum channel noise by exchanging information through a public classical channel. In the present work, we propose a novel syndrome-based low-density parity-check (LDPC) reconciliation protocol to reduce the information leakage of reconciliation by fully utilizing the syndrome information that was previously wasted. Both theoretical analysis and simulation results show that our protocol can evidently reduce the information leakage as well as the number of communication rounds.
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.