Paper 2004/157
Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three
R. Granger, D. Page, and M. Stam
Abstract
Although identity based cryptography offers a number of functional advantages over conventional public key methods, the computational costs are significantly greater. The dominant part of this cost is the Tate pairing which, in characteristic three, is best computed using the algorithm of Duursma and Lee. However, in hardware and constrained environments this algorithm is unattractive since it requires online computation of cube roots or enough storage space to pre-compute required results. We examine the use of normal basis arithmetic in characteristic three in an attempt to get the best of both worlds: an efficient method for computing the Tate pairing that requires no pre-computation and that may also be implemented in hardware to accelerate devices such as smart-cards. Since normal basis arithmetic in characteristic three has not received much attention before, we also discuss the construction of suitable bases and associated curve parameterisations.
Note: Revised to comply with IEEE submission policy.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- implementationpairingsarithmetic
- Contact author(s)
- page @ cs bris ac uk
- History
- 2004-08-17: revised
- 2004-07-07: received
- See all versions
- Short URL
- https://ia.cr/2004/157
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2004/157,
author = {R. Granger and D. Page and M. Stam},
title = {Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/157},
year = {2004},
url = {https://eprint.iacr.org/2004/157}
}
