How to find $d$ with large $e$ ? If $(3\cdot d)^4 \le n$ : Wiener attacks, so what if $(3\cdot d)^4 > n$ ?
Asked
Active
Viewed 112 times
2
-
1Wiener's bound has been slightly improved, see the links at the beginning in this old answer I made to a related question. I've not reviewed the status of the problem in a long time. A classical result is Dan Boneh and Glenn Durfee's Cryptanalysis of RSA with Private Key $d$ Less than $N^{0.292}$, in proceedings of Eurocrypt 1999. – fgrieu May 27 '21 at 10:18