Cryptology ePrint Archive: Report 2010/315

Efficient Techniques for High-Speed Elliptic Curve Cryptography

Patrick Longa and Catherine Gebotys

Abstract: In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report new speed records on modern x86-64 based processors. Our different implementations include elliptic curves using Jacobian coordinates, extended Twisted Edwards coordinates and the recently proposed Galbraith-Lin-Scott (GLS) method. Compared to state-of-the-art implementations on identical platforms the proposed techniques provide up to 30% speed improvements. Additionally, compared to the best previous published results on similar platforms improvements up to 31% are observed. This research is crucial for advancing high speed cryptography on new emerging processor architectures.

Category / Keywords: implementation / Elliptic curve cryptosystem, point multiplication, point operation, field arithmetic, software implementation, x86-64 processor.

Publication Info: Full version of our paper at CHES2010

Date: received 26 May 2010

Contact author: plonga at uwaterloo ca

Available formats: PDF | BibTeX Citation

Version: 20100527:030241 (All versions of this report)

Discussion forum: Show discussion | Start new discussion