An Application of Low Private Ezponent Attack on RSA
RSA is one of the most popular and widely used public key cryptosystems. In this paper, an application of low private exponent attack on it is presented. More precisely, let (N, e) be an RSA public key with corresponding private key d, then N can be factored provided that there exists a proper integer k such that ek is relatively small and dk mod φ(N) is small (or large) enough. Experiment shows that our generalization of low private exponent attack can seek out some new weak keys of RSA.
RSA lattice reduction low private ezponent attack
Yong-Hui Zheng Yue-Fei Zhu Hong Xu
Department of Applied Mathematics Zhengzhou Information Science and Technology Institute Zhengzhou, 450002, P.R.China
国际会议
第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)
南京
英文
1864-1866
2009-07-25(万方平台首次上网日期,不代表论文的发表时间)