Skip to content

Point multiplication on ordinary elliptic curves over fields of characteristic three.

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)485 - 497
Number of pages12
JournalApplicable Algebra in Engineering, Communication and Computing
Volume13
DatePublished - Jul 2003

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.

View research connections

Related faculties, schools or groups