Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
Open Access
- 1 January 2002
- journal article
- Published by Wiley in LMS Journal of Computation and Mathematics
- Vol. 5, 181-193
- https://doi.org/10.1112/s1461157000000747
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Implementing the Tate PairingPublished by Springer Nature ,2002
- Supersingular Curves in CryptographyPublished by Springer Nature ,2001
- Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve CryptographyJournal of Cryptology, 2001
- A One Round Protocol for Tripartite Diffie–HellmanPublished by Springer Nature ,2000
- Elliptic Curves in CryptographyPublished by Cambridge University Press (CUP) ,1999
- Efficient Elliptic Curve Exponentiation Using Mixed CoordinatesPublished by Springer Nature ,1998
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- Modular multiplication without trial divisionMathematics of Computation, 1985