Paper 2012/519
Faster implementation of scalar multiplication on Koblitz curves
Diego F. Aranha, Armando Faz-Hernández, Julio López, and Francisco Rodríguez-Henríquez
Abstract
We design a state-of-the-art software implementation of field and elliptic curve arithmetic in standard Koblitz curves at the 128-bit security level. Field arithmetic is carefully crafted by using the best formulae and implementation strategies available, and the increasingly common native support to binary field arithmetic in modern desktop computing platforms. The i-th power of the Frobenius automorphism on Koblitz curves is exploited to obtain new and faster interleaved versions of the well-known
Note: Minor fixes in the Appendix.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Minor revision. LATINCRYPT 2012
- Contact author(s)
- dfaranha @ gmail com
- History
- 2013-12-28: last of 2 revisions
- 2012-09-05: received
- See all versions
- Short URL
- https://ia.cr/2012/519
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/519, author = {Diego F. Aranha and Armando Faz-Hernández and Julio López and Francisco Rodríguez-Henríquez}, title = {Faster implementation of scalar multiplication on Koblitz curves}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/519}, year = {2012}, url = {https://eprint.iacr.org/2012/519} }