arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0707.3541quant-ph
收藏

引入有限统计量的诱骗态量子密钥分发的安全性分析

Security analysis of decoy state quantum key distribution incorporating finite statistics

Jun Hasegawa, Masahito Hayashi, Tohya Hiroshima, Akihisa Tomita

摘要:

诱骗态方法量子密钥分发是解决相干光脉冲量子密钥分发问题的一种有效方法。然而,在现实世界中,有限码长下的统计涨落是不可忽略的,迄今为止诱骗态量子密钥分配的理论和实验研究都是基于渐近GLLP公式,该公式仅保证当码长趋于无穷大时窃听者的信息极限为零。本文在有限码长的框架下提出了一种改进的诱骗态量子密钥分配方案,并结合有限统计量推导了任意数目不同强度诱骗态的有限码长诱骗态量子密钥分配方案中窃听者信息的上界。通过数值模拟,给出了诱饵量子密钥分配的性能和参数的最佳值。

英文摘要:

Decoy state method quantum key distribution (QKD) is one of the promising practical solutions to BB84 QKD with coherent light pulses. In the real world, however, statistical fluctuations with the finite code length cannot be negligible, and the securities of theoretical and experimental researches of the decoy method state QKD so far are based on the asymptotic GLLP's formula which guarantees only that the limit of eavesdropper's information becomes zero as the code length approaches infinity. In this paper, we propose a substantially improved decoy state QKD in the framework of the finite code length and derive the upper bound of eavesdropper's information in the finite code length decoy state QKD with arbitrary number of decoy states of different intensities incorporating the finite statistics. We also show the performance of our decoy QKD and optimal values of parameters by numerical simulation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑