You are looking at a specific version 20020810:133033 of this paper. See the latest version.

Paper 2002/112

An Efficient Procedure to Double and Add Points on an Elliptic Curve

Kirsten Eisentraeger, Kristin Lauter, and Peter L. Montgomery

Abstract

We present an algorithm that speeds exponentiation on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general exponentiation 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 exponentiation 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%.

Metadata
Available format(s)
PS
Category
Implementation
Publication info
Published elsewhere. submitted for publication
Keywords
elliptic curve cryptosystemWeil pairingTate pairing
Contact author(s)
klauter @ microsoft com
History
2002-08-10: received
Short URL
https://ia.cr/2002/112
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.