Deterministic Analysis of Aleatoric Methods of Polynomial Factorization over Finite Fields

Factoring Polynomials Over Finite Fields: A Survey

“…Deterministic algorithms are given in McEliece (1969);Camion (1983a); Menezes et al (1988);Niederreiter (1993a,b); Rothstein and Zassenhaus (1994), and von zur Gathen and Shoup (1992, Section 9). The latter paper gives the currently fastest algorithm with O˜(n 2 + n 3/2 k + n 3/2 k 1/2 p 1/2 ) operations in F q , where q = p k .…”