2 search results - page 1 / 1 » Publishing Upper Half of RSA Decryption Exponent |
79
Voted
IWSEC
2010
Springer
14 years 8 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...
CRYPTO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...