Cryptology ePrint Archive: Report 2013/131
Two is the fastest prime
Thomaz Oliveira and Juilo López and Diego F. Aranha and Francisco Rodríguez-Henríquez
Abstract: In this work we present the $\lambda$-coordinates, a new system for
representing points in binary elliptic curves. We also provide efficient elliptic curve operations based on the new representation and timing results of our software implementation over the field $F_{2^{254}}$. As a result, we improved the known speed records for protected/unprotected single/multi-core software implementations of the random-point elliptic curve scalar multiplication at the 128-bit security level. When implemented on a Sandy Bridge 3.4GHz Intel Xeon processor, our software is able to compute a single/multi-core unprotected scalar multiplication in 72,300 and 47,900 clock cycles, respectively; and a protected single-core scalar multiplication in 114,800 cycles. These numbers improve by 2% on the newer Ivy Bridge platform.
Category / Keywords: implementation / elliptic curve cryptosystem
Date: received 5 Mar 2013
Contact author: thomaz figueiredo at gmail com
Available formats: PDF | BibTeX Citation
Version: 20130307:161642 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]