Deterministic Analysis of Aleatoric Methods of Polynomial Factorization over Finite Fields Original Research Article

We analyze the problem of finding the roots of an arbitrary polynomial over a finite field (equivalent to factoring an arbitrary polynomial over the field) and propose a deterministic approach which leads to a combinatorial problem whose satisfactory solution would yield a factoring method which is polynomial in the logarithm of the size of the field and the degree of the input polynomial.