Cipher key generation system and method based on RSA cryptographic algorithm

Abstract

The invention discloses a cipher key generation system and method based on an RSA cryptographic algorithm. The cipher key generation system comprises a multiplier module, a random number module, a preprocessing module, a decision module, a module value generation module, a modular inversion module and an output module. The method comprises the following implementation steps: (1) generating a first factor of the RSA module value; (2) generating a second factor of the RSA module value; (3) generating the RSA module value; (4) calculating an RSA private key index; and (5) outputting an RSA cipher key. According to the cipher key generation system and method disclosed by the invention, the calculation burden of the RSA cipher key generation process can be effectively reduced, the generation speed of the RSA cipher key can be increased, and the security of the RSA cryptographic algorithm can be ensured.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a key generation system and method based on an RSA cryptographic algorithm in a public key cryptosystem in the technical field of information security. The present invention preprocesses large prime numbers, combines Miller-Rabin detection, and adopts an improved Euclidean algorithm to calculate private keys, effectively avoiding division problems and generating keys that meet the requirements of the RSA algorithm. Background technique [0002] With the development of communication and information security technology, the public key cryptosystem has been paid more and more attention by people. Among the many public key cryptographic algorithms, the RSA cryptographic algorithm is the most mature and widely used cryptographic algorithm. It not only has traditional information encryption capabilities, but also can be used to verify the authenticity, integrity and validi...

AI Technical Summary

Problems solved by technology

The disadvantage of this method is that the probability of the primality test result being a prime number is not high enough, which makes the RSA encryption algorithm unsafe.

However, the disadvantage of this method is that when calculating the modular inverse, it needs to loop 1024 times, which leads to complex calculations and affects the practical application of RSA ciphers

However, the disadvantage of this device is that when the RSA key parameters are created, there is no preprocessing module for large prime numbers, which leads to too much calculation when the system performs prime number detection and affects the key generation speed of RSA

Images