计算机工程与应用2011，Vol.47Issue(20)：91-95,5.DOI:10.3778/j.issn.1002-8331.2011.20.027
整数分解的升级算法及对RSA密码体制的影响
Upgrade factorization of integers and impact on RSA cryptosystem
摘要
Abstract
This paper gives a generalization of Pollard's (p-1) -factorization method so that the generalized algorithm not only works more efficiently,but also works on some integers on which the original Pollard's (p-1)-factorization algorithm does not work; based on the (p-1) -factorization method, it proposes a higher order upgrade factorization algorithm.This paper further proposes a measure on the robustness of prime numbers in terms of resisting factorization.Under this new measure, this paper proposes the concept of stability order of prime numbers, which means that those numbers satisfying Rivest's condition are robust only against the second order upgrade factorization.关键词
整数分解/(p-1)-算法/RSA 密码体制Key words
integer factorization/the (p-1)-method/RSA cryptography分类
信息技术与安全科学引用本文复制引用
姚金江,武传坤..整数分解的升级算法及对RSA密码体制的影响[J].计算机工程与应用,2011,47(20):91-95,5.基金项目
国家重点基础研究发展规划(973) （973）
