On the heuristic guess of 2-dimension lattice attack on low private exponent RSA

Abstract

In two dimension lattice attack on low private exponent RSA cryptosystem, the reasonable  and non-provable guess shows that the private exponent d could be recovered by finding a shortest vector of a 2-dimension lattice by Gaussian reduction algorithm. The paper considers the determination of the attack by giving a precise interval of private d where the heuristic guess in 2-dimension lattice attack on RSA holds and gives a proof for that heuristic guess.