基于多素数和参数替换的改进RSA算法研究.

In order to achieve greater safety in RSA encryption algorithm in the data encryption process, this paper made some improvements based on in-depth analysis on the traditional RSA algorithm. It put forward a more secure method with changing traditional double primes into four primes in the traditional RSA algorithm and eliminating the requirement for transferring the product n of two random primes in public key on the basis of parameter substitution. Instead, this paper replaced the original parameter n to a new introduced parameter x. In order to boost the efficiency in the introduced algorithm, this paper used the CRT(Chinese remainder theorem) to expedite the exponentiation of large numbers. The results demonstrate the feasibility of the improved algorithm, and it provides a safer path for messages transmission through public key encryption. At the same time, this paper carried out a comparative analysis of encryption and decryption time among the improved algorithm and the traditional double primes and four primes RSA algorithms. The results show that the improved algorithm to a certain degree enhanced the encryption and decryption efficiency between the message sender and receiver. [ABSTRACT FROM AUTHOR]