International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A Refined Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three

Authors:
Jean-Luc Beuchat
Masaaki Shirase
Tsuyoshi Takagi
Eiji Okamoto
Download:
URL: http://eprint.iacr.org/2007/311
Search ePrint
Search Google
Abstract: We describe further improvements of the $\eta_T$ pairing algorithm in characteristic three. Our approach combines the loop unrolling technique introduced by Granger {\em et. al} for the Duursma-Lee algorithm, and a novel algorithm for multiplication over $\mathbb{F}_{3^{6m}}$ proposed by Gorla {\em et al.} at SAC 2007. For $m=97$, the refined algorithm reduces the number of multiplications over $\mathbb{F}_{3^m}$ from $815$ to $692$.
BibTeX
@misc{eprint-2007-13591,
  title={A Refined Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three},
  booktitle={IACR Eprint archive},
  keywords={implementation / $\eta_T$ pairing, finite field arithmetic, characteristic three},
  url={http://eprint.iacr.org/2007/311},
  note={ beuchat@risk.tsukuba.ac.jp 13746 received 10 Aug 2007, last revised 21 Aug 2007},
  author={Jean-Luc Beuchat and Masaaki Shirase and Tsuyoshi Takagi and Eiji Okamoto},
  year=2007
}