Welcome to the resource topic for 2008/212
Title:
Reducing the Complexity of the Weil Pairing Computation
Authors: Chang-An Zhao, Fangguo Zhang, Dongqing Xie
Abstract:In this paper, we present some new variants based on the Weil pairing for efficient pairing computations. The new pairing variants have the short Miller iteration loop and simple final exponentiation. We then show that computing the proposed pairings is more efficient than computing the Weil pairing. Experimental results for these pairings are also given.
ePrint: https://eprint.iacr.org/2008/212
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 .