Abstract: 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) ...

Abstract: In this article, we discuss the current status of polynomial factoring (root finding) algorithms with some historical and mathematical background including size limits, convergence, accuracy ...

The basic facts about separable extensions of discrete fields and factoring polynomials are developed in the constructive spirit of Errett Bishop. The ability to factor polynomials is shown to be ...