一种快速的强素数生成方法  

A Fast Strong Prime Generation Method

作　　者：游新娥[1] 田华娟[1] 

机构地区：[1]湖南娄底职业技术学院,湖南娄底417000

出　　处：《通信技术》2009年第2期323-325,共3页Communications Technology

基　　金：2008年湖南省教育厅科研资助项目(08D107)成果。

摘　　要：针对传统的大素数生成方法需进行较复杂的模幂运算,从而导致运算速度较慢的缺陷,本文基于Miller-Rabin概率性素数检测法提出了一种大素数生成的优化方法,有效地提高了寻找大素数的速度。基于此优化方法,提出了一种新的强素数生成算法,该方法根据强素数的特征,用自顶向下的方法来生成强素数,算法简单、易实现,满足RSA算法安全性的需求。Considering the shortage of slow operation speed caused by complicated model and power operation in the traditional large prime number generation method. An optimized method for large prime number generation, based on the Miller-Rabin probabilistic prime number detection is proposed, which effectively raises the speed for researching the large prime number. Based on this optimized method, a new strong prime generation method is proposed. According to the character of the strong prime and by using top-down construction method, the strong prime is generated. The proposed algorithm is simple, easy for implementation, and could satisfy the security requirements of RSA algorithm.

关 键 词：RSA算法 素数检测 强素数 

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