## Using LLL-Reduction for Solving RSA and Factorization Problems: A Survey (2007)

by
Alexander May

Citations: | 16 - 0 self |

### BibTeX

@MISC{May07usinglll-reduction,

author = {Alexander May},

title = {Using LLL-Reduction for Solving RSA and Factorization Problems: A Survey},

year = {2007}

}

### OpenURL

### Abstract

25 years ago, Lenstra, Lenstra and Lovasz 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.