37 search results - page 1 / 8 » Fast Point Decompression for Standard Elliptic Curves |
EUROPKI
2008
Springer
13 years 9 months ago
2008
Springer
AAECC
2003
Springer
13 years 11 months ago
2003
Springer
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Recently, the new Multibase Non-Adjacent Form (mbNAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases...
AMC
2006
13 years 7 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...
INDOCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
This paper analyzes the best speeds that can be obtained for single-scalar multiplication with variable base point by combining a huge range of options: – many choices of coordin...