Sciweavers

Share
DCC
2011
IEEE

Computing bilinear pairings on elliptic curves with automorphisms

9 years 5 months ago
Computing bilinear pairings on elliptic curves with automorphisms
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 pairingfriendly curves in affine coordinate systems and projective coordinate systems, respectively. ⋆ This work was supported by Guangdong provincial Starting Foundation for Doctors of China(Grant No. 9451009101003191), the National Natural Science Foundation of Guangdong Province of China (Grant No. 8151007101000021), the National Natural Science Foundation of China under Grants No. 10926153 and No. 60773202, and the National Grand Funda...
Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where DCC
Authors Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei Zhang, Bing-Long Chen
Comments (0)
books