UPM Institutional Repository

Another proof of wiener's short secret exponent


Citation

Asbullah, Muhammad Asyraf and Kamel Ariffin, Muhammad Rezal (2019) Another proof of wiener's short secret exponent. Malaysian Journal of Science, 1. pp. 67-73. ISSN 1394-3065; ESSN: 2600-8688

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 d<13N14. Later, the upper bound was improved satisfying푑<√6√26푁14. In this work, we present another proof to Wiener’s short secret exponent satisfying푑<12푁14. We remark that our result is slightly better than the previously mentioned attacks.


Download File

[img] Text (Abstract)
RSA.pdf

Download (100kB)
Official URL or Download Paper: https://mjs.um.edu.my/article/view/14302/9914

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
DOI Number: https://doi.org/10.22452/mjs.sp2019no1.6
Publisher: University of Malaya
Keywords: RSA cryptosystem; Continued fractions; Secret exponent; Cryptanalysis; Wiener’s theorem
Depositing User: Ms. Nuraida Ibrahim
Date Deposited: 04 Nov 2020 20:18
Last Modified: 04 Nov 2020 20:18
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.22452/mjs.sp2019no1.6
URI: http://psasir.upm.edu.my/id/eprint/80653
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item