You are looking at a specific version 20080102:031004 of this paper.
See the latest version.
Paper 2007/247
A Note on the Ate Pairing
Chang-An Zhao and Fangguo Zhang and Jiwu Huang
Abstract
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius $t$. However, not all pairing-friendly elliptic curves have this property. In this paper, we generalize the Ate pairing and find a series of variations of the Ate pairing. We show that the shortest Miller loop of the variations of the Ate pairing can possibly be as small as $r^{1/\varphi(k)}$ on more pairing-friendly curves generated by the method of complex multiplications, and hence speed up the pairing computation significantly.
Note: correct some writing errors.
Metadata
- Available format(s)
- PDF PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Tate pairingAte pairingElliptic curvesPairing-based cryptosystems
- Contact author(s)
- zhcha @ mail2 sysu edu cn
- History
- 2008-01-02: last of 5 revisions
- 2007-06-20: received
- See all versions
- Short URL
- https://ia.cr/2007/247
- License
-
CC BY