Generalization of Boneh- Durfee's Attack for Arbitrary Public Exponent RSA
Lattice is a discrete subset of Rn. It has found many applications in various fields like the geometry of numbers, integer relations and diophantine approximations and notably in cryptology. In 2000, Boneh-Durfee extended the bound for low private exponent from 0.25 (provided by wiener) to 0.292 with public exponent size is same as modulus size. They have used powerful lattice reduction algorithm Lenstra - Lenstra -Lovasz (LLL) with coppersmith's theory of polynomials. In this paper, the authors generalize their attack to arbitrary public exponent.