88 search results - page 1 / 18 » Subquadratic-time factoring of polynomials over finite field... |
FFA
2010
13 years 1 months ago
2010
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
STOC
1995
ACM
13 years 7 months ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
ISSAC
1997
Springer
13 years 8 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
JSC
1998
13 years 4 months ago
1998