Cryptology ePrint Archive: Report 2006/474

Speeding up the Bilinear Pairings Computation on Curves with Automorphisms

Chang-An Zhao and Fangguo Zhang and 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 ecient automorphisms. The proposed algorithm is as ecient as Scott's algorithm in [12].

Note:
This work is same as \cite{Scott05} from algorithmic angle. We
only give a new derivation of Scott's algorithm \cite{Scott05}.
Therefore this paper will not be submitted anywhere, it is just
another explanation of Scott's algorithm \cite{Scott05}.