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 Mobile, Military, Maritime IT Convergence (ICMIC)

An Experimental Analysis of Several Variants of CASCADE Protocol for QKD*

Heejeung Won, Jieun Ryu, Ju-Sung Kang, Yongjin Yeom

Published Aug 27, 2025• 1 citation
Publisher

Abstract

In a quantum key distribution (QKD) system, the shared secret, called sifted key between the participants may not match due to the inherent properties of the noisy quantum channel. Thus, error correction protocols are indispensable. CASCADE is one of the most popular (currently the standard) error correction protocol in QKD based on parity exchange followed by binary search. In this study, we compare four Trace-Back algorithms in CASCADE and experimentally analyze their efficiency. Up to QBER 5%, we recommend the variant, TraceBack2First, as the most optimized approach, and comparatively analyze its efficiency in terms of communication with CASCADE. Through experiments, we examine that TraceBack2First is effective in reducing communication passes and memory usage, and expect it to be applicable to commercial QKD systems.

DOI
10.1109/icmic66299.2025.11257827

Related papers

Optimized CASCADE protocol for efficient information reconciliation

Metin Toyran, Mustafa Toyran, Sıtkı Öztürk

CASCADE protocol is an error detection and correction (EDC) method proposed firstly for use in quantum key distribution (QKD) systems. It is used to detect and correct all the errors in keys transmitted over a noisy quantum channel. This is done by sending some redundant information about the key to receiver as usual. However, just as differently, this extra information is sent over another noiseless classical channel after the quantum transmission is completely finished. Briefly, all the errors in noisy quantum communication are detected and corrected by a later noiseless classical communication using CASCADE protocol. In QKD literature, this EDC process is also called as information reconciliation (IR) or secret key reconciliation (SKR). For an IR protocol in QKD, one of the main performance measures is efficiency which depends on the amount of redundant information sent to make EDC possible. Since this extra information is transmitted over public channels, everyone can get it easily. Because this can damage the secrecy of keys that must be kept secret from third parties, more efficient, that is revealing less information about keys, IR methods are needed. In this paper, we present more efficient implementations of CASCADE protocol, using some inherent information already available in the protocol, exactly known bits and already known parities. This information is used in error detection and correction steps of the protocol to decrease the redundancy in redundant information. Our experiments have shown that the resulting protocols have higher efficiency than both all the previous CASCADE versions and several other more recently proposed IR methods.

Quantum Information and Computation•Jun 1, 2018•3 citations

An Efficient and Theoretically-Completed Variant of CASCADE Error Correction Protocol for QKD

Heesun Won, Jieun Ryu, Ju-Sung Kang +1 more

In quantum key distribution (QKD) systems, error correction protocols are an important process that determines communication security and efficiency. Among them, Cascade protocol is widely used due to its remarkable success rate of error correction. However, the heavy dependency that caused from the backtracking procedures in Cascade protocol makes mathematical analysis extremely difficult. Thus, existing theoretical studies for Cascade protocol have limited themselves to providing heuristic results rather than deriving precise mathematical formulae. In this paper, we propose the Traceback2First(T2F) variant of Cascade protocol in order to overcome the analytical difficulty and obtain a theoretical analysis. Moreover, we have confirmed our theoretical values by the experimental results using the actual simulation data.

International Conference on Ubiquitous and Future Networks•Jul 1, 2026•0 citations

Variant of the CASCADE Reconciliation Protocol for Non-Uniform Error Distributions in Quantum Channel

Владимир Андреевич Фаерман, Egor Vasilyev, Valeriy Stepanovich Avramchuk

Quantum key distribution (QKD) enables secure communication by using the principles of quantum mechanics. A critical stage in QKD protocols such as BB84 is information reconciliation, where the communicating parties correct errors in their sifted sequences without revealing extra information to a potential eavesdropper. The CASCADE protocol is a widely used interactive error-correction algorithm for this purpose. The classical CASCADE and its known modifications perform well under the assumption of uniformly distributed errors in the quantum channel. However, this assumption can break down in real conditions, where short-term noise bursts create clusters of errors. This paper proposes a modification of the CASCADE designed to improve its efficiency in channels with time-varying, non-uniform error distributions. The main idea is to identify and discard blocks with a relatively high concentration of errors during reconciliation, preventing inefficient correction attempts and reducing the number of communication rounds. Two new modifications based on existing CASCADE variants are presented. The proposed approach reduces the number of interactions, which is a critical performance metric for reconciliation protocols.

Dynamics of Systems Mechanisms and Machines•Nov 11, 2025•0 citations

INFORMATION RECONCILIATION IN QKD: A COMPARATIVE ANALYSIS OF CASCADE, LDPC AND POLAR CODES

Liliana Zisu, Ciprian Răcuciu

Quantum Key Distribution (QKD) provides unconditional security, but requires a robust information reconciliation step to eliminate errors introduced by the quantum channel. The efficiency of this step directly determines the net secret key generation rate. The paper presents a detailed comparative analysis of three major reconciliation techniques: CASCADE, LDPC (Low-Density Parity-Check), and Polar Codes. The analysis focuses on seven essential metrics, including reconciliation efficiency (f), maximum error tolerance (QBERmax,), final secure key rate (R), frame error rate (FER), and computational complexity. Simulations are performed on a realistic QKD channel model (BB84 with depolarization), with QBER varying between 0.1% and 16%, covering experimental conditions. Keywords: QKD, Information Reconciliation, LDPC, CASCADE, Polar Codes, Secret Key Rate

International Conference Education and Creativity for a Knowledge-based Society – Informatics•Jun 11, 2026•0 citations

Study on Scrambling Algorithms of Error Reconciliation in QKD

Qiong Li, Zhiyu Yang, Haokun Mao +1 more

Quantum key distribution (referred to as QKD) is a technology that can produce and distribute secret keys unconditionally secure based on the principle of quantum mechanics. In a practical QKD system, the reconciliation efficiency is crucial to the final key rate of the system. A practical QKD system may produce the uneven error distribution of the sifted key due to the instabilities of optical and electronic devices and some other reasons, which will lead to the low reconciliation efficiency. Therefore, to scramble the sifted key is adopted in many QKD systems. In this paper, an Arnold-based Scrambling Algorithm and Fast Exchange Scrambling Algorithm are proposed mainly for the CASCADE class and WINNOW class error reconciliation algorithms. The experimental results demonstrate that the proposed algorithms provide the lower computational complexity and higher scrambling efficiency than the representative scrambling algorithm in QKD.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Jul 1, 2018•4 citations

Adaptation of Error Correction Procedures to the Time-Bin Quantum Key Distribution Protocol Implementation

Vladimir Morozov, Mikhail S. Elezov, Oleg Olegovich Evsutin +1 more

Error correction is a crucial stage in quantum key distribution (QKD) protocols—a promising field of modern cryptography where the secrecy of the shared key information is guaranteed by the laws of quantum mechanics. Currently, there are many effective approaches to error correction in QKD. However, most of them, due to their generic nature, fail to leverage the specific features of particular protocol implementations. This work demonstrates that accounting for the hardware specifics of a QKD system implementing the time-bin protocol enables a significant increase in error correction performance. For the considered QKD system, we have experimentally obtained estimates of the Quantum Bit Error Rate (QBER) observed for each combination of bit and detector. The differences in the obtained estimates reveal that the quantum channel can be modeled as a non-uniform binary channel. Furthermore, based on computational experiments with a model of the quantum channel, it was established that adapting the error correction procedure to its properties can achieve up to a 2.7-fold reduction in the LDPC code decoding failure rate at low error levels.

IEEE Access•Dec 26, 2025•1 citation
In a quantum key distribution (QKD) system, the shared secret, called sifted key between the participants may not match due to the inherent properties of the noisy quantum channel. Thus, error correction protocols are indispensable. CASCADE is one of the most popular (currently the standard) error correction protocol in QKD based on parity exchange followed by binary search. In this study, we compare four Trace-Back algorithms in CASCADE and experimentally analyze their efficiency. Up to QBER 5%, we recommend the variant, TraceBack2First, as the most optimized approach, and comparatively analyze its efficiency in terms of communication with CASCADE. Through experiments, we examine that TraceBack2First is effective in reducing communication passes and memory usage, and expect it to be applicable to commercial QKD systems.
CASCADE protocol is an error detection and correction (EDC) method proposed firstly for use in quantum key distribution (QKD) systems. It is used to detect and correct all the errors in keys transmitted over a noisy quantum channel. This is done by sending some redundant information about the key to receiver as usual. However, just as differently, this extra information is sent over another noiseless classical channel after the quantum transmission is completely finished. Briefly, all the errors in noisy quantum communication are detected and corrected by a later noiseless classical communication using CASCADE protocol. In QKD literature, this EDC process is also called as information reconciliation (IR) or secret key reconciliation (SKR). For an IR protocol in QKD, one of the main performance measures is efficiency which depends on the amount of redundant information sent to make EDC possible. Since this extra information is transmitted over public channels, everyone can get it easily. Because this can damage the secrecy of keys that must be kept secret from third parties, more efficient, that is revealing less information about keys, IR methods are needed. In this paper, we present more efficient implementations of CASCADE protocol, using some inherent information already available in the protocol, exactly known bits and already known parities. This information is used in error detection and correction steps of the protocol to decrease the redundancy in redundant information. Our experiments have shown that the resulting protocols have higher efficiency than both all the previous CASCADE versions and several other more recently proposed IR methods.
In quantum key distribution (QKD) systems, error correction protocols are an important process that determines communication security and efficiency. Among them, Cascade protocol is widely used due to its remarkable success rate of error correction. However, the heavy dependency that caused from the backtracking procedures in Cascade protocol makes mathematical analysis extremely difficult. Thus, existing theoretical studies for Cascade protocol have limited themselves to providing heuristic results rather than deriving precise mathematical formulae. In this paper, we propose the Traceback2First(T2F) variant of Cascade protocol in order to overcome the analytical difficulty and obtain a theoretical analysis. Moreover, we have confirmed our theoretical values by the experimental results using the actual simulation data.
Quantum key distribution (QKD) enables secure communication by using the principles of quantum mechanics. A critical stage in QKD protocols such as BB84 is information reconciliation, where the communicating parties correct errors in their sifted sequences without revealing extra information to a potential eavesdropper. The CASCADE protocol is a widely used interactive error-correction algorithm for this purpose. The classical CASCADE and its known modifications perform well under the assumption of uniformly distributed errors in the quantum channel. However, this assumption can break down in real conditions, where short-term noise bursts create clusters of errors. This paper proposes a modification of the CASCADE designed to improve its efficiency in channels with time-varying, non-uniform error distributions. The main idea is to identify and discard blocks with a relatively high concentration of errors during reconciliation, preventing inefficient correction attempts and reducing the number of communication rounds. Two new modifications based on existing CASCADE variants are presented. The proposed approach reduces the number of interactions, which is a critical performance metric for reconciliation protocols.
Quantum Key Distribution (QKD) provides unconditional security, but requires a robust information reconciliation step to eliminate errors introduced by the quantum channel. The efficiency of this step directly determines the net secret key generation rate. The paper presents a detailed comparative analysis of three major reconciliation techniques: CASCADE, LDPC (Low-Density Parity-Check), and Polar Codes. The analysis focuses on seven essential metrics, including reconciliation efficiency (f), maximum error tolerance (QBERmax,), final secure key rate (R), frame error rate (FER), and computational complexity. Simulations are performed on a realistic QKD channel model (BB84 with depolarization), with QBER varying between 0.1% and 16%, covering experimental conditions. Keywords: QKD, Information Reconciliation, LDPC, CASCADE, Polar Codes, Secret Key Rate
Quantum key distribution (referred to as QKD) is a technology that can produce and distribute secret keys unconditionally secure based on the principle of quantum mechanics. In a practical QKD system, the reconciliation efficiency is crucial to the final key rate of the system. A practical QKD system may produce the uneven error distribution of the sifted key due to the instabilities of optical and electronic devices and some other reasons, which will lead to the low reconciliation efficiency. Therefore, to scramble the sifted key is adopted in many QKD systems. In this paper, an Arnold-based Scrambling Algorithm and Fast Exchange Scrambling Algorithm are proposed mainly for the CASCADE class and WINNOW class error reconciliation algorithms. The experimental results demonstrate that the proposed algorithms provide the lower computational complexity and higher scrambling efficiency than the representative scrambling algorithm in QKD.
Error correction is a crucial stage in quantum key distribution (QKD) protocols—a promising field of modern cryptography where the secrecy of the shared key information is guaranteed by the laws of quantum mechanics. Currently, there are many effective approaches to error correction in QKD. However, most of them, due to their generic nature, fail to leverage the specific features of particular protocol implementations. This work demonstrates that accounting for the hardware specifics of a QKD system implementing the time-bin protocol enables a significant increase in error correction performance. For the considered QKD system, we have experimentally obtained estimates of the Quantum Bit Error Rate (QBER) observed for each combination of bit and detector. The differences in the obtained estimates reveal that the quantum channel can be modeled as a non-uniform binary channel. Furthermore, based on computational experiments with a model of the quantum channel, it was established that adapting the error correction procedure to its properties can achieve up to a 2.7-fold reduction in the LDPC code decoding failure rate at low error levels.