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!
|
| Summary: | 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. |
|---|