Tuning and Generalizing Van Hoeij's Algorithm

Karim Belabas Guillaume Hanrot 1 Paul Zimmermann 1
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Recently, van Hoeij's published a new algorithm for factoring polynomials over the rational integers [11]. This algorithms rests on the same principle as Berlekamp-Zassenhaus [2, 13], but uses lattice basis reduction to improve drastically on the recombination phase. The efficiency of the LLL algorithm is very dependent on fine tuning; in this paper, we present such tuning to achieve better performance. Simultaneously, we describe a generalization of van Hoeij's algorithm to factor polynomials over number fields.
Document type :
Complete list of metadatas

Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:08:51 AM
Last modification on : Thursday, January 11, 2018 - 6:20:00 AM
Long-term archiving on : Sunday, April 4, 2010 - 11:10:41 PM


  • HAL Id : inria-00072504, version 1



Karim Belabas, Guillaume Hanrot, Paul Zimmermann. Tuning and Generalizing Van Hoeij's Algorithm. [Research Report] RR-4124, INRIA. 2001. ⟨inria-00072504⟩



Record views


Files downloads