Paper Info
Title
Factoring Polynomials over Finite Fields using Balance Test
Abstract
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERE), 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 deterministic algorithms on most input polynomials. The property also yields a new randomized polynomial time algorithm.
Year
DOI
Venue
2008
10.4230/LIPIcs.STACS.2008.1323
STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
Keywords
DocType
Volume
time complexity,finite field,polynomial factorization,riemann hypothesis
Conference
abs/0802.2838
ISSN
Citations 
PageRank 
Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)
1
0.36
References 
Authors
1
1
Name
Order
Citations
PageRank
Chandan Saha122716.91