84 search results - page 4 / 17 » Elliptic Curves with a Given Number of Points |
CTRSA
2003
Springer
14 years 21 days ago
2003
Springer
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
IJNSEC
2010
13 years 2 months ago
2010
In 2004, a multi-signature scheme (MSS) based on the elliptic curve cryptosystem is given by Chen et al. [1]. Later, Liu and Liu [6] showed that if one of the users always sends h...
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
WAIFI
2007
Springer
14 years 1 months ago
2007
Springer
We propose a simple and efficient deterministic extractor for the (hyper)elliptic curve C, defined over Fq2 , where q is some power of an odd prime. Our extractor, for a given poi...
WISA
2007
Springer
14 years 1 months ago
2007
Springer
We propose a compact architecture of a Montgomery elliptic curve scalar multiplier in a projective coordinate system over GF(2m ). To minimize the gate area of the architecture, we...