CryptoDB
Improved Weil and Tate pairings for elliptic and hyperelliptic curves
Authors: | |
---|---|
Download: | |
Abstract: | We present algorithms for computing the {\it squared} Weil and Tate pairings on an elliptic curve and the {\it squared} Tate pairing for hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for evaluating them are deterministic and do not depend on a random choice of points. Our pairings save about 20-30\% over the usual pairings. |
BibTeX
@misc{eprint-2003-11955, title={Improved Weil and Tate pairings for elliptic and hyperelliptic curves}, booktitle={IACR Eprint archive}, keywords={implementation / pairing-based cryptography}, url={http://eprint.iacr.org/2003/242}, note={to appear in the proceedings of ANTS-6 (Algorithmic Number Theory Symposium) klauter@microsoft.com 12481 received 21 Nov 2003, last revised 4 Mar 2004}, author={Kirsten Eisenträger and Kristin E. Lauter and Peter L. Montgomery}, year=2003 }