Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T05:04:39.697Z Has data issue: false hasContentIssue false

Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems

Published online by Cambridge University Press:  01 February 2010

K. Harrison
Affiliation:
Hewlett-Packard Laboratories, Filton Road, Stoke Gifford, Bristol, BS34 8QZ, keith_harrison@hp.com
D. Page
Affiliation:
Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, page@cs.bris.ac.uk
N. P. Smart
Affiliation:
Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, nigel@cs.bris.ac.uk

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, the authors examine a number of ways of implementing characteristic three arithmetic for use in cryptosystems based on the Tate pairing. Three alternative representations of the field elements are examined, and the resulting algorithms for the field addition, multiplication and cubing are compared. Issues related to the arithmetic of supersingular elliptic curves over fields of characteristic three are also examined. Details of how to compute the Tate pairing itself are not covered, since these are well documented elsewhere.

Information

Type
Research Article
Copyright
Copyright © London Mathematical Society 2002