[Resource Topic] 2007/311: A Refined Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three

Welcome to the resource topic for 2007/311

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

Authors: Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto

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.

ePrint: https://eprint.iacr.org/2007/311

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 .