A fast algorithm for polynomial factorization over
David Ford, Sebastian Pauli, Xavier-François Roblot (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
We present an algorithm that returns a proper factor of a polynomial over the -adic integers (if is reducible over ) or returns a power basis of the ring of integers of (if is irreducible over ). Our algorithm is based on the Round Four maximal order algorithm. Experimental results show that the new algorithm is considerably faster than the Round Four algorithm.