Another Proof Of Wiener's Short Secret Exponent
MA Asbullah, MRK Ariffin - Malaysian Journal of Science, 2019 - mjs.um.edu.my
Malaysian Journal of Science, 2019•mjs.um.edu.my
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.
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.
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.
mjs.um.edu.my
以上显示的是最相近的搜索结果。 查看全部搜索结果