Implementation method and device for generating key pair in embedded system

Abstract

The invention discloses an implementation method and device for generating a key pair in an embedded system. The method includes the following steps: a CPU obtains an RSA public key index, the RSA modulus length and the RSA key pair type from a received instruction of generating a key pair; a first seed matched with security of the RSA modulus length is generated; a first certainty prime number and a second certainty prime number are generated according to the RSA modulus length, the first seed and the RSA public key index; and an RSA public key modulus and an RSA private key corresponding tothe key pair type are generated according to the RSA modulus length, the RSA public key index, the first certainty prime number and the second certainty prime number, an RSA public key is formed according to the RSA public key modulus and the RSA public key index, and the SA public key and the RSA private key are stored. The technical scheme of the invention improves security of generating the keypair.

Description

technical field [0001] The invention relates to the field of information security, in particular to an implementation method and device for generating a key pair in an embedded system. Background technique [0002] In the RSA cryptosystem, the security of the system is based on the following problem: it is easy to multiply two large prime numbers, but it becomes very difficult to factorize their product in turn. Therefore, the security of the RSA cryptosystem is the same as Prime number determination and large number decomposition are closely related, and the key to the security of the RSA cryptosystem lies in the selection of large prime numbers p and q. After cryptanalysis (such as Pollard's p-1 method, Williams' p+1 method, cycle attack method, etc.) It is found that a class of prime numbers has some weak characteristics. According to these weak characteristics, an attacker can directly obtain useful information or even completely crack the cryptographic system by decompo...

AI Technical Summary

Problems solved by technology

On the other hand, the RSA key pair generated by the above method cannot resist the commonly used Pollard's p-1 attack method because the large prime number used is a probability prime number

In occasions with relatively high security requirements, the above method will have certain hidden dangers. Therefore, it is urgent to provide an implementation method for generating key pairs using deterministic prime numbers

Images