Abstract.
We discuss new algorithms for multiplying points on elliptic curves defined over small finite fields of characteristic two. This algorithm is an extension of previous results by Koblitz, Meier, and Staffelbach. Experimental results show that the new methods can give a running time improvement of up to 50 % compared with the ordinary binary algorithm for multiplication. Finally, we present a table of elliptic curves, which are well suited for elliptic curve public key cryptosystems, and for which the new algorithm can be used.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received 14 January 1997 and revised 4 September 1997
Rights and permissions
About this article
Cite this article
Müller, V. Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two . J. Cryptology 11, 219–234 (1998). https://doi.org/10.1007/s001459900045
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001459900045