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:2109.07139

Privacy amplification scheme based on composite coding

Wei Li, Shengmei Zhao

Published Sep 15, 2021• 1 citation
arXivHTMLPDF

Abstract

Privacy amplification is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. Furthermore, the information-theoretic bound for the extraction of the key is obvious in composite coding.

DOI
10.48550/arxiv.2109.07139

Related papers

Privacy amplification for quantum key distribution

Yodai Watanabe

This paper examines classical privacy amplification using a universal family of hash functions. In quantum key distribution, the adversary's measurement can wait until the choice of hash functions is announced, and so the adversary's information may depend on the choice. Therefore the existing result on classical privacy amplification, which assumes the independence of the choice from the other random variables, is not applicable to this case. This paper provides a security proof of privacy amplification which is valid even when the adversary's information may depend on the choice of hash functions. The compression rate of the proposed privacy amplification can be taken to be the same as that of the existing one with an exponentially small loss in secrecy of a final key.

Journal of Physics A Mathematical and Theoretical•Dec 20, 2006•18 citations

An Efficient Privacy Amplification Scheme Based on SQH-L

Weigang Li, Yucheng Qiao

In Quantum Key Distribution (QKD) systems, the privacy amplification phase plays a crucial role in ensuring secure communications. However, existing privacy amplification schemes often suffer from computational challenges. This article proposes a high-speed privacy amplification scheme SQH-L based on the SQH (Square Hash) hash function family, which supports variable output length. The scheme significantly improves computational efficiency through the introduction of Number Theoretic Transform (NTT). Experimental results show that the SQH-L scheme outperforms the SQH-MH scheme, MMH-MH scheme, and FFT-based Toeplitz scheme across various parameter settings, especially when the output key has a high retention ratio. This research not only optimizes existing privacy amplification technologies but also provides an efficient solution for quantum key distribution systems, significantly increasing privacy amplification throughput while ensuring information security.

International Academic Symposium on Electronic Information and Signal Processing (EISP)•Nov 1, 2025•0 citations

Stream Privacy Amplification for Quantum Cryptography

Yizhi Huang, Xingjian Zhang, Xiongfeng Ma

Privacy amplification is the key step to guarantee the security of quantum communication.The existing security proofs require the accumulation of a large number of raw key bits for privacy amplification.This is similar to block ciphers in classical cryptography that would delay the final key generation since an entire block must be accumulated ahead of privacy amplification.Moreover, any leftover errors after information reconciliation would corrupt the entire block.By modifying the security proof based on quantum error correction, we develop a stream privacy-amplification scheme, which resembles the classical stream cipher.This scheme can output the final key in a stream way, prevent error from spreading, and hence can put privacy amplification ahead of information reconciliation.The stream scheme can also help to enhance the security of trusted-relay quantum networks and improve the practicality of randomness extraction for quantum random number generators.

arXiv:2111.14108•PRX Quantum•Jun 10, 2022•11 citations

Memory-Saving and High-Speed Privacy Amplification Algorithm Using LFSR-Based Hash Function for Key Generation

Enjian Bai, Xueqin Jiang, Yun Ping Wu

Privacy amplification is an indispensable procedure for key generation in the quantum key distribution system and the physical layer key distribution system. In this paper, we propose a high-speed privacy amplification algorithm that saves hardware memory and improves the key randomness performance. Based on optimizing the structure of the Toeplitz matrix generated by a linear feedback shift register, the core of our algorithm is a block-iterative structure hash function that is used to generate a secure key of arbitrary length. The proposed algorithm adopts multiple small Toeplitz matrices to compress the negotiation key for convenient implementation. The negotiated key is equally divided into multiple small blocks, and the multiplication operation of the negotiated key with the Toeplitz matrix is converted into a modular addition operation through an accumulator. The analysis results demonstrate that the algorithm has the advantages of saving memory and running quickly. In addition, the NIST randomness test and avalanche effect test on the key sequences indicate that the proposed algorithm has a favorable performance.

Electronics•Jan 27, 2022•17 citations

Combining Error Verification and Privacy Amplification in Quantum Key Distribution

Devashish Tupkary, Zhiyao Wang, Ernest Y. -Z. Tan

Quantum Key Distribution (QKD) protocols typically involve two separate steps of error-verification and privacy amplification. Both steps involve the application of a hash function sampled from a suitable hash family to classical data. A potentially simpler alternative is to implement a single-step hashing procedure, announce and compare a fixed number of bits of its output for error-verification, and retain the remaining bits as the final output key. This reduces the complexity of classical postprocessing, the amount of classical communication, and the amount of randomness needed in the protocol. While this construction has appeared in the literature, a suitable mathematical justification is lacking. In this work, we show that the security of such protocols, under certain simple conditions, follows from a slightly modified notion of secrecy of the protocol without the final error-verification step. In particular, we show that for most entropy-based proofs, the combined protocol can be implemented with no change to the key rate, and a minor change to the security parameter.

quant-pharXiv:2610.10702•Oct 9, 2026•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 is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. Furthermore, the information-theoretic bound for the extraction of the key is obvious in composite coding.
This paper examines classical privacy amplification using a universal family of hash functions. In quantum key distribution, the adversary's measurement can wait until the choice of hash functions is announced, and so the adversary's information may depend on the choice. Therefore the existing result on classical privacy amplification, which assumes the independence of the choice from the other random variables, is not applicable to this case. This paper provides a security proof of privacy amplification which is valid even when the adversary's information may depend on the choice of hash functions. The compression rate of the proposed privacy amplification can be taken to be the same as that of the existing one with an exponentially small loss in secrecy of a final key.
In Quantum Key Distribution (QKD) systems, the privacy amplification phase plays a crucial role in ensuring secure communications. However, existing privacy amplification schemes often suffer from computational challenges. This article proposes a high-speed privacy amplification scheme SQH-L based on the SQH (Square Hash) hash function family, which supports variable output length. The scheme significantly improves computational efficiency through the introduction of Number Theoretic Transform (NTT). Experimental results show that the SQH-L scheme outperforms the SQH-MH scheme, MMH-MH scheme, and FFT-based Toeplitz scheme across various parameter settings, especially when the output key has a high retention ratio. This research not only optimizes existing privacy amplification technologies but also provides an efficient solution for quantum key distribution systems, significantly increasing privacy amplification throughput while ensuring information security.
Privacy amplification is the key step to guarantee the security of quantum communication.The existing security proofs require the accumulation of a large number of raw key bits for privacy amplification.This is similar to block ciphers in classical cryptography that would delay the final key generation since an entire block must be accumulated ahead of privacy amplification.Moreover, any leftover errors after information reconciliation would corrupt the entire block.By modifying the security proof based on quantum error correction, we develop a stream privacy-amplification scheme, which resembles the classical stream cipher.This scheme can output the final key in a stream way, prevent error from spreading, and hence can put privacy amplification ahead of information reconciliation.The stream scheme can also help to enhance the security of trusted-relay quantum networks and improve the practicality of randomness extraction for quantum random number generators.
Privacy amplification is an indispensable procedure for key generation in the quantum key distribution system and the physical layer key distribution system. In this paper, we propose a high-speed privacy amplification algorithm that saves hardware memory and improves the key randomness performance. Based on optimizing the structure of the Toeplitz matrix generated by a linear feedback shift register, the core of our algorithm is a block-iterative structure hash function that is used to generate a secure key of arbitrary length. The proposed algorithm adopts multiple small Toeplitz matrices to compress the negotiation key for convenient implementation. The negotiated key is equally divided into multiple small blocks, and the multiplication operation of the negotiated key with the Toeplitz matrix is converted into a modular addition operation through an accumulator. The analysis results demonstrate that the algorithm has the advantages of saving memory and running quickly. In addition, the NIST randomness test and avalanche effect test on the key sequences indicate that the proposed algorithm has a favorable performance.
Quantum Key Distribution (QKD) protocols typically involve two separate steps of error-verification and privacy amplification. Both steps involve the application of a hash function sampled from a suitable hash family to classical data. A potentially simpler alternative is to implement a single-step hashing procedure, announce and compare a fixed number of bits of its output for error-verification, and retain the remaining bits as the final output key. This reduces the complexity of classical postprocessing, the amount of classical communication, and the amount of randomness needed in the protocol. While this construction has appeared in the literature, a suitable mathematical justification is lacking. In this work, we show that the security of such protocols, under certain simple conditions, follows from a slightly modified notion of secrecy of the protocol without the final error-verification step. In particular, we show that for most entropy-based proofs, the combined protocol can be implemented with no change to the key rate, and a minor change to the security parameter.
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.