Optimized CASCADE protocol for efficient information reconciliation

2018 ◽  
Vol 18 (7&8) ◽  
pp. 553-578
Author(s):  
Metin Toyran ◽  
Mustafa Toyran ◽  
Sitki Ozturk
Keyword(s):  
Error Detection ◽  
Quantum Key Distribution ◽  
Redundant Information ◽  
Secret Key ◽  
Classical Communication ◽  
Information Reconciliation ◽  
Extra Information ◽  
Quantum Transmission ◽  
Error Detection And Correction ◽  
Efficient Information

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.

scholarly journals High Efficiency Continuous-Variable Quantum Key Distribution Based on ATSC 3.0 LDPC Codes

Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1087 ◽  
Author(s):  
Kun Zhang ◽  
Xue-Qin Jiang ◽  
Yan Feng ◽  
Runhe Qiu ◽  
Enjian Bai
Keyword(s):  
Computational Complexity ◽  
Quantum Key Distribution ◽  
Rapid Development ◽  
Ldpc Codes ◽  
Key Distribution ◽  
Continuous Variable ◽  
Parity Check ◽  
Secret Key ◽  
Information Reconciliation ◽  
Transmission Distance

Due to the rapid development of quantum computing technology, encryption systems based on computational complexity are facing serious threats. Based on the fundamental theorem of quantum mechanics, continuous-variable quantum key distribution (CVQKD) has the property of physical absolute security and can effectively overcome the dependence of the current encryption system on the computational complexity. In this paper, we construct the spatially coupled (SC)-low-density parity-check (LDPC) codes and quasi-cyclic (QC)-LDPC codes by adopting the parity-check matrices of LDPC codes in the Advanced Television Systems Committee (ATSC) 3.0 standard as base matrices and introduce these codes for information reconciliation in the CVQKD system in order to improve the performance of reconciliation efficiency, and then make further improvements to final secret key rate and transmission distance. Simulation results show that the proposed LDPC codes can achieve reconciliation efficiency of higher than 0.96. Moreover, we can obtain a high final secret key rate and a long transmission distance through using our proposed LDPC codes for information reconciliation.

scholarly journals Simultaneous Classical Communication and Quantum Key Distribution Based on Plug-and-Play Configuration with an Optical Amplifier

Entropy ◽  
2019 ◽  
Vol 21 (4) ◽  
pp. 333 ◽  
Author(s):  
Xiaodong Wu ◽  
Yijun Wang ◽  
Qin Liao ◽  
Hai Zhong ◽  
Ying Guo
Keyword(s):  
Quantum Key Distribution ◽  
Finite Size ◽  
Key Distribution ◽  
Optical Amplifier ◽  
Coherent Detection ◽  
Secret Key ◽  
Plug And Play ◽  
Classical Communication ◽  
Laser Sources ◽  
Simulation Results

We propose a simultaneous classical communication and quantum key distribution (SCCQ) protocol based on plug-and-play configuration with an optical amplifier. Such a protocol could be attractive in practice since the single plug-and-play system is taken advantage of for multiple purposes. The plug-and-play scheme waives the necessity of using two independent frequency-locked laser sources to perform coherent detection, thus the phase noise existing in our protocol is small which can be tolerated by the SCCQ protocol. To further improve its capabilities, we place an optical amplifier inside Alice’s apparatus. Simulation results show that the modified protocol can well improve the secret key rate compared with the original protocol whether in asymptotic limit or finite-size regime.

scholarly journals Boosting the secret key rate in a shared quantum and classical fibre communication system

2019 ◽  
Vol 2 (1) ◽  
Author(s):  
Davide Bacco ◽  
Beatrice Da Lio ◽  
Daniele Cozzolino ◽  
Francesco Da Ros ◽  
Xueshi Guo ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Communication Systems ◽  
Ad Hoc ◽  
Communication Technologies ◽  
Channel Noise ◽  
Quantum Computers ◽  
Secret Key ◽  
Classical Communication ◽  
Core Fibre ◽  
Security Problem

Abstract During the last 20 years, the advance of communication technologies has generated multiple exciting applications. However, classical cryptography, commonly adopted to secure current communication systems, can be jeopardised by the advent of quantum computers. Quantum key distribution (QKD) is a promising technology aiming to solve such a security problem. Unfortunately, current implementations of QKD systems show relatively low key rates, demand low channel noise and use ad hoc devices. In this work, we picture how to overcome the rate limitation by using a 37-core fibre to generate 2.86 Mbit s−1 per core that can be space multiplexed into the highest secret key rate of 105.7 Mbit s−1 to date. We also demonstrate, with off-the-shelf equipment, the robustness of the system by co-propagating a classical signal at 370 Gbit s$${}^{-1}$$ − 1 , paving the way for a shared quantum and classical communication network.

Information reconciliation for QKD

2011 ◽  
Vol 11 (3&4) ◽  
pp. 226-238
Author(s):  
David Elkouss ◽  
Jesus Martinez-Mateo ◽  
Vicente Martin
Keyword(s):  
Quantum Key Distribution ◽  
Key Agreement ◽  
Information Leakage ◽  
Error Rates ◽  
Parity Check ◽  
Random String ◽  
Secret Key ◽  
Information Reconciliation ◽  
Low Density Parity Check ◽  
Secret Key Agreement

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 \textit{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.

AUTHENTICATED QUANTUM KEY DISTRIBUTION WITHOUT CLASSICAL COMMUNICATION

2007 ◽  
Vol 17 (03) ◽  
pp. 323-335 ◽  
Author(s):  
NAYA NAGY ◽  
SELIM G. AKL
Keyword(s):  
Quantum Channel ◽  
Quantum Key Distribution ◽  
Communication Channel ◽  
Quantum Communication ◽  
Key Distribution ◽  
Secret Key ◽  
Classical Communication ◽  
Quantum Communication Channel ◽  
High Security ◽  
Public Keys

The aim of quantum key distribution protocols is to establish a secret key among two parties with high security confidence. Such algorithms generally require a quantum channel and an authenticated classical channel. This paper presents a totally new perception of communication in such protocols. The quantum communication alone satisfies all needs of array communication between the two parties. Even so, the quantum communication channel does not need to be protected or authenticated whatsoever. As such, our algorithm is a purely quantum key distribution algorithm. The only certain identification of the two parties is through public keys.

INFEASIBILITY OF QUANTUM CRYPTOGRAPHY WITHOUT EAVESDROPPING CHECK

2011 ◽  
Vol 25 (08) ◽  
pp. 1061-1067
Author(s):  
WEI YANG ◽  
LIUSHENG HUANG ◽  
FANG SONG ◽  
QIYAN WANG
Keyword(s):  
Quantum Cryptography ◽  
General Model ◽  
Quantum Key Distribution ◽  
Communication Channel ◽  
Key Distribution ◽  
Secret Key ◽  
Classical Communication ◽  
Man In The Middle ◽  
Distribution Scheme ◽  
Special Case

Secure key distribution is impossible in pure classical environment. Unconditional secure key distribution is available when quantum means are introduced, assisted by a classical communication channel. What is possible when a quantum key distribution scheme is without classical communication? We present a general model with this constraint and show that quantum key distribution without classical eavesdropping check is in principle impossible. For an adversary can always succeed in obtaining the secret key via a special case of man-in-the-middle attack, namely intercept-and-forward attack without any risk of being captured.

scholarly journals Hybrid Pipeline Hardware Architecture Based on Error Detection and Correction for AES

Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5655
Author(s):  
Ignacio Algredo-Badillo ◽  
Kelsey A. Ramírez-Gutiérrez ◽  
Luis Alberto Morales-Rosales ◽  
Daniel Pacheco Bautista ◽  
Claudia Feregrino-Uribe
Keyword(s):  
Fault Detection ◽  
Error Detection ◽  
Secure Communication ◽  
Critical Path ◽  
Fault Analysis ◽  
Hardware Architecture ◽  
Secret Key ◽  
Cryptographic Algorithm ◽  
Differential Fault Analysis ◽  
Error Detection And Correction

Currently, cryptographic algorithms are widely applied to communications systems to guarantee data security. For instance, in an emerging automotive environment where connectivity is a core part of autonomous and connected cars, it is essential to guarantee secure communications both inside and outside the vehicle. The AES algorithm has been widely applied to protect communications in onboard networks and outside the vehicle. Hardware implementations use techniques such as iterative, parallel, unrolled, and pipeline architectures. Nevertheless, the use of AES does not guarantee secure communication, because previous works have proved that implementations of secret key cryptosystems, such as AES, in hardware are sensitive to differential fault analysis. Moreover, it has been demonstrated that even a single fault during encryption or decryption could cause a large number of errors in encrypted or decrypted data. Although techniques such as iterative and parallel architectures have been explored for fault detection to protect AES encryption and decryption, it is necessary to explore other techniques such as pipelining. Furthermore, balancing a high throughput, reducing low power consumption, and using fewer hardware resources in the pipeline design are great challenges, and they are more difficult when considering fault detection and correction. In this research, we propose a novel hybrid pipeline hardware architecture focusing on error and fault detection for the AES cryptographic algorithm. The architecture is hybrid because it combines hardware and time redundancy through a pipeline structure, analyzing and balancing the critical path and distributing the processing elements within each stage. The main contribution is to present a pipeline structure for ciphering five times on the same data blocks, implementing a voting module to verify when an error occurs or when output has correct cipher data, optimizing the process, and using a decision tree to reduce the complexity of all combinations required for evaluating. The architecture is analyzed and implemented on several FPGA technologies, and it reports a throughput of 0.479 Gbps and an efficiency of 0.336 Mbps/LUT when a Virtex-7 is used.

scholarly journals Demystifying the information reconciliation protocol cascade

2015 ◽  
pp. 453-477
Author(s):  
Jesus Martinez-Mateo ◽  
Christoph Pacher ◽  
Momtchil Peev ◽  
Alex Ciurana ◽  
Vicente Martin
Keyword(s):  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
Key Agreement ◽  
Key Distribution ◽  
Practical Implementation ◽  
Optimal Parameters ◽  
Secret Key ◽  
Information Reconciliation ◽  
Trade Offs ◽  
Secret Key Agreement

Cascade is an information reconciliation protocol proposed in the context of secret key agreement in quantum cryptography. This protocol allows removing discrepancies in two partially correlated sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed and, although its efficiency is not optimal, it has become the de-facto standard for practical implementations of information reconciliation in quantum key distribution. The aim of this work is to analyze the performance of Cascade, to discuss its strengths, weaknesses and optimization possibilities, comparing with some of the modified versions that have been proposed in the literature. When looking at all design trade-offs, a new view emerges that allows to put forward a number of guidelines and propose near optimal parameters for the practical implementation of Cascade improving performance significantly in comparison with all previous proposals.

Sign in / Sign up

Export Citation Format

Share Document