CryptoDB

Paper: Analysis and optimization of elliptic-curve single-scalar multiplication

Authors: Daniel J. Bernstein Tanja Lange URL: http://eprint.iacr.org/2007/455 Search ePrint Search Google Let $P$ be a point on an elliptic curve over a finite field of large characteristic. Exactly how many points $2P,3P,5P,7P,9P,\ldots,mP$ should be precomputed in a sliding-window computation of $nP$? Should some or all of the points be converted to affine form, and at which moments during the precomputation should these conversions take place? Exactly how many field multiplications are required for the resulting computation of $nP$? The answers depend on the size of $n$, the $\inversions/\mults$ ratio, the choice of curve shape, the choice of coordinate system, and the choice of addition formulas. This paper presents answers that, compared to previous analyses, are more carefully optimized and cover a much wider range of situations.
BibTeX
@misc{eprint-2007-13735,
title={Analysis and optimization of elliptic-curve single-scalar multiplication},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / Elliptic curves, addition, doubling, explicit  formulas, Edwards coordinates, inverted Edwards coordinates,  side-channel countermeasures, unified addition formulas,  strongly unified addition formulas. precomputations},
url={http://eprint.iacr.org/2007/455},
note={ tanja@hyperelliptic.org 13854 received 7 Dec 2007},
author={Daniel J. Bernstein and Tanja Lange},
year=2007
}