You are looking at a specific version 20070511:103627 of this paper.
See the latest version.
Paper 2007/138
Efficient Pairing Computation on Curves
Rongquan Feng and Hongfeng Wu
Abstract
In this paper, a method for the efficient computation of Tate pairings on curves which is a generalization of Barreto, etc.'s method [2] is presented. It can reduce the number of loops in the computation of the Tate pairing. The method can be applied not only to supersingular curves but to non-supersingular curves. An example shows the cost of the algorithm in this paper can be reduced by 18% than the best known algorithm in some elliptic curves.
Metadata
- Available format(s)
- PDF PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Tate pairingEta pairingAte pairingCurvesEfficient algorithms
- Contact author(s)
- wuhfmail @ gmail com
- History
- 2007-05-11: last of 3 revisions
- 2007-04-18: received
- See all versions
- Short URL
- https://ia.cr/2007/138
- License
-
CC BY