Elliptic curve cryptosystems over small fields of odd characteristic

Abstract

In this paper it is shown how to speed up the multiplication step on elliptic curves defined over small odd characteristic finite fields. The method used is a generalization of a recent method of Müller and Solinas. Various implementation issues are discussed and described with the use of timings from an implementation of the methods. © 1999 International Association for Cryptologic Research.