Cryptology ePrint Archive: Report 2007/138

Efficient Pairing Computation on Curves

Rongquan Feng and Hongfeng Wu

Abstract: In this paper, a method for the efficient computation of Tate pairings on curves which is a generalization of Barreto, etc.'s method [2] is presented. It can reduce the number of loops in the computation of the Tate pairing. The method can be applied not only to supersingular curves but to non-supersingular curves. An example shows the cost of the algorithm in this paper can be reduced by 18% than the best known algorithm in some elliptic curves.

Category / Keywords: Tate pairing,Eta pairing,Ate pairing,Curves,Efficient algorithms

Date: received 18 Apr 2007, last revised 11 May 2007

Contact author: wuhfmail at gmail com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20070511:103627 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]