278 search results - page 4 / 56 » On the Security of RSA Padding |
ACISP
2009
Springer
14 years 2 months ago
2009
Springer
IWSEC
2010
Springer
13 years 6 months ago
2010
Springer
In the perspective of RSA, given small encryption exponent e (e.g., e = 216 + 1), the top half of the decryption exponent d can be narrowed down within a small search space. This f...
CCS
1999
ACM
13 years 11 months ago
1999
ACM
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
PKC
2005
Springer
14 years 29 days 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...
ACISP
2010
Springer
13 years 9 months ago
2010
Springer
