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: | Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal |
---|---|
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!
|
Similar Items
-
Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis
by: Wan Mohd Ruzai, Wan Nur Aqlili, et al.
Published: (2022) -
Modified Baptista type cryptosystem via matrix secret key.
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2008) -
Autoregressive Wiener filtering in a scanning electron microscopy imaging system
by: Kamel , Nidal
Published: (2005) -
A new CCA-secure encryption based on the Gap Hashed Diffie-Hellman problem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2013) -
A proposed CCA-secure encryption on an ElGamal variant
by: Asbullah, Muhammad Asyraf, et al.
Published: (2012)