期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Fast implementation of length-adaptive privacy amplification in quantum key distribution 被引量:6
1
作者 张春梅 李默 +8 位作者 黄靖正 Patcharapong Treeviriyanupab 李宏伟 李芳毅 王川 银振强 陈巍 Keattisak Sripimanwat 韩正甫 《Chinese Physics B》 SCIE EI CAS CSCD 2014年第9期112-117,共6页
Post-processing is indispensable in quantum key distribution (QKD), which is aimed at sharing secret keys between two distant parties. It mainly consists of key reconciliation and privacy amplification, which is use... Post-processing is indispensable in quantum key distribution (QKD), which is aimed at sharing secret keys between two distant parties. It mainly consists of key reconciliation and privacy amplification, which is used for sharing the same keys and for distilling unconditional secret keys. In this paper, we focus on speeding up the privacy amplification process by choosing a simple multiplicative universal class of hash functions. By constructing an optimal multiplication algorithm based on four basic multiplication algorithms, we give a fast software implementation of length-adaptive privacy amplification. "Length-adaptive" indicates that the implementation of privacy amplification automatically adapts to different lengths of input blocks. When the lengths of the input blocks are 1 Mbit and 10 Mbit, the speed of privacy amplification can be as fast as 14.86 Mbps and 10.88 Mbps, respectively. Thus, it is practical for GHz or even higher repetition frequency QKD systems. 展开更多
关键词 length-adaptive privacy amplification multiplication algorithms quantum key distribution
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部