ANOTHER PROOF OF WIENER'S SHORT SECRET EXPONENT

Authors

  • Muhammad Asyraf Asbullah Institute for Mathematical Research image/svg+xml
  • Muhammad Rezal Kamel Ariffin Institute for Mathematical Research image/svg+xml

DOI:

https://doi.org/10.22452/mjs.sp2019no1.6

Keywords:

RSA cryptosystem, continued fractions, secret exponent, cryptanalysis, Wiener’s theorem

Abstract

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.

Downloads

Published

22-02-2019

Most read articles by the same author(s)