[Resource Topic] 2007/138: Efficient Pairing Computation on Curves

Welcome to the resource topic for 2007/138

Title:
Efficient Pairing Computation on Curves

Authors: Rongquan Feng, Hongfeng Wu

Abstract:

In this paper, a method for the efficient computation of Tate pairings on curves which is a generalization of Barreto, etc.'s method [2] is presented. It can reduce the number of loops in the computation of the Tate pairing. The method can be applied not only to supersingular curves but to non-supersingular curves. An example shows the cost of the algorithm in this paper can be reduced by 18% than the best known algorithm in some elliptic curves.

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

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 .