We discuss new algorithms for multiplying points on elliptic curves de
fined over small finite fields of characteristic two. This algorithm i
s an extension of previous results by Koblitz. Meier. and Staffelbach.
Experimental results show that the new methods can give a running tim
e improvement of up to 50% compared with the ordinary binary algorithm
for multiplication. Finally, we present a table of elliptic curves, w
hich are well suited for elliptic curve public key cryptosystems, and
for which the new algorithm can be used.