Abstract: The fastest known deterministic algorithms for factorising polynomials in F_p[x] have a worst-case runtime that is exponential in log p. We will discuss a new deterministic algorithm which factorises an integer polynomial modulo many primes simultaneously with amortised runtime that is polynomial in log p. Based on joint work with David Harvey.