Efficient Method of RSA Key-Pair Generation

RSA is a very important public-key encryption algorithm.The bottleneck problems of RSA efficiency are big prime number finding and exponential modular computation.RSA key-pair generation depends on the two problems mentioned just now.This paper carefully analyse the main algorithms used by the key-pair generation process,and improves the preselection algorithm by modifying the method of random number generation.