84 search results - page 5 / 17 » Elliptic Curves with a Given Number of Points |
FDTC
2006
Springer
13 years 11 months ago
2006
Springer
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...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We propose a simple and efficient deterministic extractor for an ordinary elliptic curve E, defined over F2n , where n = 2 and is a positive integer. Our extractor, for a given poi...
ITNG
2007
IEEE
14 years 1 months ago
2007
IEEE
: There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks. Algorithms for elliptic curve point scalar multiplication suc...
CHES
2004
Springer
14 years 26 days ago
2004
Springer
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement a...
IACR
2011
12 years 7 months ago
2011
Abstract. The Gallant-Lambert-Vanstone (GLV) method is a very ef cient technique for accelerating point multiplication on elliptic curves with e ciently computable endomorphisms. G...