Factorization of polynomials over finite fields

Known as: Factoring polynomials over finite fields, Polynomial factorization over finite fields, Distinct degree factorization

In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q…

2016

The fundamental theorem of algebra states that every non-constant polynomial with complex coefficients can be factorized on…

2011

We consider the deterministic complexity of the problem of polynomial factorization over finite fields given a finite field Fq…

2007

Atkin's algorithm [11] requires nding roots of polynomials modulo large primes (several hundreds decimal digits). However, the…

2003

A probabilistic algorithm for factoring univariate polynomials over finite fields is presented.To factor a polynomial of degree n…

1997

1997

We generalise the Cantor-Zassenhaus algorithm for factoring polynomials over finite fields. The generalisation yields a class of…

1997

The factorization of polynomials over finite fields is considered. A new deterministic algorithm is proposed that solves the…

1996

We relate the arithmetic straight-line complexity over a field GF(p) (p is a prime) of the parity function l p to the Boolean…

1981

Let f(x) be a polynomial over a finite field F. An algorithm for determining the degrees of the factors of f(x) is presented. As…