Skip to main content
SpringerLink
Log in

Finding Small Solutions to Small Degree Polynomials

  • Conference paper
  • First Online:
Cryptography and Lattices (CaLC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2146))

Included in the following conference series:

Abstract

This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N, and the companion problem of finding a small solution to a bivariate equation over ℤ. We start with the lattice-based approach from [2,3], and speculate on directions for improvement.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dan Boneh, personal communication.

    Google Scholar 

  2. D. Coppersmith, Finding a small root of a univariate modular equation. Advances in Cryptology-EUROCRYPT’96, LNCS 1070, Springer, 1996, 155–165.

    Google Scholar 

  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.

    Google Scholar 

  4. D. Coppersmith, Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Crypt. vol 10 no 4 (Autumn 1997), 233–260.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. Coppersmith, N.A. Howgrave-Graham, S.V. Nagaraj, Divisors in Residue classes—Constructively. Manuscript.

    Google Scholar 

  6. N. Elkies, Rational points near curves and small nonzero |x 3-y2| via lattice reduction, ANTS-4, LNCS vol 1838 (2000) Springer Verlag, 33–63.

    Google Scholar 

  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.

    Google Scholar 

  8. N.A. Howgrave-Graham, Finding small solutions of univariate modular equations revisited. Cryptography and Coding LNCS vol 1355. (1997) Springer-Verlag. 131–142.

    Chapter  Google Scholar 

  9. N.A. Howgrave-Graham, personal communication, 1997.

    Google Scholar 

  10. N.A. Howgrave-Graham, Approximate Integer Common Divisors, This volume, pp. 51–66.

    Google Scholar 

  11. C.S. Jutla, On finding small solutions of modular multivariate polynomial equations, Advances in Cryptology-EUROCRYPT’98, LNCS 1403, Springer, 1998, 158–170.

    Chapter  Google Scholar 

  12. S.V. Konyagin and T. Steger, On polynomial congruences, Mathematical Notes Vol 55 No 6 (1994), 596–600.

    Article  MathSciNet  Google Scholar 

  13. A.K. Lenstra, H.W. Lenstra, and L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.

    Article  MATH  MathSciNet  Google Scholar 

  14. H. W. Lenstra, Jr., “Divisors in Residue Classes,” Mathematics of Computation, volume 42, number 165, January 1984, pages 331–340.

    Article  MATH  MathSciNet  Google Scholar 

  15. H.W. Lenstra, personal communication.

    Google Scholar 

  16. K.L. Manders and L.M. Adleman, NP-Complete Decision Problems for Binary Quadratics. JCSS 16(2), 1978, 168–184.

    MATH  MathSciNet  Google Scholar 

  17. Phong Nguyen, personal communication.

    Google Scholar 

  18. T.J. Rivlin, Chebyshev Polynomials, From Approximation Theory to Algebra and Number Theory, Wiley (1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research, T.J. Watson Research Center, Yorktown Heights, NY, 10598, USA

    Don Coppersmith

Authors
  1. Don Coppersmith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematics Department, Brown University, Box 1917, Providence, RI, 02912, USA

    Joseph H. Silverman

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coppersmith, D. (2001). Finding Small Solutions to Small Degree Polynomials. In: Silverman, J.H. (eds) Cryptography and Lattices. CaLC 2001. Lecture Notes in Computer Science, vol 2146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44670-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-44670-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42488-8

  • Online ISBN: 978-3-540-44670-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation