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 Ubiquitous and Future Networks

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

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

Published Jul 1, 2026• 0 citations
Publisher
DOI
10.1109/icufn69619.2026.11628085

Related papers

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

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

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.

International Conference on Mobile, Military, Maritime IT Convergence (ICMIC)•Aug 27, 2025•1 citation

A comparative analysis of error correction techniques used for QKD protocols

Neha Sharma, Vikas Saxena

Journal of Optics•Jul 7, 2025•1 citation

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

Enhancements to Prepare-and-Measure Based QKD Protocols

Peter Y. A. Ryan, Bruce Christianson

Lecture notes in computer science•Jan 1, 2013•8 citations

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•1 citation

QKD Iterative Information Reconciliation Based on LDPC Codes

Guo Limei, Ran Qi, Jin Di +1 more

International Journal of Theoretical Physics•Mar 25, 2020•13 citations
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.
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.
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.