A variant of Wiener's attack on RSA (Q2390948)

The author presents a variant of Weiner's well-known attack on the RSA cipher. The attack uses continued fractions and searches up to a certain bound for candidates for the secret key. The searching phase of the variant attack is significantly faster than that of Weiner. and works efficiently up to a secret decryption exponent key \(d<10^{30}\sqrt[4]{n}\) where \(n\) is the RSA modulus.