Research on Improved Double RSA Algorithm Based on RSA

Abstract

Aiming at the exposure of the public key in the RSA algorithm, this paper proposes to use the double RSA algorithm to perform the second encryption of the public key modulus to generate a false modulus, thereby improving the security of the RSA algorithm. Secondly, the problem of generating large prime numbers is a time-consuming problem in the RSA algorithm. In addition to generating large prime numbers in encrypted plaintext, double RSA algorithm also generates large prime numbers that create fake modulus, which undoubtedly increases the time-consuming algorithm. Aiming at the above-mentioned time-consuming problem, this paper proposes an improved random incremental search algorithm, which uses low-order four prime numbers instead of traditional high-order two prime numbers. Experimental data shows that the improved algorithm improves the running speed and has certain feasibility.