International Association for Cryptologic Research

International Association
for Cryptologic Research


Paper: Multiplication and Squaring on Pairing-Friendly Fields

Augusto Jun Devegili
Colm \'O~h\'Eigeartaigh
Michael Scott
Ricardo Dahab
Search ePrint
Search Google
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.
  title={Multiplication and Squaring on Pairing-Friendly Fields},
  booktitle={IACR Eprint archive},
  keywords={finite fields, pairings, efficient implementation},
  note={ 13564 received 13 Dec 2006, last revised 20 Feb 2007},
  author={Augusto Jun Devegili and Colm \'O~h\'Eigeartaigh and Michael Scott and Ricardo Dahab},