Factoring Polynomials over Finite Fields using Balance Test

Details Factoring Polynomials over Finite Fields using Balance Test Factoring Polynomials over Finite Fields using Balance Test

2008-02-20

arxiv.org/abs/0802.2838v1

Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Factoring Polynomials over Finite Fields using Balance Test does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Factoring Polynomials over Finite Fields using Balance Test, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Factoring Polynomials over Finite Fields using Balance Test will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647797