A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Factoring Polynomials over Finite Fields using Balance Test
2008
Symposium on Theoretical Aspects of Computer Science
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 algorithm that fails to factor only if the input polynomial satisfies a strong symmetry property, namely square balance. In this paper, we propose an extension of Gao's algorithm that fails only under an even stronger symmetry property. We also show that our property can be used to improve the time complexity of best
doi:10.4230/lipics.stacs.2008.1323
dblp:conf/stacs/Saha08
fatcat:ql6bw57qqzdytorryuzw37olju