Cryptology ePrint Archive: Report 2002/114
Point Multiplication on Ordinary Elliptic Curves over Fields of Characteristic Three
N.P. Smart and J. Westwood
Abstract: In this paper we investigate the efficiency of cryptosystems based on
ordinary elliptic curves over fields of characteristic three.
We look at different representations for curves and consider some of
the algorithms necessary to perform efficient point multiplication.
We give example timings for our operations and compare them with
timings for curves in characteristic two of a similar level of security.
We show that using the Hessian form in characteristic three
produces a point multiplication algorithm under $50$ percent slower
than the equivalent system in characteristic two.
Thus it is conceivable that curves in characteristic three, could
offer greater performance than currently perceived by the community.
Category / Keywords: public-key cryptography /
Date: received 9 Aug 2002
Contact author: nigel at cs bris ac uk
Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Version: 20020810:133614 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]