Abstract
In this survey, we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial problem that occurs in the Zassenhaus algorithm is reduced to a very special knapsack problem. In case of rational polynomials, this knapsack problem can be very efficiently solved by the LLL algorithm. This gives a polynomial time algorithm, which also works very well in practice.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Zassenhaus, On Hensel factorization I, Journal of Number Theory, 1, 291–311 (1969)
A. K. Lenstra, H. W. Lenstra, Jr. and L. Lovász, Factoring polynomials with rational coefficients, Annals of Mathematics, 261(4), 515–534 (1982)
M. van Hoeij, Factoring polynomials and the knapsack problem, Journal of Number Theory, 95, 167–189 (2002)
K. Belabas, M. van Hoeij, J. Klüners and A. Steel, Factoring polynomials over global fields, Journal de théorie des nombres de Bordeaux, 21(1), 15–39 (2009)
J. von zur Gathen and J. Gerhard, Modern Computer Algebra. Cambridge University Press (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Klüners, J. (2009). The van Hoeij Algorithm for Factoring Polynomials. In: Nguyen, P., Vallée, B. (eds) The LLL Algorithm. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02295-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-02295-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02294-4
Online ISBN: 978-3-642-02295-1
eBook Packages: Computer ScienceComputer Science (R0)