整数分解与RSA的安全性

Factorization of big integer and the security of RSA

提出了3种大整数因数分解的方法,并通过这些方法对RSA密码算法的安全性做出了界定。根据分析得知,如果不考虑RSA中生成密钥的2个素数之间的差值,单纯地增加2个素数的取值对提高安全性很可能是无效的。最后,给出了两则在RSA密码算法下要想产生能提供足够安全强度的密钥应该遵守的建议。

Three kinds of methods for integer factorization were proposed and the security of RSA was demarcated. RSA is a well-known cryptographic algorithm, using the analysis result of those methods. Through the work, readers could easily realize that if merely enlarged two prime numbers but lost attention of the relevance of them, the secu- rity of this algorithm might been missed. In the end, two recommended tactics to choose prime numbers as key of this algorithm were given.