16 search results - page 3 / 4 » Hessian Elliptic Curves and Side-Channel Attacks |
ASIACRYPT
2008
Springer
13 years 7 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
CHES
2003
Springer
13 years 10 months ago
2003
Springer
The recent developments of side channel attacks have lead implementers to use more and more sophisticated countermeasures in critical operations such as modular exponentiation, or ...
CHES
2005
Springer
13 years 11 months ago
2005
Springer
We extend the model of Karlof and Wagner for modelling side channel attacks via Input Driven Hidden Markov Models (IDHMM) to the case where not every state corresponds to a single ...
INDOCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
INDOCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
The Montgomery multiplication is often used for an efficient implementations of public-key cryptosystems. This algorithm occasionally needs an extra subtraction in the final step,...