Welcome to the resource topic for 2004/375
Title:
Efficient Pairing Computation on Supersingular Abelian Varieties
Authors: Paulo S. L. M. Barreto, Steven Galbraith, Colm O hEigeartaigh, Michael Scott
Abstract:We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises results of Duursma and Lee for computing the Tate pairing on supersingular elliptic curves in characteristic three.
We then show how our general technique leads to a new algorithm which is about twice as fast as the Duursma-Lee method.
These ideas are then used for elliptic and hyperelliptic curves in characteristic 2 with very efficient results. In particular, the hyperelliptic case is faster than all previously known pairing algorithms.
ePrint: https://eprint.iacr.org/2004/375
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 .