97 search results - page 2 / 20 » Finding roots of polynomials over finite fields |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
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...
STOC
1995
ACM
13 years 8 months ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
ARITH
2009
IEEE
13 years 11 months ago
2009
IEEE
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation a...
TC
2002
13 years 4 months ago
2002
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 ...