Univariate polynomial factorization over finite fields (Q1127311): Difference between revisions

This paper is a tutorial introduction to univariate polynomial factorization over finite fields. The authors recall the classical methods that induced most factorization algorithms (Berlekamp's and the Cantor-Zassenhaus ones) and some refinements which can be applied to these methods. Explicit algorithms are presented in a form suitable for almost immediate implementation. They give a detailed description of an efficient implementation of the Cantor-Zassenhaus algorithm used in the release 2 of the Axiom computer algebra system.