You are looking at a specific version 20070220:151457 of this paper.
See the latest version.
Paper 2006/471
Multiplication and Squaring on Pairing-Friendly Fields
Augusto Jun Devegili and Colm Ó~hÉigeartaigh and Michael Scott and Ricardo Dahab
Abstract
Pairing-friendly fields are finite fields that are suitable for the implementation of cryptographic bilinear pairings. In this paper we review multiplication and squaring methods for pairing-friendly fields $\fpk$ with $k \in \{2,3,4,6\}$. For composite $k$, we consider every possible towering construction. We compare the methods to determine which is most efficient based on the number of basic $\fp$ operations, as well as the best constructions for these finite extension fields. We also present experimental results for every method.
Note: Correction of a typo in the formula for squaring in cubic extensions and reordering of the author list.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- finite fieldspairingsefficient implementation
- Contact author(s)
- augusto @ ic unicamp br
- History
- 2007-02-20: revised
- 2006-12-14: received
- See all versions
- Short URL
- https://ia.cr/2006/471
- License
-
CC BY