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 Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)

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

Tharathorn Phromsa‐ard, Paramin Sangwongngam, Keattisak Sripimanwat, Kamol Kaemarungsri, Pisit Vanichchanunt, Lunchakorn Wuttisittikulkij

Published May 1, 2014• 3 citations
Publisher

Abstract

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.

DOI
10.1109/ecticon.2014.6839886

Related papers

Efficient Rate-Adaptive Reconciliation Based on LDPC Accumulate Codes for Quantum Key Distribution

Tharathorn Phromsa‐ard, Patcharapong Treeviriyanupab, Paramin Sangwongngam +4 more

In this paper, a rate-adaptive method is proposed an alternative reconciliation protocol by employing the LDPC-accumulate codes to the practical implementation in the quantum key distribution (QKD). The proposed rate-adaptive reconciliation is adapted in the Slepian-Wolf scheme where specific low-density parity-check (LDPC) codes are constructed by accumulated syndrome encoding/decoding. Its objective is to skip the step of quantum bit error rate (QBER) estimation by the traditional key sampling that increases the final secret key length in practice. From the numerical results, the proposed method achieves a good performance in terms of the number of disclosed bits and reconciliation efficiency comparable to the conventional Winnow, Cascade, and fixed-rate compatible LDPC based protocols. Moreover, it can cover the possible cases of error rates in the QKD system. Therefore, method is suitable for the highspeed discrete-variable QKD applications.

International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)•Jun 1, 2015•0 citations

Performance of ½-rate convolutional code on Winnow protocol for quantum key reconciliation

Patcharapong Treeviriyanupab, Paramin Sangwongngam, Keattisak Sripimanwat +1 more

The quantum key reconciliation is an essential step of Quantum Key Distribution (QKD) systems for correcting error in the raw keys which happens after the transmission over a quantum channel, where two legitimate parties make their correlated bits identical by exchanging messages over the public channel. This paper presents an alternative method for error correction of quantum key reconciliation by using ½-rate convolutional code, a class of forward error correcting (FEC) on Winnow for discrete-variable QKD protocol. The convolutional code can be applied to source coding with a side information problem which uses to describe quantum key reconciliation process. In the proposed scheme, it focuses on the performance evaluation of ½-rate convolutional code in quantum key reconciliation. In order to reduce an amount of interactive communication via error-free public channel for high-speed QKD applications, this proposed method is that the suitable solution.

International Symposium on Communications and Information Technologies•Oct 1, 2010•2 citations

Efficient reconciliation protocol for discrete-variable quantum key distribution

David Elkouss, Anthony Leverrier, Romain Alléaume +1 more

Reconciliation is an essential part of any secret-key agreement protocol and hence of a quantum key distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel (BSC). In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.

arXiv:0901.2140•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•177 citations

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•19 citations

High-efficiency reconciliation for continuous variable quantum key distribution

Zengliang Bai, Shenshen Yang, Yongmin Li

Abstract Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 10 6 . Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.

Japanese Journal of Applied Physics•Mar 13, 2017•34 citations

Reconciliation for CV-QKD using globally-coupled LDPC codes*

Jinjing Shi, Bo-Peng Li, Duan Huang

Reconciliation is a necessary step in postprocessing of continuous-variable quantum key distribution (CV-QKD) system. We use globally coupled low-density parity-check (GC-LDPC) codes in reconciliation to extract a precise secret key from the raw keys over the authenticated classical public channel between two users. GC-LDPC codes have excellent performance over both the additive Gaussian white noise and binary-erasure channels. The reconciliation based on GC-LDPC codes can improve the reconciliation efficiency to 95.42% and reduce the frame error rate to 3.25 × 10–3. Using distillation, the decoding speed can achieve 23.8 Mbits/s and decrease the cost of memory. Given decoding speed and low memory usage, this makes the proposed reconciliation method viable approach for high-speed CV-QKD system.

Chinese Physics B•Jan 20, 2020•8 citations
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.
In this paper, a rate-adaptive method is proposed an alternative reconciliation protocol by employing the LDPC-accumulate codes to the practical implementation in the quantum key distribution (QKD). The proposed rate-adaptive reconciliation is adapted in the Slepian-Wolf scheme where specific low-density parity-check (LDPC) codes are constructed by accumulated syndrome encoding/decoding. Its objective is to skip the step of quantum bit error rate (QBER) estimation by the traditional key sampling that increases the final secret key length in practice. From the numerical results, the proposed method achieves a good performance in terms of the number of disclosed bits and reconciliation efficiency comparable to the conventional Winnow, Cascade, and fixed-rate compatible LDPC based protocols. Moreover, it can cover the possible cases of error rates in the QKD system. Therefore, method is suitable for the highspeed discrete-variable QKD applications.
The quantum key reconciliation is an essential step of Quantum Key Distribution (QKD) systems for correcting error in the raw keys which happens after the transmission over a quantum channel, where two legitimate parties make their correlated bits identical by exchanging messages over the public channel. This paper presents an alternative method for error correction of quantum key reconciliation by using ½-rate convolutional code, a class of forward error correcting (FEC) on Winnow for discrete-variable QKD protocol. The convolutional code can be applied to source coding with a side information problem which uses to describe quantum key reconciliation process. In the proposed scheme, it focuses on the performance evaluation of ½-rate convolutional code in quantum key reconciliation. In order to reduce an amount of interactive communication via error-free public channel for high-speed QKD applications, this proposed method is that the suitable solution.
Reconciliation is an essential part of any secret-key agreement protocol and hence of a quantum key distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel (BSC). In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.
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.
Abstract Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 10 6 . Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.
Reconciliation is a necessary step in postprocessing of continuous-variable quantum key distribution (CV-QKD) system. We use globally coupled low-density parity-check (GC-LDPC) codes in reconciliation to extract a precise secret key from the raw keys over the authenticated classical public channel between two users. GC-LDPC codes have excellent performance over both the additive Gaussian white noise and binary-erasure channels. The reconciliation based on GC-LDPC codes can improve the reconciliation efficiency to 95.42% and reduce the frame error rate to 3.25 × 10–3. Using distillation, the decoding speed can achieve 23.8 Mbits/s and decrease the cost of memory. Given decoding speed and low memory usage, this makes the proposed reconciliation method viable approach for high-speed CV-QKD system.