2026-07-21T14:19:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1323 2024-03-06T10:33:02Z ddc:004 open_access

Factoring Polynomials over Finite Fields using Balance Test Saha, Chandan Algebraic Algorithms polynomial factorization finite fields We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Chandan Saha 2008 Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2008.1323 urn:nbn:de:0030-drops-13233 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1323 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode