Practical evaluation of security for quantum key distribution

Masahito Hayashi
Phys. Rev. A 74, 022307 – Published 7 August 2006

Abstract

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.

  • Received 14 February 2006

DOI:https://doi.org/10.1103/PhysRevA.74.022307

©2006 American Physical Society

Authors & Affiliations

Masahito Hayashi*

  • 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, The University of Tokyo, 7-3-1, Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

  • *Electronic address: masahito@qci.jst.go.jp

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 74, Iss. 2 — August 2006

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×