Elliptic curve encryption method using quantum random number

Abstract

The invention provides an elliptic curve encryption method using a quantum random number. The method comprises the following concrete implementation steps: 1, generating an unpredictable random numberby a quantum random number generator; 2, determining an elliptic curve E and one point P on the elliptic curve E according to the first random number p generated in the step 1, wherein order of the Pis p; and 3, obtaining a public and private key pair by further applying a public and private key pair generating algorithm to the second random number generated in the step 1 and parameters determined in the step 2. The method provided by the invention solves the problems that a current elliptic curve encryption system generates a random number by a certain algorithm and insecurity is extremelyhigh. The unpredictable random number generated by the quantum random number generator is taken as a seed, and safety and reliability of the generated public and private key pair are guaranteed. Therefore, a elliptic curve encryption technology using the quantum random number can further improve security of an existing encryption technology.

Description

technical field [0001] The invention relates to the technical field of network security communication and encryption, in particular to an elliptic curve encryption method using quantum random numbers. Background technique [0002] The encryption algorithm based on elliptic curve (ECC), as an asymmetric encryption algorithm, was first proposed by Koblitz and Miller in 1985. Its mathematical basis is to use the rational points on the elliptic curve to form the elliptic discrete logarithm on the Abel addition group. Computational difficulty. Different from traditional encryption methods based on the difficulty of factoring large prime numbers, ECC generates keys through the properties of elliptic curve equations. The security level of 160-bit ECC keys is equivalent to the confidentiality provided by RSA1024-bit keys, and the amount of calculation Smaller, the processing speed of the private key is faster, and the storage space and transmission bandwidth are less occupied. At ...

AI Technical Summary

Problems solved by technology

However, in fact, these random numbers are generated by a certain algorithm, which is extremely insecure

In recent years, Moore's Law is gradually approaching the limit, new technologies are constantly emerging, and the computing resources and computing power available to third parties have also increased dramatically, which makes it easier and easier for existing information encryption technology to generate random numbers by specific algorithms cracked

Images