COMPARISON OF ALGORITHMS FOR ELLIPTIC CURVE CRYPTOGRAPHY OVER FINITE FIELDS OF GF(2~m)

摘要

For elliptic curve cryptosystems does exist many algorithms, that computes the scalar multiplication k·P. Some are better for a software solution and others are better for a hardware solution. In this paper we compare algorithms without precomputation for the scalar multiplication on elliptic curves over a finite field of GF(2~m). At the end we show which algorithm is the best for a hardware or software solution.