Faster Pairings on Special Weierstrass Curves
- C. Costello ,
- H. Hisil ,
- C. Boyd ,
- J. M. González Nieto ,
- K. Koon-Ho Wong ,
- Craig Costello
Pairing 2009 |
Published by Springer Verlag
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.