Fast implementation of length-adaptive privacy amplification in quantum key distribution  

作　　者：张春梅 李默 黄靖正 Patcharapong Treeviriyanupab 李宏伟 李芳毅 王川 银振强 陈巍 Keattisak Sripimanwat 韩正甫 

机构地区：[1]Key Laboratory of Quantum Information,Chinese Academy of Sciences University of Science and Technology of China [2]Optical and Quantum Communications (OQC) Laboratory,National Electronics and Computer Technology Center (NECTEC),National Science and Technology Development Agency (NSTDA)

出　　处：《Chinese Physics B》2014年第9期112-117,共6页中国物理B（英文版）

基　　金：supported by the National Basic Research Program of China(Grant Nos.2011CBA00200 and 2011CB921200);the National Natural Science Foundation of China(Grant Nos.60921091 and 61101137)

摘　　要：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.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 

分 类 号：O413[理学—理论物理] TN918.1[理学—物理]