A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
2002
LMS Journal of Computation and Mathematics
AbstractIn 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
doi:10.1112/s1461157000000747
fatcat:wfnx3jcgy5bp7puk7xihyjblxi