scholarly journals High performance error correction for quantum key distribution using polar codes

2014 ◽  
Vol 14 (3&4) ◽  
pp. 329-338
Author(s):  
Paul Jouguet ◽  
Sebastien Kunz-Jacques
Keyword(s):  
Quantum Key Distribution ◽  
High Performance ◽  
Key Distribution ◽  
Polar Codes ◽  
Continuous Variables ◽  
Parity Check ◽  
Graphic Processing Units ◽  
Central Processing ◽  
Low Density Parity Check ◽  
Performance Error

We study the use of polar codes for both discrete and continuous variables Quantum Key Distribution (QKD). Although very large blocks must be used to obtain the efficiency required by quantum key distribution, and especially continuous variables quantum key distribution, their implementation on generic x86 Central Processing Units (CPUs) is practical. Thanks to recursive decoding, they exhibit excellent decoding speed, much higher than large, irregular Low Density Parity Check (LDPC) codes implemented on similar hardware, and competitive with implementations of the same codes on high-end Graphic Processing Units (GPUs).

scholarly journals High-Efficient Syndrome-Based LDPC Reconciliation for Quantum Key Distribution

Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1440
Author(s):  
Hao-Kun Mao ◽  
Yu-Cheng Qiao ◽  
Qiong Li
Keyword(s):  
Quantum Key Distribution ◽  
Information Leakage ◽  
Key Distribution ◽  
Channel Noise ◽  
Low Density ◽  
Parity Check ◽  
Promising Technique ◽  
Low Density Parity Check ◽  
High Efficient ◽  
Simulation Results

Quantum key distribution (QKD) is a promising technique to share unconditionally secure keys between remote parties. As an essential part of a practical QKD system, reconciliation is responsible for correcting the errors due to the quantum channel noise by exchanging information through a public classical channel. In the present work, we propose a novel syndrome-based low-density parity-check (LDPC) reconciliation protocol to reduce the information leakage of reconciliation by fully utilizing the syndrome information that was previously wasted. Both theoretical analysis and simulation results show that our protocol can evidently reduce the information leakage as well as the number of communication rounds.

scholarly journals High performance information reconciliation for QKD with CASCADE

2015 ◽  
pp. 419-434
Author(s):  
Thomas Brochmann Pedersen ◽  
Mustafa Toyran
Keyword(s):  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
High Performance ◽  
Distribution Systems ◽  
Ldpc Codes ◽  
Key Distribution ◽  
Communication Overhead ◽  
Polar Codes ◽  
Performance Information ◽  
Information Reconciliation

It is widely accepted in the quantum cryptography community that interactive information reconciliation protocols, such as cascade, are inefficient due to the communication overhead. Instead, non-interactive information reconciliation protocols based on i.e. LDPC codes or, more recently, polar codes have been proposed. In this work, we argue that interactive protocols should be taken into consideration in modern quantum key distribution systems. In particular, we demonstrate how to improve the performance of cascade by proper implementation and use. Our implementation of cascade reaches a throughput above 80 Mbps under realistic conditions. This is more than twice the throughput previously demonstrated in any information reconciliation protocol.

scholarly journals Multiedge-type low-density parity-check codes for continuous-variable quantum key distribution

2021 ◽  
Vol 103 (6) ◽  
Author(s):  
Hossein Mani ◽  
Tobias Gehring ◽  
Philipp Grabenweger ◽  
Bernhard Ömer ◽  
Christoph Pacher ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Continuous Variable ◽  
Low Density ◽  
Parity Check ◽  
Low Density Parity Check ◽  
Parity Check Codes

scholarly journals A novel error correction protocol for continuous variable quantum key distribution

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Kadir Gümüş ◽  
Tobias A. Eriksson ◽  
Masahiro Takeoka ◽  
Mikio Fujiwara ◽  
Masahide Sasaki ◽  
...  
Keyword(s):  
Error Correction ◽  
Quantum Key Distribution ◽  
Ldpc Codes ◽  
Key Distribution ◽  
Continuous Variable ◽  
Early Termination ◽  
Parity Check ◽  
Secret Key ◽  
Ldpc Decoder ◽  
And Performance

AbstractReconciliation is a key element of continuous-variable quantum key distribution (CV-QKD) protocols, affecting both the complexity and performance of the entire system. During the reconciliation protocol, error correction is typically performed using low-density parity-check (LDPC) codes with a single decoding attempt. In this paper, we propose a modification to a conventional reconciliation protocol used in four-state protocol CV-QKD systems called the multiple decoding attempts (MDA) protocol. MDA uses multiple decoding attempts with LDPC codes, each attempt having fewer decoding iteration than the conventional protocol. Between each decoding attempt we propose to reveal information bits, which effectively lowers the code rate. MDA is shown to outperform the conventional protocol in regards to the secret key rate (SKR). A 10% decrease in frame error rate and an 8.5% increase in SKR are reported in this paper. A simple early termination for the LDPC decoder is also proposed and implemented. With early termination, MDA has decoding complexity similar to the conventional protocol while having an improved SKR.

scholarly journals High performance frame synchronization for continuous variable quantum key distribution systems

2015 ◽  
Vol 23 (17) ◽  
pp. 22190 ◽  
Author(s):  
Dakai Lin ◽  
Peng Huang ◽  
Duan Huang ◽  
Chao Wang ◽  
Jinye Peng ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
High Performance ◽  
Distribution Systems ◽  
Key Distribution ◽  
Continuous Variable ◽  
Frame Synchronization ◽  
Performance Frame
Sign in / Sign up

Export Citation Format

Share Document