Cryptology ePrint Archive: Report 2008/209
Computing Bilinear Pairings on Elliptic Curves with Automorphisms
Chang-An Zhao and Dongqing Xie and Fangguo Zhang and Jingwei Zhang and Bing-Long Chen
Abstract: In this paper, we present a novel method for constructing a
super-optimal pairing with great efficiency, which we call the omega
pairing. The computation of the omega pairing requires the simple
final exponentiation and short loop length in Miller's algorithm
which leads to a significant improvement over the previously known
techniques on certain pairing-friendly curves. Experimental results
show that the omega pairing is about 22% faster and 19% faster
than the super-optimal pairing proposed by Scott at security level
of AES 80 bits on certain pairing-friendly curves in affine
coordinate systems and projective coordinate systems, respectively.
Category / Keywords: Elliptic curves, Automorphism, Pairing based cryptography, Weil pairing
Publication Info: Published by Designs, Codes and Cryptography.
Date: received 12 May 2008, last revised 23 Nov 2013
Contact author: zhaochan3 at mail sysu edu cn; changanzhao@gmail com
Available format(s): PDF | BibTeX Citation
Note: Minor typing corrections to publication version.
Version: 20131124:022605 (All versions of this report)
Short URL: ia.cr/2008/209
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]