Cryptology ePrint Archive: Report 2009/243

Faster Pairings on Special Weierstrass Curves

Craig Costello and Huseyin Hisil and Colin Boyd and Juan Manuel Gonzalez Nieto and Kenneth Koon-Ho Wong

Abstract: This paper presents efficient formulas for computing cryptographic pairings on the curve y^2 = c*x^3 + 1 over fields of large characteristic. We provide examples of pairing-friendly elliptic curves of this form which are of interest for efficient pairing implementations.

Category / Keywords: public-key cryptography / Tate pairing, Miller's algorithm, elliptic curves.

Date: received 28 May 2009

Contact author: craig costello at qut edu au

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

Version: 20090530:124211 (All versions of this report)

Discussion forum: Show discussion | Start new discussion