Analysis and optimization of elliptic-curve single-scalar multiplication
Daniel J. Bernstein, Tanja Lange · Contemporary mathematics - American Mathematical Society · 2008
Let P be a point on an elliptic curve over a finite field of large characteristic. Exactly how many points 2P, 3P, 5P, 7 P, 9P, ... ,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 11M 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.