Another proof of wiener's short secret exponent
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Malaya
2019
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/80653/1/RSA.pdf http://psasir.upm.edu.my/id/eprint/80653/ https://mjs.um.edu.my/article/view/14302/9914 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
my.upm.eprints.80653 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.806532020-11-04T20:18:16Z http://psasir.upm.edu.my/id/eprint/80653/ Another proof of wiener's short secret exponent Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal 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. University of Malaya 2019 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/80653/1/RSA.pdf 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 https://mjs.um.edu.my/article/view/14302/9914 10.22452/mjs.sp2019no1.6 |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| language |
English |
| description |
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. |
| format |
Article |
| author |
Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal |
| spellingShingle |
Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal Another proof of wiener's short secret exponent |
| author_facet |
Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal |
| author_sort |
Asbullah, Muhammad Asyraf |
| title |
Another proof of wiener's short secret exponent |
| title_short |
Another proof of wiener's short secret exponent |
| title_full |
Another proof of wiener's short secret exponent |
| title_fullStr |
Another proof of wiener's short secret exponent |
| title_full_unstemmed |
Another proof of wiener's short secret exponent |
| title_sort |
another proof of wiener's short secret exponent |
| publisher |
University of Malaya |
| publishDate |
2019 |
| url |
http://psasir.upm.edu.my/id/eprint/80653/1/RSA.pdf http://psasir.upm.edu.my/id/eprint/80653/ https://mjs.um.edu.my/article/view/14302/9914 |
| _version_ |
1683232236623626240 |
| score |
13.188404 |