A tool kit for finding small roots of bivariate polynomials over the integers

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 251-267

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

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Coppersmith's method; RSA; Univariate vs. Bivariate

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; CRYPTOGRAPHY; INTEGER PROGRAMMING;

BIVARIATE POLYNOMIALS; COPPERSMITH'S METHOD; RSA; UNIVARIATE VS. BIVARIATE;

POLYNOMIAL APPROXIMATION;

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

References (15)

1. J. Blömer, A. May, "New Partial Key Exposure Attacks on RSA", Advances in Cryptology - Crypto 2003, Lecture Notes in Computer Science Vol. 2729, pp. 27-43, Springer-Verlag, 2003
2. D. Boneh, "Simplified OAEP for the RSA and Rabin Functions", Advances in Cryptology - Crypto 2001, Lecture Notes in Computer Science Vol. 2139, pp. 275-291, Springer-Verlag, 2001
3. 0.292", IEEE Trans. on Information Theory, Vol. 46(4), pp. 1339-1349, 2000
4. rq for large r", Advances in Cryptology - Crypto '99, Lecture Notes in Computer Science Vol. 1666, Springer-Verlag, pp. 326-337, 1999
5. J.-S. Coron, "Finding Small Roots of Bivariate Integer Polynomial Equations Revisited", Advances in Cryptology - Eurocrypt '04, Lecture Notes in Computer Science Vol. 3027, Springer-Verlag, pp. 492-505, 2004
6. D. Coppersmith, "Finding a Small Root of a Univariate Modular Equation", Advances in Cryptology - Eurocrypt '96, Lecture Notes in Computer Science Vol. 1070, Springer-Verlag, pp. 155-165, 1996
7. D. Coppersmith, "Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known", Advances in Cryptology - Eurocrypt '96, Lecture Notes in Computer Science Vol. 1070, Springer-Verlag, pp. 178-189, 1996
8. D. Coppersmith, "Small solutions to polynomial equations and low exponent vulnerabilities", Journal of Cryptology, Vol. 10(4), pp. 223-260, 1997.
9. D. Coppersmith, "Finding Small Solutions to Small Degree Polynomials", Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in Computer Science Volume 2146, Springer-Verlag, pp. 20-31, 2001.
10. N. Howgrave-Graham, "Finding small roots of univariate modular equations revisited", Proceedings of Cryptography and Coding, Lecture Notes in Computer Science Vol. 1355, Springer-Verlag, pp. 131-142, 1997
11. N. Howgrave-Graham, "Approximate Integer Common Divisors", Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in Computer Science Vol. 2146, Springer-Verlag, pp. 51-66, 2001
12. A. K. Lenstra, H. W. Lenstra, and L. Lovász, "Factoring polynomials with rational coefficients," Mathematische Annalen, Vol. 261, pp. 513-534, 1982
13. A. May, "Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring", Advances in Cryptology - Crypto '04, Lecture Notes in Computer Science Vol. 3152, Springer Verlag, pp. 213-219, 2004
14. rq", Practice and Theory in Public Key Cryptography - PKC 2004, Lecture Notes in Computer Science Vol. 2947, Springer-Verlag, pp. 218-230, 2004
15. V. Shoup, "OAEP Reconsidered", Advances in Cryptology - Crypto 2001, Lecture Notes in Computer Science Vol. 2139, Springer-Verlag, pp. 239-259, 1998