International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Computing the Bilinear Pairings on Elliptic Curves with Automorphisms

Authors:
Chang-An Zhao
Fangguo Zhang
Download:
URL: http://eprint.iacr.org/2008/209
Search ePrint
Search Google
Abstract: In this paper, a super-optimal pairing based on the Weil pairing is proposed with great efficiency. It is the first approach to reduce the Miller iteration loop when computing the variants of the Weil pairing. The super-optimal pairing based on the Weil pairing is computed rather fast, while it is slightly slower than the previous fastest pairing on the corresponding elliptic curves.
BibTeX
@misc{eprint-2008-17886,
  title={Computing the Bilinear Pairings on Elliptic Curves with Automorphisms},
  booktitle={IACR Eprint archive},
  keywords={implementation /},
  url={http://eprint.iacr.org/2008/209},
  note={ changanzhao@gmail.com 14020 received 12 May 2008, last revised 21 May 2008},
  author={Chang-An Zhao and Fangguo Zhang},
  year=2008
}