Cryptology ePrint Archive: Report 2008/060

Fast Algorithms for Arithmetic on Elliptic Curves Over Prime Fields

Nicholas T. Sullivan

Abstract: We present here a thorough discussion of the problem of fast arithmetic on elliptic curves over prime order finite fields. Since elliptic curves were independently pro- posed as a setting for cryptography by Koblitz [53] and Miller [67], the group of points on an elliptic curve has been widely used for discrete logarithm based cryptosystems. In this thesis, we survey, analyse and compare the fastest known serial and parallel algorithms for elliptic curve scalar multiplication, the primary operation in discrete logarithm based cryptosystems. We also introduce some new algorithms for the basic group operation and several new parallel scalar multiplication algorithms. We present a mathematical basis for comparing the various algorithms and make recommendations for the fastest algorithms to use in different circumstances.

Category / Keywords: public-key cryptography / Elliptic Curve Cryptography

Publication Info: Thesis, University of Calgary, 2007

Date: received 3 Feb 2008

Contact author: nicholas sullivan at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20080211:105449 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]