Paper 2006/313
Efficient Scalar Multiplication and Security against Power Analysis in Cryptosystems based on the NIST Elliptic Curves Over Prime Fields
Lars Elmegaard-Fessel
Abstract
In cryptosystems based on elliptic curves over finite fields (ECC-systems), the most time-consuming operation is scalar multiplication. We focus on the NIST elliptic curves over prime fields. An implementation of scalar multiplication, developed by IBM Danmark A/S for test purposes, serves as a point of reference.
In order to achieve maximal efficiency in an ECC-system, one must choose an optimal method for scalar multiplication and the best possible coordinate representation for the curve being used. We perform an analysis of known scalar multiplication methods. This analysis contains a higher degree of detail than existing publications on the subject and shows that the NAF
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- lars @ elmegaard-fessel dk
- History
- 2006-09-12: received
- Short URL
- https://ia.cr/2006/313
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/313, author = {Lars Elmegaard-Fessel}, title = {Efficient Scalar Multiplication and Security against Power Analysis in Cryptosystems based on the {NIST} Elliptic Curves Over Prime Fields}, howpublished = {Cryptology {ePrint} Archive, Paper 2006/313}, year = {2006}, url = {https://eprint.iacr.org/2006/313} }