Tuning and Generalizing Van Hoeij's Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Tuning and Generalizing Van Hoeij's Algorithm

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.
Fichier principal
Vignette du fichier
RR-4124.pdf (258.32 Ko) Télécharger le fichier

Dates and versions

inria-00072504 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072504 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More