Partial key exposure attacks on RSA up to full size exponents

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 371-386

  Ernst, Matthias ^a   Jochemsz, Ellen ^b   May, Alexander ^a   De Weger, Benne ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Coppersmith's method; Cryptanalysis; Lattice reduction; Partial key exposure; RSA

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; POLYNOMIAL APPROXIMATION; SECURITY OF DATA;

COPPERSMITH'S METHOD; CRYPTANALYSIS; LATTICE REDUCTION; PARTIAL KEY EXPOSURE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 24944544867     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_22     Document Type: Conference Paper

References (12)

1. 0.292, IEEE Transactions on Information Theory 46 [2000], 1339-1349.
2. Dan Boneh, Glenn Durfee and Yair Frankel: An Attack on RSA given a Small Fraction of the Private Key Bits, Proceedings of ASIACRYPT 1998, LNCS 1514 [1998], 25-34.
3. Johannes Blömer and Alexander May: New Partial Key Exposure Attacks on RSA, Proceedings of CRYPTO 2003, LNCS 2729 [2003], 27-43.
4. Don Coppersmith: Small Solutions to Polynomial Equations and Low Exponent RSA Vulnerabilities, Journal of Cryptology 10 [1997], 233-260.
5. Jean-Sébastien Coron: Finding Small Roots of Bivariate Integer Equations Revisited, Proceedings of EUROCRYPT 2004, LNCS 3027 [2004], 492-505.
6. Nick Howgrave-Graham: Finding Small Roots of Univariate Modular Equations Revisited, Cryptography and Coding, LNCS 1355 [1997], 131-142.
7. Arjen Lenstra, Hendrik Lenstra, Jr., and László Lovász: Factoring Polynomials with Rational Coefficients, Mathematische Ann. 261 [1982], 513-534.
8. Alexander May: Cryptanalysis of Unbalanced RSA with Small CRT-Exponent, Proceedings of CRYPTO 2002, LNCS 2442 [2002], 242-256.
9. Alexander May: Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring, Proceedings of CRYPTO 2004, LNCS 3152 [2004], 213-219.
10. Victor Shoup: NTL: A Library for doing Number Theory, online available at http://shoup.net/ntl
11. Benne de Weger: Cryptanalysis of RSA with Small Prime Difference, Applicable Algebra in Engineering, Communication and Computing 13 [2002], 17-28.
12. Michael Wiener: Cryptanalysis of Short RSA Secret Exponents, IEEE Transactions on Information Theory 36 [1990], 553-558.