Another proof of wiener's short secret exponent

• المؤلفون الرئيسيون: Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal
• التنسيق: مقال
• اللغة: 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

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...