Practical Evaluation of Security for Quantum Key Distribution
Many papers proved the security of quantum key distribution (QKD) system, 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 requires, it is needed to evaluate a protocol with a finite coding-length. For this purpose, we derive a tight upper bound of the eavesdroppers information. This bound is better than existing bounds. We also obtain the exponential rate of the eavesdroppers information. Further, we approximate our bound by using the normal distribution. For details,see quant-ph/0602113.
QKD finite length code eavesdroppers information hypergeometric function
Masahito Hayashi
EARTO-SORST Quantum Computation and Information Project, JST 5-28-3, Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan
国际会议
Asian Conference on Quantum Onformation Science 2006(2006亚洲量子信息大会)
北京
英文
9-10
2006-09-01（万方平台首次上网日期，不代表论文的发表时间）