Finding small solutions to small degree polynomials

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

Volumn 2146, Issue , 2001, Pages 20-31

  Coppersmith, Don ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Lattice reduction; Modular polynomials

Indexed keywords

CRYPTOGRAPHY;

BIVARIATE; LATTICE REDUCTION; LATTICE-BASED; MODULAR POLYNOMIAL; UNIVARIATE;

POLYNOMIALS;

EID: 84958958956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44670-2_3     Document Type: Conference Paper

References (18)

1. Dan Boneh, personal communication.
2. D. Coppersmith, Finding a small root of a univariate modular equation. Advances in Cryptology - EUROCRYPT’96, LNCS 1070, Springer, 1996, 155-165.
3. D. Coppersmith, Finding a small root of a bivariate integer equation; factoring with high bits known, Advances in Cryptology - EUROCRYPT’96, LNCS 1070, Springer, 1996, 178-189.
4. D. Coppersmith, Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Crypt. vol 10 no 4(Autumn 1997), 233-260.
5. D. Coppersmith, N.A. Howgrave-Graham, S.V. Nagaraj, Divisors in Residue classes-Constructively. Manuscript.
6. N. Elkies, Rational points near curves and small nonzero |x3 − y2| via lattice reduction, ANTS-4, LNCS vol 1838 (2000) Springer Verlag, 33-63.
7. J. Håstad, On using RSA with low exponent in a public key network, Advances in Cryptology - CRYPTO’85, LNCS 218, Springer-Verlag, 1986, 403-408.
8. N.A. Howgrave-Graham, Finding small solutions of univariate modular equations revisited. Cryptography and CodingLNCS vol 1355. (1997) Springer-Verlag. 131-142.
9. N.A. Howgrave-Graham, personal communication, 1997.
10. N.A. Howgrave-Graham, Approximate Integer Common Divisors, This volume, pp. 51-66.
11. C.S. Jutla, On finding small solutions of modular multivariate polynomial equations, Advances in Cryptology - EUROCRYPT’98, LNCS 1403, Springer, 1998, 158-170.
12. S.V. Konyagin and T. Steger, On polynomial congruences, Mathematical NotesVol55No 6 (1994), 596-600.
13. A.K. Lenstra, H.W. Lenstra, and L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann.261(1982), 515-534.
14. H.W. Lenstra Jr., “Divisors in Residue Classes,” Mathematics of Computation, volume 42, number 165, January 1984, pages 331-340.
15. H.W. Lenstra, personal communication.
16. K.L. Manders and L.M. Adleman, NP-Complete Decision Problems for Binary Quadratics. JCSS16(2), 1978, 168-184.
17. Phong Nguyen, personal communication.
18. T.J. Rivlin, Chebyshev Polynomials, From Approximation Theory to Algebra and Number Theory, Wiley (1990).