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

Signal Processing and Communications Applications Conference (SIU)

A study on information reconciliation problem in quantum key distribution

Mustafa Toyran

Published May 1, 2016• 2 citations
Publisher

Abstract

This work mentions the problem known as information reconciliation (IR) in quantum key distribution (QKD). In this context, we review a few recent QKD systems in the literature and obtain their IR requirements. Later, we also present the latest results on IR protocols. We hope that this topic will be a new hot research area of our Turkish researchers working on error detection and correction techniques.

DOI
10.1109/siu.2016.7495701

Related papers

Information reconciliation of continuous-variables quantum key distribution: principles, implementations and applications

Shenshen Yang, Zhilei Yan, Hongzhao Yang +5 more

Abstract Quantum key distribution (QKD) can provide information-theoretically secure keys for two parties of legitimate communication, and information reconciliation, as an indispensable component of QKD systems, can correct errors present in raw keys based on error-correcting codes. In this paper, we first describe the basic knowledge of information reconciliation and its impact on continuous variable QKD. Then we introduce the information schemes and the corresponding error correction codes employed. Next, we introduce the rate-compatible codes, the hardware acceleration of the reconciliation algorithm, the research progress of information reconciliation, and its application in continuous variable QKD. Finally, we discuss the future challenges and conclude.

EPJ Quantum Technology•Oct 6, 2023•36 citations

One-way information reconciliation schemes of quantum key distribution

Yang Li, Zhao Li

Information reconciliation(IR) is a basic step of quantum key distribution (QKD). Classical message interaction is necessary in a practical IR scheme, and the communication complexity has become a bottleneck of QKD's development. Here we propose a concatenated method of IR scheme which requires only one time one-way communication to achieve any given error rate level. A QKD scheme with the concatenated IR can work without the special interaction of error rate estimation.

arXiv:1201.1196•Jan 5, 2012•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

Information reconciliation for quantum key distribution

ElkoussDavid, Martinez-mateoJesus, MartinVicente

Quantum key distribution (QKD) relies on quantum and classical procedures in orderto achieve the growing of a secret random string --the key-- known only to the twoparties executing the protocol. L...

Quantum Information and Computation•Mar 1, 2011•1 citation

Information Reconciliation Protocol in Quantum Key Distribution System

Hao Yan, Tienan Ren, Xiang Peng +4 more

In the system of quantum key distribution (QKD), errors may occur in the initial keys due to system noise or eavesdropping during the transmission on quantum channel. The goal of information reconciliation is to remove these errors by exchanging messages on an authenticated public channel. In this paper, we discuss the problem of secrete key reconciliation (SKR) in QKD, analyze the cascade protocol used for SKR, then modify it according to our conclusion. Experiments have shown that the modified protocol is of much higher efficiency.

International Conference on Natural Computation (ICNC)•Jan 1, 2008•46 citations

Information Reconciliation for Quantum Key Distribution

David Elkouss, Jesús Martínez-Mateo, Vicente Martín Ayuso +1 more

Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals -the raw key- must be stripped in order to distill a final, information theoretically secure, key. The key distillation process is a classical one in which basis reconciliation, error correction and privacy amplification protocols are applied to the raw key. This cleaning process is known as information reconciliation and must be done in a fast and efficient way to avoid cramping the performance of the QKD system. Brassard and Salvail proposed a very simple and elegant protocol to reconcile keys in the secret-key agreement context, known as Cascade, that has become the de-facto standard for all QKD practical implementations. However, it is highly interactive, requiring many communications between the legitimate parties and its efficiency is not optimal, imposing an early limit to the maximum tolerable error rate. In this paper we describe a low-density parity-check reconciliation protocol that improves significantly on these problems. The protocol exhibits better efficiency and limits the number of uses of the communications channel. It is also able to adapt to different error rates while remaining efficient, thus reaching longer distances or higher secure key rate for a given QKD system.

•Oct 1, 2010•31 citations
This work mentions the problem known as information reconciliation (IR) in quantum key distribution (QKD). In this context, we review a few recent QKD systems in the literature and obtain their IR requirements. Later, we also present the latest results on IR protocols. We hope that this topic will be a new hot research area of our Turkish researchers working on error detection and correction techniques.
Abstract Quantum key distribution (QKD) can provide information-theoretically secure keys for two parties of legitimate communication, and information reconciliation, as an indispensable component of QKD systems, can correct errors present in raw keys based on error-correcting codes. In this paper, we first describe the basic knowledge of information reconciliation and its impact on continuous variable QKD. Then we introduce the information schemes and the corresponding error correction codes employed. Next, we introduce the rate-compatible codes, the hardware acceleration of the reconciliation algorithm, the research progress of information reconciliation, and its application in continuous variable QKD. Finally, we discuss the future challenges and conclude.
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.
In the system of quantum key distribution (QKD), errors may occur in the initial keys due to system noise or eavesdropping during the transmission on quantum channel. The goal of information reconciliation is to remove these errors by exchanging messages on an authenticated public channel. In this paper, we discuss the problem of secrete key reconciliation (SKR) in QKD, analyze the cascade protocol used for SKR, then modify it according to our conclusion. Experiments have shown that the modified protocol is of much higher efficiency.
Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals -the raw key- must be stripped in order to distill a final, information theoretically secure, key. The key distillation process is a classical one in which basis reconciliation, error correction and privacy amplification protocols are applied to the raw key. This cleaning process is known as information reconciliation and must be done in a fast and efficient way to avoid cramping the performance of the QKD system. Brassard and Salvail proposed a very simple and elegant protocol to reconcile keys in the secret-key agreement context, known as Cascade, that has become the de-facto standard for all QKD practical implementations. However, it is highly interactive, requiring many communications between the legitimate parties and its efficiency is not optimal, imposing an early limit to the maximum tolerable error rate. In this paper we describe a low-density parity-check reconciliation protocol that improves significantly on these problems. The protocol exhibits better efficiency and limits the number of uses of the communications channel. It is also able to adapt to different error rates while remaining efficient, thus reaching longer distances or higher secure key rate for a given QKD system.