小素数筛值法生成素数实现RSA加密算法  

The Study about the Implementation of RSA Encrypt Algorithm in Little Prime Number Building Method

作　　者：池越[1] 

机构地区：[1]河北工业大学信息工程学院,天津300130

出　　处：《河北工业大学成人教育学院学报》2006年第2期16-20,共5页Journal of Adult Education School of Hebei University of Technology

摘　　要：描述了概率性素数产生方法,并给出了基于小素数筛值法生成素数的具体算法。应用Rabin-Miller测试和中国余数定理,编写出了生成强伪素数的核心算法的源程序。分析和试验表明,本文算法是切实可行的,而且大大提高了RSA算法中解密过程的实现速度。This paper describe the way of producing the probability prime, and show the arithmetic of little Prime Number Building Method. The realization of the programme which create the main strong-prime arithmetic using Rabin - Miller Test and Pocklington theorem. From the analysis and the test, this arithmetic is feasible, and increases the speed of the decryption process in RSA encrypt arithmetic.

关 键 词：RSA加密算法 强素数 小素数筛值法 Rabin-Miller测试 

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