Factoring polynomials by computing 0-1-vectors with lattice reduction.

Mark van Hoeij, Florida State University

The topic of the talk is an algorithm that uses lattice reduction to
handle the combinatorial problem in the factoring algorithm of Zassenhaus.
Contrary to Lenstra, Lenstra and Lovasz, the lattice reduction is not
used to calculate coefficients of a factor but is only used to solve the
combinatorial problem, which is a problem with much smaller coefficients
and dimension. The factors are then constructed efficiently in the same
way as in Zassenhaus' algorithm.