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: | , |
---|---|
格式: | Article |
語言: | English |
出版: |
University of Malaya
2019
|
在線閱讀: | 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 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|