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

Acta Sinica Quantum Optica

Privacy Amplification for Quantum Key Distribution

Yongmin Li

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

Privacy amplification is an essential part of distilling highly secret shared information in quantum key distribution.Two accelerating algorithms used for privacy amplification are introduced in this paper.The combination of the two accelerating algorithms not only has the merits of high security,but also effectively reduces the computation time.By using the combined algorithm,we have achieved secret-key distillation for continuous variable quantum key distribution.

Related papers

High-Speed Implementation of Length-Compatible Privacy Amplification in Continuous-Variable Quantum Key Distribution

Xiangyu Wang, Yichen Zhang, Song Yu +1 more

Privacy amplification is an indispensable step in postprocessing of continuous-variable quantum key distribution (CV-QKD), which is used to distill unconditional secure keys from identical corrected keys between two distant legal parties. The processing speed of privacy amplification has a significant effect on the secret key rate of a CV-QKD system. We report the high-speed parallel implementation of the length-compatible privacy amplification algorithm based on a graphic processing unit. The length-compatible algorithm is used to satisfy the security requirements of privacy amplification at different transmission distances when considering finite-size effect. We achieve the speed of privacy amplification over 1 Gb/s at arbitrary input length and the speed is one to two orders of magnitude faster than previous demonstrations, which supports the high-speed real-time CV-QKD system and ensures the security of privacy amplification.

arXiv:1805.02372•IEEE photonics journal•Apr 9, 2018•238 citations

Memory-Saving Implementation of High-Speed Privacy Amplification Algorithm for Continuous-Variable Quantum Key Distribution

Dengwen Li, Peng Huang, Yingming Zhou +2 more

Privacy amplification is an indispensable procedure to share secure secret key between legitimate parties in quantum key distribution (QKD) because a portion of bits are still leaked to eavesdropper Eve after the secret reconciliation. Here, we propose a novel privacy amplification scheme with an optimal hash function. In particular, by utilizing the linear feedback shift register (LFSR) technique, we optimize and simplify the construction of the Toeplitz matrix. In this way, the LFSR-based Toeplitz matrix is used to execute the privacy amplification algorithm. The hardware storage resources can then be drastically saved, and the time consuming will be only about half of that without using the LFSR-based Toeplitz matrix. This work breaks the bottleneck of privacy amplification in high-speed continuous-variable QKD (CVQKD), and thus contributes to the real-time performance of the whole CVQKD system.

IEEE photonics journal•Aug 14, 2018•19 citations

High-speed Implementation of FFT-based Privacy Amplification on FPGA in Quantum Key Distribution

Qiong Li, Bingze Yan, Haokun Mao +1 more

Privacy amplification (PA) is a vital procedure in quantum key distribution (QKD) to generate the secret key that the eavesdropper has only negligible information from the identical correcting key for the communicating parties. With the increase of repeat frequency of discrete-variable QKD (DV-QKD) system, the processing speed of PA has become the bottle neck restricting DV-QKD's secure key rate. The PA using Toeplitz-based Hash function is adopted widely because of its simplicity and parallel feature. Because this algorithm can be accelerated with Fast Fourier Transform (FFT), an improved scheme PA for Field-programmable Gate Array (FPGA) based on this is proposed. This paper improves the custom FFT-based algorithm by reducing the number of computations and read/write memory operations significantly. The correctness is verified when implemented in a Xilinx Virtex-6 FPGA. Meanwhile, the processing speed of improved scheme can nearly double the classical Toeplitz Hashing scheme on FPGA through the actual experiment.

arXiv:1809.07592•Sep 20, 2018•2 citations

FPGA-Based Implementation of Size-Adaptive Privacy Amplification in Quantum Key Distribution

Shenshen Yang, Zengliang Bai, Xuyang Wang +1 more

In a quantum key distribution (QKD) system, privacy amplification (PA) is an essential procedure that can effectively eliminate the leaked information to an eavesdropper and distill a secret key. The processing speed of the PA algorithm inevitably affects the final key rate of the QKD system. We propose a high-speed PA algorithm based on field-programmable gate array (FPGA), where the matrix multiplications are divided into a number of rhomboid-block operations. The implementation of the PA reduces significantly the required number of FPGA Block RAMs. Meanwhile, it automatically adapts to different lengths of input and output blocks. Finally, we verified the correctness and high-speed of the algorithm when implemented in a Xilinx Virtex-7 FPGA.

IEEE photonics journal•Oct 10, 2017•37 citations

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

Chunmei Zhang, Mo Li, Jingzheng Huang +8 more

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.

Chinese Physics B•Sep 1, 2014•26 citations

Generalized privacy amplification

C. H. Bennett, Gilles Brassard, Claude Crépeau +1 more

This paper, provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. Privacy amplification is a process that allows two parties to distil a secret key from a common random variable about which an eavesdropper has partial information. The two parties generally know nothing about the eavesdropper's information except that it satisfies a certain constraint. The results have applications to unconditionally secure secret-key agreement protocols and quantum cryptography, and they yield results on wiretap and broadcast channels for a considerably strengthened definition of secrecy capacity.

IEEE Transactions on Information Theory•Jan 1, 1995•1,421 citations
Privacy amplification is an essential part of distilling highly secret shared information in quantum key distribution.Two accelerating algorithms used for privacy amplification are introduced in this paper.The combination of the two accelerating algorithms not only has the merits of high security,but also effectively reduces the computation time.By using the combined algorithm,we have achieved secret-key distillation for continuous variable quantum key distribution.
Privacy amplification is an indispensable step in postprocessing of continuous-variable quantum key distribution (CV-QKD), which is used to distill unconditional secure keys from identical corrected keys between two distant legal parties. The processing speed of privacy amplification has a significant effect on the secret key rate of a CV-QKD system. We report the high-speed parallel implementation of the length-compatible privacy amplification algorithm based on a graphic processing unit. The length-compatible algorithm is used to satisfy the security requirements of privacy amplification at different transmission distances when considering finite-size effect. We achieve the speed of privacy amplification over 1 Gb/s at arbitrary input length and the speed is one to two orders of magnitude faster than previous demonstrations, which supports the high-speed real-time CV-QKD system and ensures the security of privacy amplification.
Privacy amplification is an indispensable procedure to share secure secret key between legitimate parties in quantum key distribution (QKD) because a portion of bits are still leaked to eavesdropper Eve after the secret reconciliation. Here, we propose a novel privacy amplification scheme with an optimal hash function. In particular, by utilizing the linear feedback shift register (LFSR) technique, we optimize and simplify the construction of the Toeplitz matrix. In this way, the LFSR-based Toeplitz matrix is used to execute the privacy amplification algorithm. The hardware storage resources can then be drastically saved, and the time consuming will be only about half of that without using the LFSR-based Toeplitz matrix. This work breaks the bottleneck of privacy amplification in high-speed continuous-variable QKD (CVQKD), and thus contributes to the real-time performance of the whole CVQKD system.
Privacy amplification (PA) is a vital procedure in quantum key distribution (QKD) to generate the secret key that the eavesdropper has only negligible information from the identical correcting key for the communicating parties. With the increase of repeat frequency of discrete-variable QKD (DV-QKD) system, the processing speed of PA has become the bottle neck restricting DV-QKD's secure key rate. The PA using Toeplitz-based Hash function is adopted widely because of its simplicity and parallel feature. Because this algorithm can be accelerated with Fast Fourier Transform (FFT), an improved scheme PA for Field-programmable Gate Array (FPGA) based on this is proposed. This paper improves the custom FFT-based algorithm by reducing the number of computations and read/write memory operations significantly. The correctness is verified when implemented in a Xilinx Virtex-6 FPGA. Meanwhile, the processing speed of improved scheme can nearly double the classical Toeplitz Hashing scheme on FPGA through the actual experiment.
In a quantum key distribution (QKD) system, privacy amplification (PA) is an essential procedure that can effectively eliminate the leaked information to an eavesdropper and distill a secret key. The processing speed of the PA algorithm inevitably affects the final key rate of the QKD system. We propose a high-speed PA algorithm based on field-programmable gate array (FPGA), where the matrix multiplications are divided into a number of rhomboid-block operations. The implementation of the PA reduces significantly the required number of FPGA Block RAMs. Meanwhile, it automatically adapts to different lengths of input and output blocks. Finally, we verified the correctness and high-speed of the algorithm when implemented in a Xilinx Virtex-7 FPGA.
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.
This paper, provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. Privacy amplification is a process that allows two parties to distil a secret key from a common random variable about which an eavesdropper has partial information. The two parties generally know nothing about the eavesdropper's information except that it satisfies a certain constraint. The results have applications to unconditionally secure secret-key agreement protocols and quantum cryptography, and they yield results on wiretap and broadcast channels for a considerably strengthened definition of secrecy capacity.