scholarly journals High-speed and Large-scale Privacy Amplification Scheme for Quantum Key Distribution

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Bang-Ying Tang ◽  
Bo Liu ◽  
Yong-Ping Zhai ◽  
Chun-Qing Wu ◽  
Wan-Rong Yu

Abstract State-of-art quantum key distribution (QKD) systems are performed with several GHz pulse rates, meanwhile privacy amplification (PA) with large scale inputs has to be performed to generate the final secure keys with quantified security. In this paper, we propose a fast Fourier transform (FFT) enhanced high-speed and large-scale (HiLS) PA scheme on commercial CPU platform without increasing dedicated computational devices. The long input weak secure key is divided into many blocks and the random seed for constructing Toeplitz matrix is shuffled to multiple sub-sequences respectively, then PA procedures are parallel implemented for all sub-key blocks with correlated sub-sequences, afterwards, the outcomes are merged as the final secure key. When the input scale is 128 Mb, our proposed HiLS PA scheme reaches 71.16 Mbps, 54.08 Mbps and 39.15 Mbps with the compression ratio equals to 0.125, 0.25 and 0.375 respectively, resulting achievable secure key generation rates close to the asymptotic limit. HiLS PA scheme can be applied to 10 GHz QKD systems with even larger input scales and the evaluated throughput is around 32.49 Mbps with the compression ratio equals to 0.125 and the input scale of 1 Gb, which is ten times larger than the previous works for QKD systems. Furthermore, with the limited computational resources, the achieved throughput of HiLS PA scheme is 0.44 Mbps with the compression ratio equals to 0.125, when the input scale equals up to 128 Gb. In theory, the PA of the randomness extraction in quantum random number generation (QRNG) is same as the PA procedure in QKD, and our work can also be efficiently performed in high-speed QRNG.

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 21482-21490 ◽  
Author(s):  
Qiong Li ◽  
Bing-Ze Yan ◽  
Hao-Kun Mao ◽  
Xiao-Feng Xue ◽  
Qi Han ◽  
...  

2020 ◽  
Vol 12 (3) ◽  
pp. 1-13
Author(s):  
Bingze Yan ◽  
Qiong Li ◽  
Haokun Mao ◽  
Xiaofeng Xue

2012 ◽  
Vol 48 (4) ◽  
pp. 542-550 ◽  
Author(s):  
Akihiro Tanaka ◽  
Mikio Fujiwara ◽  
Ken-ichiro Yoshino ◽  
Seigo Takahashi ◽  
Yoshihiro Nambu ◽  
...  

2014 ◽  
Vol 14 (3&4) ◽  
pp. 217-235
Author(s):  
Viacheslav Burenkov ◽  
Bing Qi ◽  
Ben Fortescue ◽  
Hoi-Kwong Lo

The security of a high speed quantum key distribution system with finite detector dead time $\tau$ is analyzed. When the transmission rate becomes higher than the maximum count rate of the individual detectors ($1/\tau$), security issues affect the scheme for sifting bits. Analytical calculations and numerical simulations of the Bennett-Brassard BB84 protocol are performed. We study Rogers et al.'s scheme (further information is available in [D. J. Rogers, J. C. Bienfang, A. Nakassis, H. Xu, and C. W. Clark, New J. Phys.~{\bf 9}, 319 (2007)]) in the presence of an active eavesdropper Eve who has the power to perform an intercept-resend attack. It is shown that Rogers et al.'s scheme is no longer guaranteed to be secure. More specifically, Eve can induce a basis-dependent detection efficiency at the receiver's end. Modified key sifting schemes that are basis-independent and thus secure in the presence of dead time and an active eavesdropper are then introduced. We analyze and compare these secure sifting schemes for this active Eve scenario, and calculate and simulate their key generation rate. It is shown that the maximum key generation rate is $1/(2\tau)$ for passive basis selection, and $1/\tau$ for active basis selection. The security analysis for finite detector dead time is also extended to the decoy state BB84 protocol for one particular secure sifting scheme.


2005 ◽  
Author(s):  
Xiao Tang ◽  
Lijun Ma ◽  
Alan Mink ◽  
Anastase Nakassis ◽  
Barry Hershman ◽  
...  

Laser Physics ◽  
2010 ◽  
Vol 20 (5) ◽  
pp. 1210-1214 ◽  
Author(s):  
F. A. A. El-Orany ◽  
M. R. B. Wahiddin ◽  
M. -A. Mat-Nor ◽  
N. Jamil ◽  
I. Bahari

Sign in / Sign up

Export Citation Format

Share Document