Speeding up the Bilinear Pairings Computation on Curves with Automorphisms

Chang-An Zhao; Fangguo Zhang; Jiwu Huang

Paper 2006/474

Speeding up the Bilinear Pairings Computation on Curves with Automorphisms

Chang-An Zhao, 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].

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

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Keywords: elliptic curve cryptosystem
Contact author(s): zhcha @ mail2 sysu edu cn
History: 2007-04-13: last of 17 revisions; 2006-12-24: received; See all versions
Short URL: https://ia.cr/2006/474
License: CC BY

BibTeX

@misc{cryptoeprint:2006/474,
      author = {Chang-An Zhao and Fangguo Zhang and Jiwu Huang},
      title = {Speeding up the Bilinear Pairings Computation on Curves with Automorphisms},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/474},
      year = {2006},
      url = {https://eprint.iacr.org/2006/474}
}