Practical evaluation of security for quantum key distribution

Journal Article · Tue Aug 15 04:00:00 EDT 2006 · Physical Review. A

DOI:https://doi.org/10.1103/PHYSREVA.74.022307· OSTI ID:20853024

Hayashi, Masahito ^[1]

---

1. EARTO-SORST Quantum Computation and Information Project, JST, 5-28-3, Hongo, Bunkyo-ku, Tokyo, 113-0033 (Japan) and Superrobust Computation Project, Information Science and Technology Strategic Core (21st Century COE by MEXT), Graduate School of Information Science and Technology, University of Tokyo, 7-3-1, Hongo, Bunkyo-ku, Tokyo, 113-0033 (Japan)

Many papers have proven the security of quantum key distribution (QKD) systems in the asymptotic framework. The degree of the security has not been discussed in the finite coding-length framework, sufficiently. However, to guarantee any implemented QKD system required, it is needed to evaluate a protocol with a finite coding length. For this purpose, we derive a tight upper bound of the eavesdropper's information. This bound is better than existing bounds. We also obtain the exponential rate of the eavesdropper's information. Further, we approximate our bound by using the normal distribution.

• OSTI ID: 20853024
• Journal Information: Physical Review. A, Journal Name: Physical Review. A Journal Issue: 2 Vol. 74; ISSN 1050-2947; ISSN PLRAAN
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
DATA TRANSMISSION
DISTRIBUTION
EVALUATION
INFORMATION
LENGTH
QUANTUM CRYPTOGRAPHY
SECRECY PROTECTION