Welcome to the resource topic for 2006/471
Title:
Multiplication and Squaring on Pairing-Friendly Fields
Authors: Augusto Jun Devegili, Colm Ó~hÉigeartaigh, Michael Scott, 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.
ePrint: https://eprint.iacr.org/2006/471
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .