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 ...

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

Add a description, image, and links to the factoring-polynomials topic page so that developers can more easily learn about it.