190 search results - page 7 / 38 » Supersingular Elliptic Curves in Cryptography |
FCCM
2008
IEEE
15 years 6 months ago
2008
IEEE
116
click to vote
ACISP
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a new approach to precompute all odd points [3]P, [5]P, . . . , [2k - 1]P, k 2 on an elliptic curve over Fp. Those points are required for the efficient evalua...
CHES
2010
Springer
15 years 24 days ago
2010
Springer
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...
116
click to vote
AAECC
2003
Springer
15 years 3 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...
121
click to vote
CARDIS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...