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

Granger, R., Page, D. and Stam, M. (2005) Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three IEEE Transactions on Computers, 54 (7). pp. 852-860.

Full text not available from this repository.

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 precompute 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 precomputation and that may also be implemented in hardware to accelerate devices such as smart-cards.

Item Type:	Article
Divisions :	Faculty of Engineering and Physical Sciences > Computing Science
Authors :	Name Email ORCID Granger, R. r.granger@surrey.ac.uk Page, D. Stam, M.
Date :	23 May 2005
DOI :	10.1109/TC.2005.120
Uncontrolled Keywords :	Digital arithmetic; Public key cryptography; Public key cryptosystems; Computer arithmetic; High-speed arithmetic
Depositing User :	Clive Harris
Date Deposited :	07 Feb 2019 09:41
Last Modified :	07 Feb 2019 09:43
URI:	http://epubs.surrey.ac.uk/id/eprint/850394

Actions (login required)

View Item

Downloads