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

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 pap...

Full description

Saved in:
Bibliographic Details
Published inChinese physics B Vol. 23; no. 9; pp. 112 - 117
Main Author 张春梅 李默 黄靖正 Patcharapong Treeviriyanupab 李宏伟 李芳毅 王川 银振强 冻巍 Keattisak Sripimanwat 韩正甫
Format Journal Article
LanguageEnglish
Published 01.09.2014
Subjects
Algorithms
Amplification
Computer programs
Multiplication
Optimization
Post-processing
Privacy
Quantum cryptography
Software
保密增强
快速实现
放大过程
秘密密钥
自适应
量子密钥分配
长度
隐私权
Online AccessGet full text
ISSN1674-1056
2058-3834
1741-4199
DOI10.1088/1674-1056/23/9/090310

Cover

More Information
Summary: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.
Bibliography: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.
11-5639/O4
length-adaptive privacy amplification, multiplication algorithms, quantum key distribution
Zhang Chun-Mei, Li Mo, Huang Jing-Zheng, Patcharapong Treeviriyanupab, Li Hong-Wei, Li Fang-Yi, Wang Chuan, Yin Zhen-Qiang, Chen Wei, Keattisak Sripimanwat, Han Zhen-Fu（1. Key Laboratory of Quantum Information, Chinese Academy of Sciences, University of Science and Technology of China, Hefei 230026, China; 2. Optical and Quantum Communications （OQC） Laboratory, National Electronics and Computer Technology Center （NECTEC）, National Science and Technology Development Agency （NSTDA）, Thailand）
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1674-1056
2058-3834
1741-4199
DOI:10.1088/1674-1056/23/9/090310