International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Speeding up the Bilinear Pairings Computation on Curves with Automorphisms

Authors:
Chang-An Zhao
Fangguo Zhang
Jiwu Huang
Download:
URL: http://eprint.iacr.org/2006/474
Search ePrint
Search Google
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].
BibTeX
@misc{eprint-2006-21965,
  title={Speeding up the Bilinear Pairings Computation on Curves with Automorphisms},
  booktitle={IACR Eprint archive},
  keywords={implementation / elliptic curve cryptosystem},
  url={http://eprint.iacr.org/2006/474},
  note={ zhcha@mail2.sysu.edu.cn 13616 received 16 Dec 2006, last revised 13 Apr 2007},
  author={Chang-An Zhao and Fangguo Zhang and Jiwu Huang},
  year=2006
}