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 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 On the problem of non-zero word error rates for fixed-rate error correction codes in continuous variable quantum key distribution

2017 ◽  
Vol 19 (2) ◽  
pp. 023003 ◽  
Author(s):  
Sarah J Johnson ◽  
Andrew M Lance ◽  
Lawrence Ong ◽  
Mahyar Shirvanimoghaddam ◽  
T C Ralph ◽  
...  
Keyword(s):  
Error Correction ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Continuous Variable ◽  
Error Rates ◽  
Error Correction Codes ◽  
Fixed Rate

scholarly journals Improved Data Post-Processing in Quantum Key Distribution and Application to Loss Thresholds in device independent QKD

2012 ◽  
Vol 12 (3&4) ◽  
pp. 203-214
Author(s):  
Xiongfeng Ma ◽  
Norbert Lutkenhaus
Keyword(s):  
Data Structure ◽  
Error Correction ◽  
Quantum Key Distribution ◽  
Security Analysis ◽  
Key Distribution ◽  
Post Processing ◽  
Security Proofs ◽  
Security Proof ◽  
Independent Case ◽  
Loss Tolerance

Security proofs of quantum key distribution (QKD) often require post-processing schemes to simplify the data structure, and hence the security proof. We show a generic method to improve resulting secure key rates by partially reversing the simplifying post-processing for error correction purposes. We apply our method to the security analysis of device-independent QKD schemes and of detection-device-independent QKD schemes, where in both cases one is typically required to assign binary values even to lost signals. In the device-independent case, the loss tolerance threshold is cut down by our method from 92.4% to 90.9%. The lowest tolerable transmittance of the detection-device-independent scheme can be improved from 78.0% to 65.9%

scholarly journals A largely self-contained and complete security proof for quantum key distribution

Quantum ◽  
2017 ◽  
Vol 1 ◽  
pp. 14 ◽  
Author(s):  
Marco Tomamichel ◽  
Anthony Leverrier
Keyword(s):  
Quantum Key Distribution ◽  
Estimation Error ◽  
Security Analysis ◽  
Key Distribution ◽  
Operational Definition ◽  
Uncertainty Relations ◽  
Secret Key ◽  
Security Proof ◽  
Key Length ◽  
Definition Of

In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and prepare-and-measure protocols. The goal of this paper is twofold: 1) to review and clarify the stateof-the-art security analysis based on entropic uncertainty relations, and 2) to provide an accessible resource for researchers interested in a security analysis of quantum cryptographic protocols that takes into account finite resource effects. For this purpose we collect and clarify several arguments spread in the literature on the subject with the goal of making this treatment largely self-contained. More precisely, we focus on a class of prepare-and-measure protocols based on the Bennett-Brassard (BB84) protocol as well as a class of entanglement-based protocols similar to the Bennett-Brassard-Mermin (BBM92) protocol. We carefully formalize the different steps in these protocols, including randomization, measurement, parameter estimation, error correction and privacy amplification, allowing us to be mathematically precise throughout the security analysis. We start from an operational definition of what it means for a quantum key distribution protocol to be secure and derive simple conditions that serve as sufficient condition for secrecy and correctness. We then derive and eventually discuss tradeoff relations between the block length of the classical computation, the noise tolerance, the secret key length and the security parameters for our protocols. Our results significantly improve upon previously reported tradeoffs.

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
Sign in / Sign up

Export Citation Format

Share Document