278 search results - page 10 / 56 » On the Security of RSA Padding |
PKC
2005
Springer
15 years 3 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...
SYNASC
2007
IEEE
15 years 4 months ago
2007
IEEE
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
INFORMATICALT
2006
14 years 9 months ago
2006
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
ACSAC
2000
IEEE
15 years 2 months ago
2000
IEEE
We present a new commerce protocol that allows customers and merchants to conduct face-to-face creditcard authorizations with a credit card company securely with the option of ano...
63
Voted
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...