International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Efficient Techniques for High-Speed Elliptic Curve Cryptography

Authors:
Catherine Gebotys
Patrick Longa
Download:
URL: http://eprint.iacr.org/2010/315
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2010-23216,
  title={Efficient Techniques for High-Speed Elliptic Curve Cryptography},
  booktitle={IACR Eprint archive},
  keywords={implementation / Elliptic curve cryptosystem, point multiplication, point operation, field arithmetic, software implementation, x86-64 processor.},
  url={http://eprint.iacr.org/2010/315},
  note={Full version of our paper at CHES2010 plonga@uwaterloo.ca 14756 received 26 May 2010},
  author={Catherine Gebotys and Patrick Longa},
  year=2010
}