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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Practical error-correction procedures in quantum cryptography

A. P. Makkaveev, S. N. Molotkov, D. I. Pomozov, A. V. Timofeyev

Published May 24, 2006• 3 citations
Publisher

Abstract

Quantum cryptography (secure key distribution) systems must include procedures for correcting errors in the raw key transmitted over a quantum communication channel. Several reconciliation protocols are discussed and compared in terms of efficiency.
DOI
10.1117/12.683117

Related papers

Practical error-correction procedures in quantum cryptography

A. P. Makkaveev, S. N. Molotkov, D. I. Pomozov +1 more

Quantum cryptography (secure key distribution) systems must include procedures for correcting errors in the raw key transmitted over a quantum communication channel. Several reconciliation protocols are discussed and compared in terms of efficiency.

Journal of Experimental and Theoretical Physics•Aug 1, 2005•8 citations

Modification of error reconciliation scheme for quantum cryptography

Konstantin Kuritsyn

Quantum cryptography is essentially the quantum key distribution (QKD). In the context of QKD, one from two partners (Alice) generates and sends a sequence of qubits through a private quantum channel to another partner (Bob) and Bob receives the sequence and measures the state of each qubit. After the quantum transmission stage, Alice and Bob have almost identical qubit sequences. The erros are due to physical imperfections in the channel and presence of an eavesdropper. The next stage in QKD is key reconciliation (i.e. finding and correcting discrepancies between Alice's string and that of Bob). This reconciliation can be done by public discussion. Let us suppose there is a secret quantum channel between Alice and Bob through which Alice transmits a n-bit string A=(A1, A2,...,An)ε{0,1}n. Then Bob receives a n-bit string B=(B1, B2,...,Bn)ε{0,1)n. The string B differs from A due to the presence of noise and eavesdropper in the channel. One can estimate the bit error probability in the channel. For example, Bob can choose a random subset from his string and send it to Alice in public. Then Alice compares the received string with her corresponding subset and calculates the total number of protocol steps. The cascade scheme uses the interaction over the public channel to correct the secret strings by dividing them into the blocks of a fixed length. The length is determined from the bit error probability. A simple interactive routine is applied in each of these blocks. An error found in some block results in some action with other blocks. It is important to optimize the error-finding routines in standalone blocks as well as to organize the effective constrution of blocks with the object of protocol benchmark, information leakage and number of interactions between partners.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 23, 2003•6 citations

Public classical communication in quantum cryptography: Error correction, integrity, and authentication

A. V. Timofeev, D. I. Pomozov, A. P. Makkaveev +1 more

Quantum cryptography systems combine two communication channels: a quantum and a classical one. (They can be physically implemented in the same fiber-optic link, which is employed as a quantum channel when one-photon states are transmitted and as a classical one when it carries classical data traffic.) Both channels are supposed to be insecure and accessible to an eavesdropper. Error correction in raw keys, interferometer balancing, and other procedures are performed by using the public classical channel. A discussion of the requirements to be met by the classical channel is presented.

Journal of Experimental and Theoretical Physics•May 1, 2007•0 citations

On the correction of errors in quantum cryptography systems

Kirill A. Balygin, Andrey N. Klimov, S. P. Kulik +1 more

Key generation in a two-pass quantum cryptography system involving protocols on geometrically uniform coherent states is studied. Results on the correction of errors in this system without opening a part of the raw key to estimate the probability of errors but involving the monitoring of the parameters of the system and the quantum communication channel sufficient for an a priori estimate of the probability of errors, which is used to choose a correcting code, are reported.

Journal of Experimental and Theoretical Physics Letters•Sep 1, 2016•2 citations

Title: Non-Standard Cryptography Based on Quantum Key Distribution

Jincheng Zhang

Quantum cryptography presents a paradigm shift in secure communication, offering the potential for unparalleled security based on the principles of quantum mechanics. This paper explores the design and implementation of a novel cryptographic protocol, termed "Quantum Key Distribution" (QKD), which utilizes quantum-enhanced error correction and measurement to establish a fundamentally more secure key distribution system. The core claim centers on leveraging quantum phenomena to detect and mitigate eavesdropping attempts, fundamentally altering the security landscape beyond the limitations of classical cryptography. We detail the protocol's architecture, focusing on the critical role of quantum-enhanced error correction and measurement in achieving robust key generation. The paper concludes with a discussion of the challenges and future directions for this emerging field.

•Sep 3, 2026•0 citations

Practical strategies for QKD key production

Alan Mink, Anastase Nakassis

We present the quantum key distribution (QKD) secure key ratio expression in a form that exposes the parameters that affect the Reconciliation (error correction) stage. Reconciliation is the least well understood in practical terms and is typically described through a model that provides little guidance when it comes to efficient implementation, although it requires significant resources and is required to achieve a performance level commensurate with the other stages of the QKD protocol implementation. We addresses the issue of practical QKD error correction, questions of performance based on our data and data that have been published, and addresses the issue of platforms capable of handling rates of Gb/s.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 28, 2013•3 citations
Quantum cryptography is essentially the quantum key distribution (QKD). In the context of QKD, one from two partners (Alice) generates and sends a sequence of qubits through a private quantum channel to another partner (Bob) and Bob receives the sequence and measures the state of each qubit. After the quantum transmission stage, Alice and Bob have almost identical qubit sequences. The erros are due to physical imperfections in the channel and presence of an eavesdropper. The next stage in QKD is key reconciliation (i.e. finding and correcting discrepancies between Alice's string and that of Bob). This reconciliation can be done by public discussion. Let us suppose there is a secret quantum channel between Alice and Bob through which Alice transmits a n-bit string A=(A1, A2,...,An)ε{0,1}n. Then Bob receives a n-bit string B=(B1, B2,...,Bn)ε{0,1)n. The string B differs from A due to the presence of noise and eavesdropper in the channel. One can estimate the bit error probability in the channel. For example, Bob can choose a random subset from his string and send it to Alice in public. Then Alice compares the received string with her corresponding subset and calculates the total number of protocol steps. The cascade scheme uses the interaction over the public channel to correct the secret strings by dividing them into the blocks of a fixed length. The length is determined from the bit error probability. A simple interactive routine is applied in each of these blocks. An error found in some block results in some action with other blocks. It is important to optimize the error-finding routines in standalone blocks as well as to organize the effective constrution of blocks with the object of protocol benchmark, information leakage and number of interactions between partners.
Quantum cryptography systems combine two communication channels: a quantum and a classical one. (They can be physically implemented in the same fiber-optic link, which is employed as a quantum channel when one-photon states are transmitted and as a classical one when it carries classical data traffic.) Both channels are supposed to be insecure and accessible to an eavesdropper. Error correction in raw keys, interferometer balancing, and other procedures are performed by using the public classical channel. A discussion of the requirements to be met by the classical channel is presented.
Quantum cryptography presents a paradigm shift in secure communication, offering the potential for unparalleled security based on the principles of quantum mechanics. This paper explores the design and implementation of a novel cryptographic protocol, termed "Quantum Key Distribution" (QKD), which utilizes quantum-enhanced error correction and measurement to establish a fundamentally more secure key distribution system. The core claim centers on leveraging quantum phenomena to detect and mitigate eavesdropping attempts, fundamentally altering the security landscape beyond the limitations of classical cryptography. We detail the protocol's architecture, focusing on the critical role of quantum-enhanced error correction and measurement in achieving robust key generation. The paper concludes with a discussion of the challenges and future directions for this emerging field.
We present the quantum key distribution (QKD) secure key ratio expression in a form that exposes the parameters that affect the Reconciliation (error correction) stage. Reconciliation is the least well understood in practical terms and is typically described through a model that provides little guidance when it comes to efficient implementation, although it requires significant resources and is required to achieve a performance level commensurate with the other stages of the QKD protocol implementation. We addresses the issue of practical QKD error correction, questions of performance based on our data and data that have been published, and addresses the issue of platforms capable of handling rates of Gb/s.