Cryptanalysis of RSA with private key d less than N/sup 0.292/
作者： D. Boneh , G. Durfee
DOI: 10.1109/18.850673
关键词:
摘要: … is the product of two -bit primes. For simplicity, we assume … We are interested in finding a low-norm integer linear combination of the polynomials … that give rise to polynomials …
acm.org 
sci-hub.se 参考文章(13)
D. Bleichenbacher, On the Security of the KMOV Public Key Cryptosystem international cryptology conference. pp. 235- 248 ,(1997) , 10.1007/BFB0052239
Charanjit S. Jutla, On finding small solutions of modular multivariate polynomial equations theory and application of cryptographic techniques. pp. 158- 170 ,(1998) , 10.1007/BFB0054124
Nicholas Howgrave-Graham, Finding Small Roots of Univariate Modular Equations Revisited Lecture Notes in Computer Science. pp. 131- 142 ,(1997) , 10.1007/BFB0024458
Dan Boneh, Glenn Durfee, Cryptanalysis of RSA with private key d less than N 0:292 theory and application of cryptographic techniques. pp. 1- 11 ,(1999) , 10.1007/3-540-48910-X_1
László Lovász, An algorithmic theory of numbers, graphs, and convexity ,(1986)
Antoine Joux, Jacques Stern, Lattice Reduction: A Toolbox for the Cryptanalyst Journal of Cryptology. ,vol. 11, pp. 161- 185 ,(1998) , 10.1007/S001459900042
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 26, pp. 96- 99 ,(1983) , 10.1145/357980.358017
Johan Hastad, Solving simultaneous modular equations of low degree SIAM Journal on Computing. ,vol. 17, pp. 336- 341 ,(1988) , 10.1137/0217019
Don Coppersmith, Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities Journal of Cryptology. ,vol. 10, pp. 233- 260 ,(1997) , 10.1007/S001459900030
Eric R. Verheul, Henk C. A. van Tilborg, Cryptanalysis of 'less short' RSA secret exponents Applicable Algebra in Engineering, Communication and Computing. ,vol. 8, pp. 425- 435 ,(1997) , 10.1007/S002000050082