Sciweavers

1369 search results - page 15 / 274
» A Practical Implementation of the Timing Attack
Sort
View
CHES
2006
Springer
134views Cryptology» more  CHES 2006»
13 years 11 months ago
Read-Proof Hardware from Protective Coatings
In cryptography it is assumed that adversaries only have black box access to the secret keys of honest parties. In real life, however, the black box approach is not sufficient beca...
Pim Tuyls, Geert Jan Schrijen, Boris Skoric, Jan v...
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
13 years 11 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
DSN
2009
IEEE
14 years 2 months ago
On the effectiveness of low latency anonymous network in the presence of timing attack
In this paper, we introduce a novel metric that can quantitatively measure the practical effectiveness (i.e. anonymity) of all anonymous networks in the presence of timing attack....
Jing Jin, Xinyuan Wang
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 7 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
ICICS
2010
Springer
13 years 5 months ago
Manger's Attack Revisited
In this work we examine a number of different open source implementations of the RSA Optimal Asymmetric Encryption Padding (OAEP) and generally RSA with respect to the message-aime...
Falko Strenzke