71 search results - page 1 / 15 » Public Key Perturbation of Randomized RSA Implementations |
CHES
2010
Springer
14 years 10 months ago
2010
Springer
CHES
2006
Springer
15 years 1 months ago
2006
Springer
It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault induc...
104
click to vote
BIRTHDAY
2012
Springer
13 years 5 months ago
2012
Springer
Finding efficient countermeasures for cryptosystems against fault attacks is challenged by a constant discovery of flaws in designs. Even elements, such as public keys, that do no...
CHES
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we present a new attack on RSA when the public exponent is short, for instance 3 or 216 +1, and when the classical exponent randomization is used. This attack works ...
NDSS
1999
IEEE
15 years 1 months ago
1999
IEEE
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved...