Algorithmic Number Theory

Volume 6197 of the series Lecture Notes in Computer Science pp 301-315

Factoring Polynomials over Local Fields II

  • Sebastian PauliAffiliated withDepartment of Mathematics and Statistics, University of North Carolina at Greensboro

* Final gross prices may vary according to local VAT.

Get Access


We present an algorithm for factoring polynomials over local fields, in which the Montes algorithm is combined with elements from Zassenhaus Round Four algorithm. This algorithm avoids the computation of characteristic polynomials and the resulting precision problems that occur in the Round Four algorithm.