Cryptology ePrint Archive: Report 2008/212

Reducing the Complexity of the Weil Pairing Computation

Chang-An Zhao and Fangguo Zhang and Dongqing Xie

Abstract: In this paper, we present some new variants based on the Weil pairing for efficient pairing computations. The new pairing variants have the short Miller iteration loop and simple final exponentiation. We then show that computing the proposed pairings is more efficient than computing the Weil pairing. Experimental results for these pairings are also given.

Category / Keywords: Weil pairing, ate pairing, elliptic curves, pairing based cryptography

Date: received 21 May 2008, last revised 17 Jun 2010

Contact author: changanzhao at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20100618:034932 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]