You are looking at a specific version 20090530:124211 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- PDF PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Tate pairingMiller's algorithmelliptic curves.
- Contact author(s)
- craig costello @ qut edu au
- History
- 2009-05-30: received
- Short URL
- https://ia.cr/2009/243
- License
-
CC BY