Sciweavers

33 search results - page 7 / 7
» Algorithms for Modular Counting of Roots of Multivariate Pol...
Sort
View
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...
CRYPTO
2003
Springer
137views Cryptology» more  CRYPTO 2003»
13 years 11 months ago
New Partial Key Exposure Attacks on RSA
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...
Johannes Blömer, Alexander May
FOCS
2000
IEEE
13 years 10 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan