Cryptology ePrint Archive: Report 2004/157

Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three

R. Granger and 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.

Category / Keywords: implementation / implementation, pairings, arithmetic

Date: received 6 Jul 2004, last revised 17 Aug 2004

Contact author: page at cs bris ac uk

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: Revised to comply with IEEE submission policy.

Version: 20040817:084558 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]