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 efficient automorphisms. The proposed algorithm is as efficient as Scott's algorithm in [12].

Category / Keywords: implementation / elliptic curve cryptosystem

Date: received 16 Dec 2006, last revised 13 Apr 2007

Contact author: zhcha at mail2 sysu edu cn

Available format(s): PDF | BibTeX Citation

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}.

Version: 20190217:224314 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]