Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2105.13678

An efficient hybrid hash based privacy amplification algorithm for quantum key distribution

Bingze, Yan, Qiong Li, Haokun, Mao, Nan Chen

Published May 28, 2021• 2 citations
arXivHTMLPDF

Abstract

Privacy amplification (PA) is an essential part in a quantum key distribution (QKD) system, distilling a highly secure key from a partially secure string by public negotiation between two parties. The optimization objectives of privacy amplification for QKD are large block size, high throughput and low cost. For the global optimization of these objectives, a novel privacy amplification algorithm is proposed in this paper by combining multilinear-modular-hashing and modular arithmetic hashing. This paper proves the security of this hybrid hashing PA algorithm within the framework of both information theory and composition security theory. A scheme based on this algorithm is implemented and evaluated on a CPU platform. The results on a typical CV-QKD system indicate that the throughput of this scheme (261Mbps@2.6*10^8 input block size) is twice higher than the best existing scheme (140Mbps@1*10^8 input block size). Moreover, This scheme is implemented on a mobile CPU platform instead of a desktop CPU or a server CPU, which means that this algorithm has a better performance with a much lower cost and power consumption.

DOI
10.48550/arxiv.2105.13678

Related papers

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

Bingze Yan, Qiong Li, Haokun Mao +1 more

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 106 and 108 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 106and 108on Intel i9-9900k CPU respectively.

arXiv:1910.04429•IEEE photonics journal•Apr 15, 2020•19 citations

Large-Scale and High-Speed FPGA-Based Privacy Amplification for Quantum Key Distribution

Bingze Yan, Qiong Li, Haokun Mao +2 more

In this paper, a high-performance field-programmable gate array (FPGA) based privacy amplification (PA) scheme for both continuous variable and discrete variable - quantum key distribution (QKD) is presented, which can provide more than 1.5 Gbps throughput at the input block size close to$10^{8}$. Besides, the resource consumption is so economical that there is no need of any external storage. To the best of our knowledge, our scheme outperforms existing FPGA based PA schemes by over an order of magnitude in terms of throughput and input block size. To achieve this feature, we design a novel FPGA-based hybrid hash PA algorithm combining multilinear modular hash and modular arithmetic hash (MMH-MH) based on number theoretical transform (NTT). Based on the hybrid hash algorithm, many optimization strategies are designed in our FPGA based PA scheme, such as an NTT-based optimization unit, an NTT-reusable architecture, a memory-saving modular accumulation unit for multilinear modular hash and a pipelined binary modulo unit for modular arithmetic hash. Plentiful experiment results demonstrate the high performance and reliability of our scheme. It can be embedded in most standalone QKD devices conveniently. What's more, it is also a good candidate for a chip-based QKD system.

Journal of Lightwave Technology•Oct 14, 2022•10 citations

FM3H-MH: An Efficient Large-Scale Privacy Amplification Scheme for Quantum Key Distribution

Qiankun Li, Enjian Bai, Yun Wu +2 more

Privacy amplification (PA) is a critical process in quantum key distribution (QKD) systems, essential for eliminating information leakage to eavesdroppers and extracting unconditionally secure keys. In practical high-speed QKD systems, a large input size enables the PA scheme to approach the asymptotic limit of the secure-key rate. Concurrently, the throughput of the PA scheme must keep pace with the GHz-level clock rates of modern QKD systems to prevent it from becoming a systemic bottleneck. To globally optimize these objectives, this paper proposes a scalable and highly efficient PA scheme combining a novel δ-almost-universal hash family (FM3H) with modular arithmetic hashing (MH), and proves the security of this hybrid scheme, within the information-theoretic and quantum-side framework. The proposed scheme achieves a throughput of 283 Mbps on a common mobile CPU with an input size of 1010 bits. NIST statistical tests and avalanche-effect measurements are reported as characterizations of the statistical properties of the output sequences. To our knowledge, this work presents the first FPGA-based implementation of a modular hashing-based PA scheme, thereby breaking the dependence of modular hashing schemes on general software platforms. In DV-QKD systems, the FPGA-based scheme achieves a throughput of 1.706 Gbps while maintaining low resource overhead.

Information•Sep 5, 2026•0 citations

An efficient large-scale privacy amplification scheme exceeding 10G bits for quantum key distribution

Xi Cheng, Haokun Mao, Hongwei Xu +1 more

Abstract Privacy Amplification (PA) is indispensable in Quantum Key Distribution (QKD), ensuring security against eavesdropping by eliminating information leakage. For Discrete-Variable QKD (DV-QKD) protocols, a large input block size exceeding 108 bits is preferred to achieve the secure key rate approaching the asymptotic limit. However, in state-of-the-art quantum key distribution systems operating at multi-GHz pulse rates, PA becomes a critical bottleneck due to the conflicting requirements of large input block sizes and high throughput. To address this challenge, we propose a novel PA algorithm utilizing a newly constructed universal hash family DM3H and prove its cryptographic security rigorously. Based on the PA algorithm, we design and implement an efficient PA scheme which is capable of processing input block sizes up to 10 10 bits while achieving high throughput performance. For an input block size of 1010 bits, the implementation on the i9-14900 platform demonstrates a throughput of 112 Mbps with a retention ratio of 0.33. This breakthrough significantly enhances the secure key rate and maximum transmission distance of DV-QKD systems.

EPJ Quantum Technology•Dec 1, 2025•1 citation

Large-scale and High-speed Privacy Amplification for FPGA-based Quantum Key Distribution

Bingze, Yan, Qiong Li, Haokun, Mao

The FPGA-based Quantum key distribution (QKD) system is an important trend of QKD systems. It has several advantages, real time, low power consumption and high integration density. Privacy amplification is an essential part in a QKD system to ensure the security of QKD. Existing FPGA-based privacy amplification schemes have an disadvantage, that the throughput and the input size of these schemes (the best scheme 116Mbps@10^6) are much lower than these on other platforms (the best scheme 1Gbps@10^8). This paper designs a new PA scheme for FPGA-based QKD with multilinear modular hash-modular arithmetic hash (MMH-MH) PA and number theoretical transform (NTT) algorithm. The new PA scheme, named large-scale and high-speed (LSHS) PA scheme, designs a multiplication-reusable architecture and three key units to improve the performance. This scheme improves the input size and throughput of PA by above an order of magnitude. The throughput and input size of this scheme (1Gbps@10^8) is at a comparable level with these on other platforms.

arXiv:2107.01013•Jul 2, 2021•0 citations

Quantum proof and high-speed privacy amplification for quantum key distribution

Bing-Qi Yan, Junbin Wu, Fan Fan +3 more

Privacy amplification (PA) is a vital step in the postprocessing stage of quantum key distribution, which can extract a secure key from a source partially leaked to the environment. We propose a PA scheme that uses the square hash (SQH)--modular arithmetic hash (MH) function. In consideration of a potential quantum attacker, we use the trace distance as a metric to measure the closeness between two classical-quantum states. We transform a raw key state to a processed state using this scheme and derive the trace distance between the processed state and the ideal target state. It is proven that the trace distance can be reached as small as desired. Additionally, our approach accelerates the SQH-MH function through the number-theoretic transform, reducing the computational complexity to $O(n\mathrm{log}n)$. On the basis of a CPU, a maximum throughput rate of 1.06 Gbit/s is achieved, and the results show that our algorithm demonstrates good stability of the throughput rate when handling tasks with different compression ratios.

Physical Review Applied•May 2, 2025•6 citations
Privacy amplification (PA) is an essential part in a quantum key distribution (QKD) system, distilling a highly secure key from a partially secure string by public negotiation between two parties. The optimization objectives of privacy amplification for QKD are large block size, high throughput and low cost. For the global optimization of these objectives, a novel privacy amplification algorithm is proposed in this paper by combining multilinear-modular-hashing and modular arithmetic hashing. This paper proves the security of this hybrid hashing PA algorithm within the framework of both information theory and composition security theory. A scheme based on this algorithm is implemented and evaluated on a CPU platform. The results on a typical CV-QKD system indicate that the throughput of this scheme (261Mbps@2.610^8 input block size) is twice higher than the best existing scheme (140Mbps@110^8 input block size). Moreover, This scheme is implemented on a mobile CPU platform instead of a desktop CPU or a server CPU, which means that this algorithm has a better performance with a much lower cost and power consumption.
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 106 and 108 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 106and 108on Intel i9-9900k CPU respectively.
In this paper, a high-performance field-programmable gate array (FPGA) based privacy amplification (PA) scheme for both continuous variable and discrete variable - quantum key distribution (QKD) is presented, which can provide more than 1.5 Gbps throughput at the input block size close to10810^{8}108. Besides, the resource consumption is so economical that there is no need of any external storage. To the best of our knowledge, our scheme outperforms existing FPGA based PA schemes by over an order of magnitude in terms of throughput and input block size. To achieve this feature, we design a novel FPGA-based hybrid hash PA algorithm combining multilinear modular hash and modular arithmetic hash (MMH-MH) based on number theoretical transform (NTT). Based on the hybrid hash algorithm, many optimization strategies are designed in our FPGA based PA scheme, such as an NTT-based optimization unit, an NTT-reusable architecture, a memory-saving modular accumulation unit for multilinear modular hash and a pipelined binary modulo unit for modular arithmetic hash. Plentiful experiment results demonstrate the high performance and reliability of our scheme. It can be embedded in most standalone QKD devices conveniently. What's more, it is also a good candidate for a chip-based QKD system.
Privacy amplification (PA) is a critical process in quantum key distribution (QKD) systems, essential for eliminating information leakage to eavesdroppers and extracting unconditionally secure keys. In practical high-speed QKD systems, a large input size enables the PA scheme to approach the asymptotic limit of the secure-key rate. Concurrently, the throughput of the PA scheme must keep pace with the GHz-level clock rates of modern QKD systems to prevent it from becoming a systemic bottleneck. To globally optimize these objectives, this paper proposes a scalable and highly efficient PA scheme combining a novel δ-almost-universal hash family (FM3H) with modular arithmetic hashing (MH), and proves the security of this hybrid scheme, within the information-theoretic and quantum-side framework. The proposed scheme achieves a throughput of 283 Mbps on a common mobile CPU with an input size of 1010 bits. NIST statistical tests and avalanche-effect measurements are reported as characterizations of the statistical properties of the output sequences. To our knowledge, this work presents the first FPGA-based implementation of a modular hashing-based PA scheme, thereby breaking the dependence of modular hashing schemes on general software platforms. In DV-QKD systems, the FPGA-based scheme achieves a throughput of 1.706 Gbps while maintaining low resource overhead.
Abstract Privacy Amplification (PA) is indispensable in Quantum Key Distribution (QKD), ensuring security against eavesdropping by eliminating information leakage. For Discrete-Variable QKD (DV-QKD) protocols, a large input block size exceeding 108 bits is preferred to achieve the secure key rate approaching the asymptotic limit. However, in state-of-the-art quantum key distribution systems operating at multi-GHz pulse rates, PA becomes a critical bottleneck due to the conflicting requirements of large input block sizes and high throughput. To address this challenge, we propose a novel PA algorithm utilizing a newly constructed universal hash family DM3H and prove its cryptographic security rigorously. Based on the PA algorithm, we design and implement an efficient PA scheme which is capable of processing input block sizes up to 10 10 bits while achieving high throughput performance. For an input block size of 1010 bits, the implementation on the i9-14900 platform demonstrates a throughput of 112 Mbps with a retention ratio of 0.33. This breakthrough significantly enhances the secure key rate and maximum transmission distance of DV-QKD systems.
The FPGA-based Quantum key distribution (QKD) system is an important trend of QKD systems. It has several advantages, real time, low power consumption and high integration density. Privacy amplification is an essential part in a QKD system to ensure the security of QKD. Existing FPGA-based privacy amplification schemes have an disadvantage, that the throughput and the input size of these schemes (the best scheme 116Mbps@10^6) are much lower than these on other platforms (the best scheme 1Gbps@10^8). This paper designs a new PA scheme for FPGA-based QKD with multilinear modular hash-modular arithmetic hash (MMH-MH) PA and number theoretical transform (NTT) algorithm. The new PA scheme, named large-scale and high-speed (LSHS) PA scheme, designs a multiplication-reusable architecture and three key units to improve the performance. This scheme improves the input size and throughput of PA by above an order of magnitude. The throughput and input size of this scheme (1Gbps@10^8) is at a comparable level with these on other platforms.
Privacy amplification (PA) is a vital step in the postprocessing stage of quantum key distribution, which can extract a secure key from a source partially leaked to the environment. We propose a PA scheme that uses the square hash (SQH)--modular arithmetic hash (MH) function. In consideration of a potential quantum attacker, we use the trace distance as a metric to measure the closeness between two classical-quantum states. We transform a raw key state to a processed state using this scheme and derive the trace distance between the processed state and the ideal target state. It is proven that the trace distance can be reached as small as desired. Additionally, our approach accelerates the SQH-MH function through the number-theoretic transform, reducing the computational complexity to O(nlogn)O(n\mathrm{log}n)O(nlogn). On the basis of a CPU, a maximum throughput rate of 1.06 Gbit/s is achieved, and the results show that our algorithm demonstrates good stability of the throughput rate when handling tasks with different compression ratios.