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

A new information reconciliation protocol

Baocang Wang

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

The substrings of a bit-string can be regarded as binary numbers on which a digit-sum operation is defined.By comparing the digit-sums of the two substrings,one can locate and correct the error in his substring.The efficiency of our new protocol is much higher than those of all known information reconciliation protocols even in the worst case,and simultaneously,its information leakage is relatively small.

Related papers

More efficient implementations of CASCADE information reconciliation protocol

Mustafa Toyran

In this paper, we present more efficient implementations of CASCADE information reconciliation (IR) protocol, using some inherent information already available in the protocol, exactly known bits and already known parities. Our experiments have shown that our presented protocols are of higher efficiency than both all the previous CASCADE versions and several other more recently proposed IR methods.

Signal Processing and Communications Applications Conference (SIU)•May 1, 2016•6 citations

Termination of Information Reconciliation Process

Bao Xiao-min

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.

Communications technology•Jan 1, 2010•0 citations

A New Information Reconciliation Protocol for Key Agreement

Yuanzhe Shi, Zhao-Yu Shang, Heng-yuan WANG +1 more

•Jul 1, 2026•0 citations

Analysis of information reconciliation algorithms with randomness extractors in quantum key distribution post-processing

Hussan ul Maab, Ijaz Hussain, Zeeshan Alvi

Quantum Information Processing•Aug 25, 2025•0 citations

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

A Generalization of Secure Comparison Protocol with Encrypted Output and Its Efficiency Estimation

Takumi Kobayashi, Keisuke Hakuta

Lecture notes in networks and systems•Sep 16, 2021•0 citations
The substrings of a bit-string can be regarded as binary numbers on which a digit-sum operation is defined.By comparing the digit-sums of the two substrings,one can locate and correct the error in his substring.The efficiency of our new protocol is much higher than those of all known information reconciliation protocols even in the worst case,and simultaneously,its information leakage is relatively small.
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.