›› 2014, Vol. 23 ›› Issue (9): 90310-090310.doi: 10.1088/1674-1056/23/9/090310
张春梅a, 李默a, 黄靖正a, Patcharapong Treeviriyanupabb, 李宏伟a, 李芳毅a, 王川a, 银振强a, 陈巍a, Keattisak Sripimanwatb, 韩正甫a
Zhang Chun-Mei (张春梅)a, Li Mo (李默)a, Huang Jing-Zheng (黄靖正)a, Patcharapong Treeviriyanupabb, Li Hong-Wei (李宏伟)a, Li Fang-Yi (李芳毅)a, Wang Chuan (王川)a, Yin Zhen-Qiang (银振强)a, Chen Wei (陈巍)a, Keattisak Sripimanwatb, Han Zhen-Fu (韩正甫)a
摘要: 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.
中图分类号: (Quantum communication)