摘要
Boneh和Venkatesan提出了一个多项式算法,用以恢复p个元素的有限域Fp的隐藏数α,在此基础上得到了许多推广及在某些密码系统的应用。文中把这些结果应用到RSA的比特安全性分析上.
Boneh and Venkatesan have proposed a polynomial time algorithm for recovering a ＂hidden＂ element α of a finite field Fp ofpelements. Based on this method, many people extended it and applied to many cryptography systems in. Here the result to RSA cryptography system is applied.
出处
《科学技术与工程》
2007年第8期1740-1741,共2页
Science Technology and Engineering
关键词
比特安全性
RSA
隐藏数
security of bits RSA hidden number problem
