期刊文献+

中间比特私钥泄漏的RSA小指数攻击

Cryptanalysis of Low Exponent RSA Given Consecutive Bits of p in the Middle
下载PDF
导出
摘要 Boneh和Durfee运用Coppersmith的方法在d<N0.292的条件下分解了RSA模数N。将RSA离散比特私钥泄漏攻击与小指数攻击相结合,在p,q平衡和p的一个中间比特块已知的情况下,将解密指数的界提高到了d<N0.5。最后给出了实验测试,证明文章构造的格可以运用到实际攻击中。 Boneh and Durfee used Coppersmith' s method to factorize N using e when d 〈 N^0. 292. This paper presents a heuristic algorithm that combines the low exponent attack with the partial key exposure attack given discrete bits. It is shown that if the private exponent d used in the RSA public key cryptosystem is less than N^0.5 , the system is insecure with some bits of p known which is located in one consecutive middle block. Also provided is a clear evidence that RSA, can be cryptanalysed in practice.
机构地区 信息工程大学
出处 《信息工程大学学报》 2013年第4期389-392,401,共5页 Journal of Information Engineering University
基金 国家自然科学基金资助项目(61003291)
关键词 RSA小指数攻击 私钥泄漏攻击 大整数分解 格基约化 LLL算法 low exponent private key exposure factorization lattice reduction LLL
  • 相关文献

参考文献9

  • 1Coppersmith D. Small solutions to polynomial equations, and low exponent RSA vulnerabilities [ J]. Journal of Cryptology, 1997, 10(4) : 233-260.
  • 2Coron J. Finding small roots of bivariate integer polynomial equations revisited[ C]//Advances in Cryptology-EUROCRYPT 2004.2004:492-505.
  • 3Boneh D, Duffee G. Cryptanalysis of RSA with private key d less than N:'292[j].In:rmation Theory, IEEE Transactions on, 2000, 46(4): 1339-1349.
  • 4Sarkar S, Maitra S, Sarkar S. RSA cryptanalysis with increased bounds on the secret exponent using less lattice dimension [ R]. IACR ePrint Archive: Report, 2008.
  • 5Chang L, Chi Y. Factoring RSA modulo N with high bits of p known revisited: IT in Medicine & Education, ITIME'09. IEEE International Symposium on[ Z]. IEEE, 2009 : 1, 495-500.
  • 6Herrmann M, May A. Solving linear equations modulo divisors : On factoring given any bits [ C ]//Advances in Cryptology-ASl- ACRYPT 2008. 2008 : 406-424.
  • 7Grfitschel M, Lov:sz L, Schrijver A. Geometric algorithm and combinatorial optimization[ M ]. Berlin: Springer-Verlag, 1993.
  • 8Lenstra A K, Lenstra H W, Lov6sz L. Factoring polynomials with rational coefficients [ J]. Mathematiche Annalen, 1982, 261 : 515-534.
  • 9Jochemsz E. Cryptanalysis of RSA Variants Using Small Roots of Polynomials[ D ]. Tchnische Universiteit Eindhoven, 2007.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部