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

Journal of Southwest University

An Information Reconciliation Protocol Based on QC-LDPC Code

QU Yun-yu

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

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.

Related papers

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

Low-complexity key reconciliation algorithm using LDPC bit-flipping decoding for quantum key distribution

Tharathorn Phromsa‐ard, Paramin Sangwongngam, Keattisak Sripimanwat +3 more

Quantum key reconciliation is an essential process of quantum key distribution (QKD). It aims to correct the transmission errors after the distribution of quantum objects over a quantum channel, where two legitimate parties use a classical public authenticated channel to disclose correlated bits for agreeing on their common key. This work proposes an alternative promising method employing LDPC-codes bit-flipping decoding to practical implementation of quantum key reconciliation. In our proposed scheme, the low-complexity code bit-flipping decoding based on syndrome decoding is modified and applied to conventional Winnow protocol to achieve both error correcting performance and low complexity of hardware realization, i.e. FPGA logic cells and/or memory. From numerical simulation while the performance of our proposed scheme in terms of final bit error rate (BER) and disclosed bits is superior to conventional Winnow and CASCADE protocols, it yields low complexity in LDPC decoding comparable to the existing LDPC-based reconciliation protocols. Therefore, the technique is promising to high-speed discrete-variable QKD applications.

International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)•May 1, 2014•3 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

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

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

LDPC-based Gaussian key reconciliation

Matthieu R. Bloch, Andrew Thangaraj, S.W. McLaughlin +1 more

We propose a new information reconciliation method which allows two parties sharing continuous random variables to agree on a common bit string. We show that existing coded modulation techniques can be adapted for reconciliation and give an explicit code construction based on LDPC codes in the case of Gaussian variables. Simulations show that our method achieves higher efficiency than previously reported results.

IEEE Information Theory Workshop (ITW)•May 25, 2006•64 citations
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.
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.
Quantum key reconciliation is an essential process of quantum key distribution (QKD). It aims to correct the transmission errors after the distribution of quantum objects over a quantum channel, where two legitimate parties use a classical public authenticated channel to disclose correlated bits for agreeing on their common key. This work proposes an alternative promising method employing LDPC-codes bit-flipping decoding to practical implementation of quantum key reconciliation. In our proposed scheme, the low-complexity code bit-flipping decoding based on syndrome decoding is modified and applied to conventional Winnow protocol to achieve both error correcting performance and low complexity of hardware realization, i.e. FPGA logic cells and/or memory. From numerical simulation while the performance of our proposed scheme in terms of final bit error rate (BER) and disclosed bits is superior to conventional Winnow and CASCADE protocols, it yields low complexity in LDPC decoding comparable to the existing LDPC-based reconciliation protocols. Therefore, the technique is promising to high-speed discrete-variable QKD applications.
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.
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.
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.