Analysis and Improvement of RSA Data Encryption Algorithm
Na Wang · Journal of University of Jinan · 2013
It needs a lot of calculation to find a large prime number,reducing the efficiency of RSA.To improve the efficiency of RSA encryption algorithm,we use small prime sieve value method,even exclusion act and small prime act to preliminarily treat pseudo-primes,and then test the pseudo-primes by using Miller-Rabin algorithm.Compared with the classic Miller-Rabin algorithm,the improved one can improve the testing efficiency of prime detection,with less than 0.1% probability that the result is not a large prime number.So the improved algorithm can enhance the applicability of RSA encryption algorithm.