Modular Las Vegas algorithms for polynomial absolute factorization

Let f (X, Y) is an element of Z[X, Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope off, or more precisely, off modulo some prime integer p. The same idea of choosing a p satisfying some prescribed properties together with LLL is used to provide a new strategy for absolute factorization of f (X, Y). We present our approach in the bivariate case but the techniques extend to the multivariate case. Maple computations show that it is efficient and promising as we are able to construct the algebraic extension containing one absolute factor of a polynomial of degree up to 400. (C) 2010 Elsevier Ltd. All rights reserved.