5 search results - page 1 / 1 » Factoring RSA Modulus Using Prime Reconstruction from Random... |
AFRICACRYPT
2010
Springer
13 years 10 months ago
2010
Springer
CHES
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
CHES
2009
Springer
14 years 5 months ago
2009
Springer
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
ASIACRYPT
2003
Springer
13 years 10 months ago
2003
Springer
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...