Welcome to the resource topic for 2006/474
Title:
Speeding up the Bilinear Pairings Computation on Curves with Automorphisms
Authors: Chang-An Zhao, Fangguo Zhang, Jiwu Huang
Abstract:In this paper we present an algorithm for computing the bilinear pairings on a family of non-supersingular elliptic curves with non-trivial automorphisms. We obtain a short iteration loop in Miller’s algorithm using non-trivial efficient automorphisms. The proposed algorithm is as efficient as Scott’s algorithm in [12].
ePrint: https://eprint.iacr.org/2006/474
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 .