RSA中大素数的快速生成方法研究  

Research on the rapid generation algorithm of large prime number in RSA algorithm

作　　者：王宝杏[1] 杨菲菲[1] 王冬[1] 

机构地区：[1]安徽理工大学,安徽淮南232001

出　　处：《长沙通信职业技术学院学报》2008年第1期56-59,共4页Journal of Changsha Telecommunications and Technology Vocational College

摘　　要：RSA公开钥密码体制算法的关键是如何产生大素数和进行大指数模幂运算。文章介绍了几种流行的产生大素数的算法。并给出了Miller-Rabin检测素数算法和基于Montgomery模乘算法的模幂算法快速生成大素数算法。The key of RSA public key cryptography algorithm is how to generate large prime numbers and how to carry on the index modular exponentiation operation. This paper presents several popular algorithms of producing large prime numbes, and gives a algorithm which bases on Miller-Rabin prime detection algorithm and modular exponentiation algorithm based on Montgomery Modular Multiplication algorithm to rapidly generate large prime numbers.

关 键 词：RSA公开钥密码体制 素数检测 MONTGOMERY模乘 模幂 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]