Elsevier

Journal of Symbolic Computation

Volume 42, Issues 1–2, January–February 2007, Pages 159-177
Journal of Symbolic Computation

Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields

https://doi.org/10.1016/j.jsc.2006.02.007Get rights and content
Under an Elsevier user license
open archive

Abstract

A new deterministic algorithm for factoring polynomials over finite fields is presented. This algorithm makes use of linear algebra methods and is an improvement of the Berlekamp algorithm, as well as that of Niederreiter, in the case of nontrivial algebraic extensions. The improvement is achieved by a new method of computing a basis of the so-called Berlekamp primitive subalgebra that makes use of an idea related to the field of Gröbner bases. Finally, some comparative running times show how this new deterministic algorithm performs better than other probabilistic algorithms in some practical cases.

Keywords

Deterministic algorithms
Finite fields
Polynomial factorization
Berlekamp
Niederreiter

Cited by (0)