Soft decoding of short/medium length codes using ordered statistics for quantum key distribution

Author(s):  
Maqsood M. Khan ◽  
Inam Bari ◽  
Omar Khan ◽  
Najeeb Ullah ◽  
Marina Mondin ◽  
...  

Quantum key distribution (QKD) is a cryptographic communication protocol that utilizes quantum mechanical properties for provable absolute security against an eavesdropper. The communication is carried between two terminals using random photon polarization states represented through quantum states. Both these terminals are interconnected through disjoint quantum and classical channels. Information reconciliation using delay controlled joint decoding is performed at the receiving terminal. Its performance is characterized using data and error rates. Achieving low error rates is particularly challenging for schemes based on error correcting codes with short code lengths. This article addresses the decoding process using ordered statistics decoding for information reconciliation of both short and medium length Bose–Chaudhuri–Hocquenghem codes over a QKD link. The link’s quantum channel is modeled as a binary symmetric quantum depolarization channel, whereas the classical channel is configured with additive white Gaussian noise. Our results demonstrate the achievement of low bit error rates, and reduced decoding complexity when compared to other capacity achieving codes of similar length and configuration.

2017 ◽  
Vol 19 (2) ◽  
pp. 023003 ◽  
Author(s):  
Sarah J Johnson ◽  
Andrew M Lance ◽  
Lawrence Ong ◽  
Mahyar Shirvanimoghaddam ◽  
T C Ralph ◽  
...  

Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1087 ◽  
Author(s):  
Kun Zhang ◽  
Xue-Qin Jiang ◽  
Yan Feng ◽  
Runhe Qiu ◽  
Enjian Bai

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.


2011 ◽  
Vol 11 (3&4) ◽  
pp. 226-238
Author(s):  
David Elkouss ◽  
Jesus Martinez-Mateo ◽  
Vicente Martin

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.


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

Sign in / Sign up

Export Citation Format

Share Document