ANOTHER PROOF OF WIENER'S SHORT SECRET EXPONENT
Muhammad Asyraf Asbullah, Muhammad Rezal Kamel Ariffin · Malaysian Journal of Science · 2019
Wiener’s short secret exponent attack is a well-known crypt-analytical result upon the RSA cryptosystem using a Diophantine’s method called continued fractions. We recall that Wiener’s attack works efficiently on RSA with the condition that the secret exponent . Later, the upper bound was improved satisfying . In this work, we present another proof to Wiener’s short secret exponent satisfying . We remark that our result is slightly better than the previously mentioned attacks.