Factoring Polynomials Over Finite Fields
Elwyn R. Berlekamp · Bell System Technical Journal · 1967
We present here an algorithm for factoring a given polynomial over GF(q) into powers of irreducible polynomials. The method reduces the factorization of a polynomial of degree m over GF(q) to the solution of about m(q − 1)/q linear equations in as many unknowns over GF(q).