Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Full version of our paper at CHES2010
- Keywords
- Elliptic curve cryptosystempoint multiplicationpoint operationfield arithmeticsoftware implementationx86-64 processor.
- Contact author(s)
- plonga @ uwaterloo ca
- History
- 2010-05-27: received
- Short URL
- https://ia.cr/2010/315
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/315,
author = {Patrick Longa and Catherine Gebotys},
title = {Efficient Techniques for High-Speed Elliptic Curve Cryptography},
howpublished = {Cryptology ePrint Archive, Paper 2010/315},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/315}},
url = {https://eprint.iacr.org/2010/315}
}
