Efficient Arithmetic on Koblitz Curves

By J. Solinas. Des. Codes Cryptogr., 2000

417 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The Elliptic Curve Digital Signature Algorithm (ECDSA) (2001, result): “Solinas [100, 102], building on the earlier work of Meier and Staffelbach [62], showed how one can compute kP very efficiently for arbitrary k where P is a point on a Koblitz curve.”
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms (2001, methodology): “While the technique is not as efficient as the methods of Solinas [30,32] for Koblitz curves, they are useful for speeding up point multiplication on a larger class of elliptic curves, for example certain curves over prime fields.”
Software Implementation of the NIST Elliptic Curves Over Prime Fields (2001, methodology): “Moreover, NAF(k) has the fewest non-zero coefficients of any signed digit representation of k, and can be efficiently computed using Algorithm 14 [27].”
Algorithms for Multi-exponentiation (2001, background): “The average density (proportion of non-zero components) in width-(wi + 1) NAFs is 1/(wi + 2) for B →∞ [19].”