25 search results - page 1 / 5 » A variant of Wiener's attack on RSA |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
PKC
2005
Springer
13 years 10 months ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
At Asiacrypt ’99, Sun, Yang and Laih proposed three RSA variants with short secret exponent that resisted all known attacks, including the recent Boneh-Durfee attack from Eurocry...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Wiener’s famous attack on RSA with d < N0.25 shows that using a small d for an efficient decryption process makes RSA completely insecure. As an alternative, Wiener proposed t...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...