Polynomial Factoring Algorithms and their Computational Complexity

An efficient algorithm for factoring polynomials over the integers that circumvents the shortest vector requirement via an approximate solution, the LLL lattice basis reduction algorithm.