Abstract: 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.

Key words: RSA algorithm, big prime number finding, exponential modular computation, key-pair

摘要： RSA是公钥密码体系中十分重要的加解密算法，RSA的效率瓶颈主要在大素数的寻找和指数模幂运算上。RSA密钥对的生成过程直接地涉及以上两大瓶颈计算问题。该文分析了RSA密钥对生成过程中涉及到的各种算法，并且通过修改随机数的生成方法来达到进一步改进预筛选算法的目的。

关键词: RSA算法, 大素数寻找, 指数模幂运算, 密钥对

CLC Number: 

• TP309