Sciweavers

28 search results - page 5 / 6
» A Generalized Wiener Attack on RSA
Sort
View
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
14 years 6 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
12 years 6 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
CHES
2000
Springer
121views Cryptology» more  CHES 2000»
13 years 10 months ago
On Boolean and Arithmetic Masking against Differential Power Analysis
Abstract. Since the announcement of the Differential Power Analysis (DPA) by Paul Kocher and al., several countermeasures were proposed in order to protect software implementations...
Jean-Sébastien Coron, Louis Goubin
CHES
2004
Springer
216views Cryptology» more  CHES 2004»
13 years 10 months ago
Efficient Countermeasures against RPA, DPA, and SPA
In the execution on a smart card, side channel attacks such as simple power analysis (SPA) and the differential power analysis (DPA) have become serious threat [15]. Side channel a...
Hideyo Mamiya, Atsuko Miyaji, Hiroaki Morimoto
ASIACRYPT
2007
Springer
14 years 14 days ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...