Asymmetric encryption method using quantum random numbers

Abstract

The invention provides an asymmetric encryption method using quantum random numbers. The specific implementation steps of the method are as follows: step 1: a quantum random number generator generatesunpredictable random numbers; step 2: these quantum random numbers are subjected to a large integer prime number screening algorithm to obtain a seed random number satisfying the generation of a public key and private key pair; and step 3: the seed random number is subjected to a public key and private key pair generation algorithm to generate the public key and private key pair. By adoption of the method provided by the invention, the problem that the existing public key encryption system generates the random number by using the determined algorithm, resulting in extremely high insecurity, is solved. The unpredictable random number generated by the quantum random number generator is used as the seed to ensures the security and reliability of the generated public key and private key pair.Therefore, the asymmetric encryption technique using the quantum random numbers will further improve the security under the existing encryption technology.

Description

technical field [0001] The invention relates to the technical field of network security communication and encryption, in particular to an asymmetric encryption method using quantum random numbers. Background technique [0002] In recent years, with the rapid development and popularization of the mobile Internet, people have become accustomed to the convenient life it brings, but at the same time, it is also accompanied by the threat of hackers to the security of personal information and business secrets. Products with a clearly marked price. The Internet is full of illicit transactions in which citizens' personal information is bought and sold. While gaining convenience, people are also losing privacy. At the same time, people are increasingly concerned about their own information security. Therefore, it has become the consensus of practitioners in the field of information security to constantly find new or improve existing information encryption technologies to meet the ...

AI Technical Summary

Problems solved by technology

The current RSA system uses a probability algorithm to verify whether a randomly generated large integer is a prime number, but the algorithm for generating random numbers must be very good, and the generated random numbers should be random and unpredictable

However, some of these very good random number algorithms have been published and cannot be used

Moreover, according to the principles of cryptography, the algorithm is public, and the security based on the algorithm is difficult to last for a long time.

In short, random numbers generated by deterministic algorithms are extremely insecure

Images