一种强素数生成算法  

a New Method of Strong Prime Numbers Generator

作　　者：杨淑群[1] 

机构地区：[1]东华理工学院计算机通信系

出　　处：《科技广场》2006年第11期74-75,共2页Science Mosaic

摘　　要：RSA公钥加密体制由美国麻省理工学院于1978年提出,它是第一个成熟的、最为成功的公开密码体制,它的原理和安全性是基于数论中的Euler定理和计算复杂性理论中的论断:求两个大素数的乘积是容易计算的,但要把两个大素数的乘积分解成素因子则是非常困难的。随着密码体系分析的发展,RSA需要具有更强性质的素数(强素数)。本文提出了一种简单的强素数生成算法,同时介绍了一种伪随机数生成器和Rabin-Miller概率素性检测算法。The RSA cryptoanalysis was advanced by Rivest,Shamir and Adleman（MIT）.in 1978.At present,it is the most testing and successful opening cryptoanalysis. Its principle and security are based on the conclusion of the Euler theory and computing complexity theory.It is easy to get the-product of two big primes,but, extremely difficult to get the prime factors of the product of two big primes. Since the developing of the RSA cryptoanalysis,we now need stronger prime numbers than ever.ln this paper, we have presented a simple method for the generation of strong prime numbers. We also introduce a kind of pseudo random number generator（PRNG） and a probabilistic primality test algorithm （Rabin-Miller test）.

关 键 词：RSA 强素数 概率素性检测 伪随机数生成器 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]