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.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received 24 September 1997 and revised 3 May 1998
Rights and permissions
About this article
Cite this article
Smart, N. Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic . J. Cryptology 12, 141–151 (1999). https://doi.org/10.1007/PL00003820
Published:
Issue Date:
DOI: https://doi.org/10.1007/PL00003820