Sciweavers

363 search results - page 1 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
CALC
2001
Springer
201views Cryptology» more  CALC 2001»
13 years 9 months ago
Finding Small Solutions to Small Degree Polynomials
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 fi...
Don Coppersmith
EUROCRYPT
2005
Springer
13 years 10 months ago
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
Johannes Blömer, Alexander May
JSC
2010
79views more  JSC 2010»
13 years 3 months ago
Approximate polynomial GCD: Small degree and small height perturbations
Joachim von zur Gathen, Maurice Mignotte, Igor Shp...
MOC
1998
74views more  MOC 1998»
13 years 4 months ago
Diameters of complete sets of conjugate algebraic integers of small degree
We give bounds for the coefficients of a polynomial as functions of the diameter of its roots, hence we obtain polynomials with minimal diameters and small degree
Michel Grandcolas
TC
2002
13 years 4 months ago
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show ...
Zeljko Zilic, Zvonko G. Vranesic