Sciweavers

46 search results - page 3 / 10
» Elliptic Curve Cryptosystems and Side-channel Attacks
Sort
View
IPL
2007
105views more  IPL 2007»
13 years 5 months ago
Improving the arithmetic of elliptic curves in the Jacobi model
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
Sylvain Duquesne
ICICS
1997
Springer
13 years 9 months ago
A new and optimal chosen-message attack on RSA-type cryptosystems
Abstract. Chosen-message attack on RSA is usually considered as an inherent property of its homomorphic structure. In this paper, we show that nonhomomorphic RSA-type cryptosystems...
Daniel Bleichenbacher, Marc Joye, Jean-Jacques Qui...
INDOCRYPT
2004
Springer
13 years 10 months ago
Exact Analysis of Montgomery Multiplication
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,...
Hisayoshi Sato, Daniel Schepers, Tsuyoshi Takagi
INDOCRYPT
2007
Springer
13 years 11 months ago
Solving Discrete Logarithms from Partial Knowledge of the Key
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...
K. Gopalakrishnan, Nicolas Thériault, Chui ...
FDTC
2006
Springer
106views Cryptology» more  FDTC 2006»
13 years 9 months ago
Sign Change Fault Attacks on Elliptic Curve Cryptosystems
We present a new type of fault attacks on elliptic curve scalar multiplications: Sign Change Attacks. These attacks exploit different number representations as they are often emplo...
Johannes Blömer, Martin Otto 0002, Jean-Pierr...