Abstract
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.
Highlights
Privacy amplification (PA) plays a vital role in the quantum key distribution (QKD) system and physical layer key distribution (PLKD) system
The earliest PA technology was proposed by Bennett et al [6], where they proved that the technology can be applied to the quantum key distribution system to achieve unconditional safety [7]
The computing power necessary to deal with the negotiated key with the Toeplitz matrix, as well as the randomness of generating the final secure shared key, are the main performance indicators for evaluating a PA algorithm
Summary
Privacy amplification (PA) plays a vital role in the quantum key distribution (QKD) system and physical layer key distribution (PLKD) system Both parties of legal communication, Alice and Bob, can apply the same PA algorithm to map the negotiated key into a shorter unconditional secure secret key in order to delete the information leaked to the eavesdropper Eve. Both parties of legal communication, Alice and Bob, can apply the same PA algorithm to map the negotiated key into a shorter unconditional secure secret key in order to delete the information leaked to the eavesdropper Eve At this time, the key information generated by Eve is almost zero; Alice and Bob can obtain the same secure unconditional key [1,2,3,4,5]. The length of the negotiated key is usually very long, so the size of the Toeplitz matrix is large; the requirements for the hardware resources will be higher, and even the calculation speed of the PA algorithm will be reduced
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
