Quantum secret key distribution privacy amplification method supporting large-scale dynamic changes

Abstract

The invention discloses a quantum secret key distribution privacy amplification method supporting large-scale dynamic changes. The method includes the steps of firstly, conducting initialization, wherein the optimal operation scale m of an FFT module is calculated according to the actual running parameters of a quantum secret key distribution system when the privacy amplification method is started, and the initialization scale is an FFT operation and inverse FFT operation module of m; secondly, normalizing data, wherein the final security secret key length r is calculated according to the detector counting rate Q mu of the quantum secret key distribution system, the quantum bit error rate E mu, the corrected weak security secret key length n and the security parameter s of the quantum secret key distribution system, and normalizing an initial secret key string and a Toeplitz matrix according to the parameter m, the parameter n and the parameter r; thirdly, conducting data operation, wherein the operation process of the Toeplitz matrix and the initial secret key string is operated through the FFT technology, the first r items of the calculation result are taken to form a result vector, namely, the final security secrete key. The method has the advantages of being high in flexibility, better in processing performance, and the like.

Description

Technical field [0001] The present invention mainly relates to the field of quantum keys, and particularly refers to a method for enhancing the confidentiality of quantum key distribution for supporting large-scale dynamic changes. Background technique [0002] In recent years, with the rapid development of computing technology, modern cryptosystems (including symmetric key systems and asymmetric cryptosystems) based on the complexity of mathematical problems are facing severe security challenges, especially the Peter Shor quantum decomposition algorithm. Utilizing the parallelism of quantum computing, it can quickly decipher the currently widely used encryption algorithms such as RSA. Once the quantum computer is successfully developed, it will seriously threaten the information security of the country's core areas of finance, politics, and military affairs. "One-Time Pad" (OTP) is currently the only encryption algorithm that has been proven to be secure in information theory (...

AI Technical Summary

Problems solved by technology

When FFT technology processes variable-length key strings, it is necessary to construct an FFT transformation scheme of the same length, and constructing a large-scale FFT transformation scheme is very time-consuming, which will reduce the processing performance of the security enhanc...

Images