Comparison of Algorithms for Elliptic Curve Cryptography over Finite Fields of GF(2^m)

M. Schmalisch and D. Timmermann (Germany)

Keywords

elliptic curve cryptography, scalar multiplicationalgorithms

Abstract

For elliptic curve cryptosystems does exist many algorithms, that computes the scalar multiplication kP. 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(2m ). At the end we show which algorithm is the best for a hardware or software solution.

Important Links:

• DOI:
• From Proceeding (440) Communication, Network, and Information Security - 2003

Go Back