4 search results - page 1 / 1 » From Fixed-Length to Arbitrary-Length RSA Padding Schemes |
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...
CTRSA
2001
Springer
13 years 9 months ago
2001
Springer
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...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...