High-speed Privacy Amplification Scheme using GMP in Quantum Key Distribution
Bingze Yan, Haokun Mao, Xiaofeng Xue, Qiong Li

TL;DR
This paper introduces a high-speed privacy amplification scheme using GMP arithmetic for quantum key distribution, achieving record throughput on CPU platforms, which addresses a key bottleneck in high-speed QKD systems.
Contribution
A novel GMP-based modular arithmetic hash privacy amplification scheme implemented on CPUs that significantly increases throughput in quantum key distribution.
Findings
Achieves 260 Mbps throughput at block size 10^6
Achieves 140 Mbps throughput at block size 10^8
Records the highest speed for CPU-based PA schemes to date
Abstract
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 a bottleneck of the high-speed discrete variable QKD (DV-QKD) system. In this paper, a high-speed modular arithmetic hash PA scheme with GNU multiple precision (GMP) arithmetic library is presented. This scheme is implemented on two different central processing unit (CPU) platforms. The experimental results demon-strate that the throughput of this scheme achieves 260Mbps on the block size of 10^6 and 140Mbps on the block size of 10^8. This is the highest-speed recorded PA scheme on CPU platform to the author's knowledge.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Chaos-based Image/Signal Encryption
