Skip to main content
Conference Proceedings

Finding small solutions to small degree polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2146 20-31
DOI: 10.1007/3-540-44670-2_3
64Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

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 Z.We start with the lattice-based approach from [2,3], and speculate on directions for improvement.

Author supplied keywords

Cite

CITATION STYLE

APA

Coppersmith, D. (2001). Finding small solutions to small degree polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2146, pp. 20–31). Springer Verlag. https://doi.org/10.1007/3-540-44670-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free