230 research outputs found
Factoring Polynomials over Finite Fields using Balance Test
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
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach
Let be a degree- polynomial such that
factorizes into distinct linear factors over
. We study the problem of deterministically factoring over
given . Under the generalized Riemann hypothesis
(GRH), we give an improved deterministic algorithm that computes the complete
factorization of in the case that the Galois group of is
(permutation isomorphic to) a linear group on the set
of roots of , where is a finite-dimensional vector space
over a finite field and is identified with a subset of . In
particular, when , the algorithm runs in time polynomial
in and the size of the input, improving
Evdokimov's algorithm. Our result also applies to a general Galois group
when combined with a recent algorithm of the author.
To prove our main result, we introduce a family of objects called linear
-schemes and reduce the problem of factoring to a combinatorial
problem about these objects. We then apply techniques from additive
combinatorics to obtain an improved bound. Our techniques may be of independent
interest.Comment: To be published in the proceedings of MFCS 202
Maps between curves and arithmetic obstructions
Let X and Y be curves over a finite field. In this article we explore methods
to determine whether there is a rational map from Y to X by considering
L-functions of certain covers of X and Y and propose a specific family of
covers to address the special case of determining when X and Y are isomorphic.
We also discuss an application to factoring polynomials over finite fields.Comment: 8 page
- …