CryptoDB
Efficient Pairing Computation on Curves
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2007-13420, title={Efficient Pairing Computation on Curves}, booktitle={IACR Eprint archive}, keywords={Tate pairing,Eta pairing,Ate pairing,Curves,Efficient algorithms}, url={http://eprint.iacr.org/2007/138}, note={ wuhfmail@gmail.com 13644 received 18 Apr 2007, last revised 11 May 2007}, author={Rongquan Feng and Hongfeng Wu}, year=2007 }