Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

211

CALC
2001
Springer

201views Cryptology» more CALC 2001»

Finding Small Solutions to Small Degree Polynomials

15 years 10 months ago

Finding Small Solutions to Small Degree Polynomials

Download cr.yp.to

Abstract. This talk is a brief survey of recent results and ideas concerning the problem of ﬁnding a small root of a univariate polynomial mod N, and the companion problem of ﬁnding 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.

Don Coppersmith

Real-time Traffic

Bivariate Equation | CALC 2001 | Companion Problem | Cryptology | Univariate Polynomial Mod |

claim paper

Related Content

» A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers

» Approximate polynomial GCD Small degree and small height perturbations

» Diameters of complete sets of conjugate algebraic integers of small degree

» A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields

» Real algebraic numbers and polynomial systems of small degree

» The Sum of d SmallBias Generators Fools Polynomials of Degree d

» Distribution of irreducible polynomials of small degrees over finite fields

» Small Sample Spaces Cannot Fool Low Degree Polynomials

» Finding Small Roots of Bivariate Integer Polynomial Equations Revisited

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CALC
Authors	Don Coppersmith

Comments (0)