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.
CITATION STYLE
Klüners, J. (2010). The van Hoeij algorithm for factoring polynomials. In Information Security and Cryptography (Vol. 10, pp. 283–291). Springer International Publishing. https://doi.org/10.1007/978-3-642-02295-1_8
Mendeley helps you to discover research relevant for your work.