Sciweavers

ACNS
2009
Springer
124views Cryptology» more  ACNS 2009»
14 years 6 months ago
Novel Precomputation Schemes for Elliptic Curve Cryptosystems
We present an innovative technique to add elliptic curve points with the form P Q± , and discuss its application to the generation of precomputed tables for the scalar multiplicat...
Patrick Longa, Catherine H. Gebotys
DCC
2005
IEEE
14 years 11 months ago
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
Mathieu Ciet, Marc Joye
DCC
2007
IEEE
14 years 11 months ago
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
Jaime Gutierrez, Álvar Ibeas