arXiv · math/0208038
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
Abstract
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication when we compute 2P+Q from given points P, Q on the curve. We give applications to simultaneous multiple scalar multiplication and to the Elliptic Curve Method of factorization. We show how this improvement together with another idea can speed the computation of the Weil and Tate pairings by up to 7.8 %.
Explore related subjects
Keep this discovery
Kirsten Eisentraeger, Kristin Lauter, Peter L. Montgomery. 2003-01-22. Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. https://arxiv.org/abs/math/0208038
Cite the original work for its findings. Save a collection to share your selection of sources.