Paper 2002/114

Point Multiplication on Ordinary Elliptic Curves over Fields of Characteristic Three

N. P. Smart and J. Westwood


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.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
nigel @ cs bris ac uk
2002-08-10: received
Short URL
Creative Commons Attribution


      author = {N. P.  Smart and J.  Westwood},
      title = {Point Multiplication on Ordinary Elliptic Curves over Fields of Characteristic Three},
      howpublished = {Cryptology ePrint Archive, Paper 2002/114},
      year = {2002},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.