Abstract
Purchase PDF (333 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (529 K)
) is ((
doi:10.1016/j.jsc.2006.02.007 
Copyright © 2006 Elsevier Ltd All rights reserved.
Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
Giulio Genovesea, 
Received 4 November 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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
