New partial key exposure attacks on RSA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2729, Issue , 2003, Pages 27-43

  Blömer, Johannes ^a   May, Alexander ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Coppersmith's method; Known bits; Lattice reduction; RSA

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; FACTORIZATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SMART CARDS;

LATTICE REDUCTION; LEAST SIGNIFICANT BITS; MULTIVARIATE POLYNOMIAL; POLYNOMIAL-TIME ALGORITHMS; POLYNOMIAL-TIME ATTACKS; RSA; S-METHOD; TIME-CRITICAL APPLICATIONS;

SIDE CHANNEL ATTACK;

EID: 35248863066     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_2     Document Type: Article

References (21)

1. D. Bleichenbacher, "On the Security of the KMOV public key cryptosystem", Advances in Cryptology - Crypto '97, Lecture Notes in Computer Science vol. 1294. Springer-Verlag, pp. 235-248, 1997
2. J. Blömer, "Closest vectors, successive minima, and dual HKZ-bases of lattices", Proc. of 17th ICALP, Lecture Notes in Computer Science 1853, pp. 248-259, 2000.
3. 0.292", IEEE Trans. on Information Theory vol. 46(4), 2000
4. D. Boneh, G. Durfee, Y. Frankel, "An attack on RSA given a small fraction of the private key bits", Advances in Cryptology - AsiaCrypt '98, Lecture Notes in Computer Science vol. 1514, Springer-Verlag, pp. 25-34, 1998
5. ∼dabo/abstracts/bits_of_d.html, 1998
6. D. Boneh, R. DeMillo, R. Lipton, "On the importance of checking cryptographic protocols for faults", Advances in Cryptology - Eurocrypt'97, Lecture Notes in Computer Science vol. 1233, Springer-Verlag, pp. 37-51, 1997.
7. H. Cohen, "A Course in Computational Algebraic Number Theory", Springer-Verlag, 1996
8. D. Coppersmith, "Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities", Journal of Cryptology 10(4), 1997
9. J. F. Dhem, F. Koeune, P. A. Leroux, P. Mestre, J. J. Quisquater, and J. L. Willems, "A practical implementation of the timing attack", In Proc. of CARDIS 98 - Third smart card research and advanced application conference, 1998
10. G. Durfee, P. Nguyen, "Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99", Advances in Cryptology - Asiacrypt 2000, Lecture Notes in Computer Science vol. 1976, Springer, pp. 14-29, 2000
11. M. Gruber, C.G. Lekkerkerker, "Geometry of Numbers", North-Holland, 1987
12. N. Howgrave-Graham, "Finding small roots of univariate modular equations revisited" , Proc. of Cryptography and Coding, Lecture Notes in Computer Science 1355, Springer-Verlag, 1997
13. N. Howgrave-Graham, "Approximate Integer Common Divisors", CaLC 2001, Lecture Notes in Computer Science vol. 2146, pp. 51-66, 2001
14. C. Jutla, "On finding small solutions of modular multivariate polynomial equations", Advances in Cryptology - Eurocrypt '98, Lecture Notes in Computer Science vol. 1403, pp. 158-170, 1998
15. P. Kocher, "Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems", Advances in Cryptology - Crypto '96, Lecture Notes in Computer Science vol. 1109, pp. 104-113, 1996
16. P. Kocher, J. Jaffe and B. Jun, "Differential power analysis", Advances in Cryptology - CRYPTO '99, Lecture Notes in Computer Science vol. 1666, pp. 388-397, 1999
17. A. Lenstra, H. Lenstra and L. Lovász, "Factoring polynomials with rational coefficients"', Mathematische Annalen, 1982
18. L. Lovász, "An Algorithmic Theory of Numbers, Graphs and Convexity", Conference Series in Applied Mathematics, SIAM, 1986
19. V. Shoup, NTL: A Library for doing Number Theory, online available at http://www.shoup.net/ntl/index.html
20. kq", Advances in Cryptology - Crypto '98, Lecture Notes in Computer Science vol. 1462, pp. 318-326, 1998
21. J.-J. Quisquater, C. Couvreur, "Fast decipherment algorithm for RSA public-key cryptosystem", Electronic Letters 18, pp. 905-907, 1982