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