Faster Pairings on Special Weierstrass Curves

This paper presents efficient formulas for computing cryptographic pairings on the curve y2 = cx3 + 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.

• Type: Conference
• Year: 2009
• Where: PAIRING
• Authors: Craig Costello, Hüseyin Hisil, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong
• Keywords: Cryptographic Pairings, Cryptography, Efficient Pairing Implementations, PAIRING 2009, Pairing-friendly Elliptic Curves