37 search results - page 3 / 8 » Fast Point Decompression for Standard Elliptic Curves |
96
Voted
ARC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper presents implementation results of a reconfigurable elliptic curve processor defined over prime fields GF(p). We use this processor to compare a new algorit...
110
Voted
CRYPTO
1995
Springer
15 years 5 months ago
1995
Springer
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
132
click to vote
DCC
2000
IEEE
15 years 1 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...
117
Voted
ASIACRYPT
2007
Springer
15 years 8 months ago
2007
Springer
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...
114
click to vote
IACR
2011
14 years 1 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...