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

Zhang, Chun-Mei; Li, Mo; Jian, Huang; Treeviriyanupab, Patcharapong; Li, Hongwei; Li, Fangyi; Wang, Chuan; Yin, Zhen‐Qiang; Chen, Wei; Sripimanwat, Keattisak; Han, Zheng‐Fu

doi:10.1088/1674-1056/23/9/090310

Cited by 18 publications

(13 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It indicates the potential of modular arithmetic hash PA method instead of Toeplitz-hash PA method. More remarkably, our scheme on Intel i3-2120 improves the throughput of PA scheme on the similar platform (Intel i3-3220 in [27]) by nearly an order of magnitude. With these experiment results, we compare the characteristics of existing PA schemes and analyze their applicable scope.…”

Section: Introductionmentioning

confidence: 80%

“…The main operation of modular arithmetic hash, integer multiply operation, is the serial operation, so it is more suitable for the CPU platform. C. M. Zhang et al once proposed an optimal multiplication algorithm for modular arithmetic hash PA, while the speed of this scheme is only 10.88 Mbps at 10 7 , which is not good enough for most high speed DV-QKD systems [27]. Therefore, our research focus on the speed optimization of modular arithmetic hash function family, laying emphasis on the acceleration of large module multiplication in this hash computation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

High-Speed Privacy Amplification Scheme Using GMP in Quantum Key Distribution

Yan¹,

Li²,

Mao³

et al. 2020

IEEE Photonics J.

View full text Add to dashboard Cite

Privacy amplification (PA) is the art of distilling a highly secret key from a partially secure string by public discussion. It is a vital procedure in quantum key distribution (QKD) to produce a theoretically unconditional secure key. The throughput of PA has become the bottleneck of most high-speed discrete variable QKD (DV-QKD) systems. Although some Toeplitz-hash PA schemes can meet the demand of throughput, their high throughput extremely depends on the high cost platform, such as MIC or GPU. From the comprehensive view of development cost, integration level and power consumption, CPU is a general low cost platform. However, the throughput of CPU based PA scheme is not satisfactory so far, mainly due to the conflict between the intrinsic serial characteristic of CPU and the parallel requirement of high throughput Toeplitz-hash PA scheme. In this paper, a high throughput modular arithmetic hash PA scheme using GNU multiple precision arithmetic library (GMP) based on CPU platform is proposed. The experimental results show that the throughput of our scheme is nearly an order of magnitude higher than the comparative scheme on the similar CPU platform, which is 135 Mbps and 69 Mbps at the block sizes of 10 6 and 10 8 on Intel i3-2120 CPU respectively. Moreover, our scheme can provide the best throughput among DV-QKD PA schemes, which is 260 Mbps and 140 Mbps at the block sizes of 10 6 and 10 8 on Intel i9-9900k CPU respectively.

show abstract

Section: Introductionmentioning

confidence: 80%

Section: Introductionmentioning

confidence: 99%

High-Speed Privacy Amplification Scheme Using GMP in Quantum Key Distribution

Yan¹,

Li²,

Mao³

et al. 2020

IEEE Photonics J.

View full text Add to dashboard Cite

show abstract

“…end for 23: end for Although this method makes it possible to accomplish FFT/IFFT via multiple small-point FFT cores at high speed, many matrix transpositions and memory access are needed repeatedly. Thus, to speed up the PA scheme, the most important task is to optimize the number and speed of matrix transposition and memory access.…”

Section: A Overall Process Of Fft-based Pa Hardware Schemesmentioning

confidence: 99%

“…To solve this problem, the researchers studied different kinds of hash functions, implementation algorithms and platforms. In the aspect of hash function selection, C. M. Zhang et al chose a multiplicative-based universal 2 class of hash function to speed up PA process, and they constructed an optimal multiplication algorithm with four basic multiplications on the central processing unit (CPU) [23]. While the multiplication of large numbers is a complex calculation, which is difficult to transplant and further optimize.…”

Section: Introductionmentioning

confidence: 99%

High-Speed and Adaptive FPGA-Based Privacy Amplification in Quantum Key Distribution

Yan

Mao

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Privacy amplification (PA) is a vital procedure in quantum key distribution (QKD) to shrink the eavesdropper's information about the final key almost to zero. With the increase of repeat frequency of discrete variable QKD (DV-QKD) system, PA processing speed has become the bottleneck in many highspeed DV-QKD systems. In this paper, a high-speed adaptive field-programmable gate array (FPGA)-based PA scheme using a fast Fourier transform (FFT) is presented. To decrease the computation complexity, a modified 2-D FFT-based Toeplitz PA scheme is designed. To increase the processing speed of the scheme on the constraint of limited resources, a real-value oriented FFT acceleration method and a fast read/write balanced matrix transposition method are designed and implemented in our scheme. The experimental results on a Xilinx Virtex-6 FPGA demonstrate that the throughput is nearly double of the latest FPGA based Toeplitz PA scheme according to the literature. Besides, this scheme owns not only the good adaptivity to compression ratio but also the compression ratio independent resource consumption. Therefore, this scheme can fit many high-speed QKD applications. INDEX TERMSQuantum key distribution, privacy amplification, fast Fourier transform, field-programmable gate array.

show abstract

“…Quantum key distribution (QKD) has been an important research area in quantum information science since it was proposed in 1984 [10][11][12][13][14][15][16]. With the advent of quantum computing, cryptographic algorithms based on computational complexity are no longer secure; however, it has been theoretically proven that QKD attains unconditional security and can defend against quantum computing-based attacks.…”

Section: Introductionmentioning

confidence: 99%

Experimental Hong—Ou—Mandel interference using two independent heralded single-photon sources

Meng¹,

Wang²,

Gao³

et al. 2020

Front. Optoelectron.

View full text Add to dashboard Cite

Hong-Ou-Mandel (HOM) interference is one of the most important experimental phenomena in quantum optics. It has drawn considerable attention with respect to quantum cryptography and quantum communication because of the advent of the measurement device independent (MDI) quantum key distribution (QKD) protocol. Here, we realize HOM interference, having a visibility of approximately 38.1%, using two independent heralded single-photon sources (HSPSs). The HOM interference between two independent HSPSs is a core technology for realizing the long-distance MDI QKD protocol, the quantum coin-tossing protocol, and other quantum cryptography protocols.

show abstract

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

Cited by 18 publications

References 24 publications

High-Speed Privacy Amplification Scheme Using GMP in Quantum Key Distribution

High-Speed Privacy Amplification Scheme Using GMP in Quantum Key Distribution

High-Speed and Adaptive FPGA-Based Privacy Amplification in Quantum Key Distribution

Experimental Hong—Ou—Mandel interference using two independent heralded single-photon sources

Contact Info

Product

Resources

About