Factoring Polynomials Over Local Fields

We describe an efficient new algorithm for factoring a polynomial Φ(x) over a fieldkthat is complete with respect to a discrete prime divisor. For every irreducible factor (x) of Φ(x) this algorithm returns an integral basis fork[ x ] / (x)k[ x ] overk.