3 search results - page 1 / 1 » Cryptanalysis of the RSA Schemes with Short Secret Exponent ... |
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...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...