A new efficient factorization algorithm for polynomials over small finite fields

  • Harald Niederreiter
Article

DOI: 10.1007/BF01386831

Cite this article as:
Niederreiter, H. AAECC (1993) 4: 81. doi:10.1007/BF01386831

Abstract

We present a new deterministic factorization algorithm for polynomials over a finite prime fieldFp. As in other factorization algorithms for polynomials over finite fields such as the Berlekamp algorithm, the key step is the “linearization” of the factorization problem, i.e., the reduction of the problem to a system of linear equations. The theoretical justification for our algorithm is based on a study of the differential equationy(p−1)+yp=0 of orderp−1 in the rational function fieldFp(x). In the casep=2 the new algorithm is more efficient than the Berlekamp algorithm since there is no set-up cost for the coefficient matrix of the system of linear equations.

Keywords

Factorization of polynomials over finite fields Differential equations over rational function fields 

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Harald Niederreiter
    • 1
  1. 1.Institute for Information ProcessingAustrian Academy of SciencesViennaAustria