On Wiener's attack on RSA cryptosystem

We propose a modification of Wiener’s attack on the RSA cryptosystem. The algorithm uses only continuous fractions. It's complexity is not greater than $O(d^2 m^{-1/2} \ln m)$, where $m$ is the modulus, $d$ is the secret exponent of RSA.