scholarly journals Error Estimation at the Information Reconciliation Stage of Quantum Key Distribution

2018 ◽  
Vol 39 (6) ◽  
pp. 558-567 ◽  
Author(s):  
E. O. Kiktenko ◽  
A. O. Malyshev ◽  
A. A. Bozhedarov ◽  
N. O. Pozhar ◽  
M. N. Anufriev ◽  
...  
Keyword(s):  
Error Estimation ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Information Reconciliation

scholarly journals Multi-matrix error estimation and reconciliation for quantum key distribution

2019 ◽  
Vol 27 (10) ◽  
pp. 14545 ◽  
Author(s):  
Chaohui Gao ◽  
Dong Jiang ◽  
Yu Guo ◽  
Lijun Chen
Keyword(s):  
Error Estimation ◽  
Quantum Key Distribution ◽  
Key Distribution

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 Symmetric Blind Information Reconciliation for Quantum Key Distribution

2017 ◽  
Vol 8 (4) ◽  
Author(s):  
E. O. Kiktenko ◽  
A. S. Trushechkin ◽  
C. C. W. Lim ◽  
Y. V. Kurochkin ◽  
A. K. Fedorov
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Information Reconciliation

Efficient error estimation in quantum key distribution

2015 ◽  
Vol 24 (1) ◽  
pp. 010302 ◽  
Author(s):  
Mo Li ◽  
Treeviriyanupab Patcharapong ◽  
Chun-Mei Zhang ◽  
Zhen-Qiang Yin ◽  
Wei Chen ◽  
...  
Keyword(s):  
Error Estimation ◽  
Quantum Key Distribution ◽  
Key Distribution

scholarly journals Error estimation, error correction and verification in quantum key distribution

2014 ◽  
Vol 8 (5) ◽  
pp. 277-282 ◽  
Author(s):  
Øystein Marøy ◽  
Lars Lydersen ◽  
Magne Gudmundsen ◽  
Johannes Skaar
Keyword(s):  
Error Correction ◽  
Error Estimation ◽  
Quantum Key Distribution ◽  
Estimation Error ◽  
Key Distribution

scholarly journals Improved reconciliation with polar codes in quantum key distribution

2018 ◽  
Vol 18 (9&10) ◽  
pp. 795-813
Author(s):  
Sunghoon Lee ◽  
Jooyoun Park ◽  
Jun Heo
Keyword(s):  
Quantum Key Distribution ◽  
Block Size ◽  
Ldpc Codes ◽  
Key Distribution ◽  
Block Codes ◽  
Polar Codes ◽  
Information Reconciliation ◽  
Linear Block Codes ◽  
Small Block ◽  
Cryptographic System

Quantum key distribution (QKD) is a cryptographic system that generates an information-theoretically secure key shared by two legitimate parties. QKD consists of two parts: quantum and classical. The latter is referred to as classical post-processing (CPP). Information reconciliation is a part of CPP in which parties are given correlated variables and attempt to eliminate the discrepancies between them while disclosing a minimum amount of information. The elegant reconciliation protocol known as \emph{Cascade} was developed specifically for QKD in 1992 and has become the de-facto standard for all QKD implementations. However, the protocol is highly interactive. Thus, other protocols based on linear block codes such as Hamming codes, low-density parity-check (LDPC) codes, and polar codes have been researched. In particular, reconciliation using LDPC codes has been mainly studied because of its outstanding performance. Nevertheless, with small block size, the bit error rate performance of polar codes under successive-cancellation list (SCL) decoding with a cyclic redundancy check (CRC) is comparable to state-of-the-art turbo and LDPC codes. In this study, we demonstrate the use of polar codes to improve the performance of information reconciliation in a QKD system with small block size. The best decoder for polar codes, a CRC-aided SCL decoder, requires CRC-precoded messages. However, messages that are sifted keys in QKD are obtained arbitrarily as a result of a characteristic of the QKD protocol and cannot be CRC-precoded. We propose a method that allows arbitrarily obtained sifted keys to be CRC precoded by introducing a virtual string. Thus the best decoder can be used for reconciliation using polar codes and improves the efficiency of the protocol.

Sign in / Sign up

Export Citation Format

Share Document