14 search results - page 2 / 3 » Reconstructing RSA Private Keys from Random Key Bits |
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
Randomization has emerged as a useful technique for data disguising in privacy-preserving data mining. Its privacy properties have been studied in a number of papers. Kargupta et ...
ECCC
2000
13 years 5 months ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
CRYPTO
2009
Springer
13 years 12 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
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...