65 search results - page 3 / 13 » Atomicity Improvement for Elliptic Curve Scalar Multiplicati... |
104
click to vote
PKC
2004
Springer
15 years 5 months ago
2004
Springer
The isogeny for elliptic curve cryptosystems was initially used for the efficient improvement of order counting methods. Recently, Smart proposed the countermeasure using isogeny f...
87
Voted
ANTS
2004
Springer
15 years 5 months ago
2004
Springer
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this metho...
WISA
2007
Springer
15 years 5 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...
90
Voted
TC
2008
14 years 11 months ago
2008
A high performance architecture of elliptic curve scalar multiplication over finite field GF(2m ) is proposed. A pseudo-pipelined word serial finite field multiplier with word siz...
100
click to vote
AMC
2006
14 years 11 months ago
2006
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...