Twenty five years ago, Lenstra, Lenstra and Lovász presented their celebrated LLL lattice reduction algorithm. Among the various applications of the LLL algorithm is a method due to Coppersmith for finding small roots of polynomial equations. We give a survey of the applications of this root finding method to the problem of inverting the RSA function and the factorization problem. As we will see, most of the results are of a dual nature, they can either be interpreted as cryptanalytic results or as hardness/security results.
CITATION STYLE
May, A. (2010). Using LLL-reduction for solving RSA and factorization problems. In Information Security and Cryptography (Vol. 10, pp. 315–348). Springer International Publishing. https://doi.org/10.1007/978-3-642-02295-1_10
Mendeley helps you to discover research relevant for your work.