RSA算法的内在特性、破解与防范措施

Internal Peculiarity and Cryptanalysis of the RSA Algorithm and Precautionary Measures

为了给RSA(Rivet、Shamir和Adelman提出的)算法的使用者提供参考,从不动点、周期性、对明文的要求、保密性和加密速度等方面分析了这种加密算法的内在特性,从理论和实际两方面对该算法的脆弱性以及针对该算法的攻击方法进行了分析。归纳出如何防范针对该算法攻击的结论,得出了RSA使用者使用的密钥匙位数必须大于2048位才能保证算法安全性这一结果．通过给黑客的攻击方法进行分类,从算法维护和安全策略定制的角度,总结了网络安全人员提升加密算法安全性的办法．

To provide a reference to RSA （ proposed by Rivet, Shamir and Adelman） users, the internal peculiarities of the algorithm such as unmovable point, periodicity, demand for plain text, security, and cryptography speed are analyzed. By stating the drawbacks of RSA and the usual attacking in theoretical and practical aspects, the paper presents the precautionary measures that the key number of RSA must be greater than 2 048 bits for users to ensure the safely of RSA algorithm. With the attacking ways sorted, the measures to approve the security of RSA are put forward for network workers.