Sciweavers

27 search results - page 3 / 6
» ches 2010
Sort
View
CHES
2010
Springer
183views Cryptology» more  CHES 2010»
13 years 5 months ago
Coordinate Blinding over Large Prime Fields
In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves. Specifically, this blinding method applies...
Michael Tunstall, Marc Joye
CHES
2010
Springer
112views Cryptology» more  CHES 2010»
13 years 6 months ago
An Alternative to Error Correction for SRAM-Like PUFs
We propose a new technique called stable-PUF-marking as an alternative to error correction to get reproducible (i.e. stable) outputs from physical unclonable functions (PUF). The ...
Maximilian Hofer, Christoph Boehm
CHES
2010
Springer
175views Cryptology» more  CHES 2010»
13 years 6 months ago
Side-Channel Analysis of Six SHA-3 Candidates
Abstract. In this paper we study six 2nd round SHA-3 candidates from a side-channel cryptanalysis point of view. For each of them, we give the exact procedure and appropriate choic...
Olivier Benoît, Thomas Peyrin
CHES
2010
Springer
133views Cryptology» more  CHES 2010»
13 years 6 months ago
ARMADILLO: A Multi-purpose Cryptographic Primitive Dedicated to Hardware
This paper describes and analyzes the security of a general-purpose cryptographic function design, with application in RFID tags and sensor networks. Based on these analyzes, we su...
Stéphane Badel, Nilay Dagtekin, Jorge Nakah...
CHES
2010
Springer
132views Cryptology» more  CHES 2010»
13 years 6 months ago
Efficient Techniques for High-Speed Elliptic Curve Cryptography
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...
Patrick Longa, Catherine H. Gebotys