22 search results - page 2 / 5 » Factorization of a 768-Bit RSA Modulus |
EUROCRYPT
2000
Springer
13 years 9 months ago
2000
Springer
IJNSEC
2008
13 years 5 months ago
2008
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
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...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
We show that a generic ring algorithm for breaking RSA in ZN can be converted into an algorithm for factoring the corresponding RSA-modulus N. Our results imply that any attempt at...
CHES
2011
Springer
12 years 5 months ago
2011
Springer
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...