Displaying similar documents to “A polynomial reduction algorithm”

A fast algorithm for polynomial factorization over p

David Ford, Sebastian Pauli, Xavier-François Roblot (2002)

Journal de théorie des nombres de Bordeaux


We present an algorithm that returns a proper factor of a polynomial Φ ( x ) over the p -adic integers p (if Φ ( x ) is reducible over p ) or returns a power basis of the ring of integers of p [ x ] / Φ ( x ) p [ x ] (if Φ ( x ) is irreducible over p ). 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.

Improvements on the Cantor-Zassenhaus factorization algorithm

Michele Elia, Davide Schipani (2015)

Mathematica Bohemica


The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on the performances, and proposing useful improvements. In particular, a new simplified version of this algorithm is described, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed...