Sciweavers

20 search results - page 3 / 4
» Factorization of a 512-Bit RSA Modulus
Sort
View
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
14 years 17 days ago
Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
Abstract. Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other tech...
Matthieu Rivain
EUROCRYPT
2005
Springer
13 years 11 months ago
Partial Key Exposure Attacks on RSA up to Full Size Exponents
We present several attacks on RSA that factor the modulus in polynomial time under the condition that a fraction of the most significant bits or least significant bits of the pri...
Matthias Ernst, Ellen Jochemsz, Alexander May, Ben...
CHES
2009
Springer
141views Cryptology» more  CHES 2009»
14 years 6 months ago
Fault Attacks on RSA Signatures with Partially Unknown Messages
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...
Jean-Sébastien Coron, Antoine Joux, Ilya Ki...
CHES
2011
Springer
271views Cryptology» more  CHES 2011»
12 years 5 months ago
Modulus Fault Attacks against RSA-CRT Signatures
RSA-CRT fault attacks have been an active research area since their discovery by Boneh, DeMillo and Lipton in 1997. We present alternative key-recovery attacks on RSA-CRT signature...
Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi...
PODC
2003
ACM
13 years 11 months ago
An asynchronous protocol for distributed computation of RSA inverses and its applications
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
Christian Cachin