This repo will host implementations of different RSA attacks using lattice reduction techniques (in particular LLL).
First, we'll see how Coppersmith found out that you could use lattice reduction techniques to attack a relaxed RSA (we know parts of the message, or we know parts of one of the prime).
Second we'll see how Boneh and Durfee used coppersmith to factor the RSA modulus under certain assumptions.