 Fast elliptic curve point multiplication based on window Non-Adjacent Form methodDenis Khleborodov Applied Mathematics and Computation, 2018, vol. 334, issue C, 41-59 Abstract: This article presents window Non-Adjacent Form (wNAF) of scalar representation method for developing algorithms of computing scalar multiplication in groups of points on an elliptic curve over finite fields. A new efficient wNAF-based algorithm has been presented. The algorithm was developed based on simple and composite operations with a point and also based on affine and Jacobi coordinates systems taking into account the latest achievements in computing cost reduction. The theorem concerning its computational complexity is formulated and proved for this new algorithm. In the end of this article, an efficiency analysis of the proposed algorithm depending on various parameters is presented, namely, the characteristic of the field over which the curve is defined, the scalar length and the window width of the precomputations and the coordinates of the precomputed points. A comparative analysis of the new algorithm and previously known efficient algorithm is also presented. Keywords: Elliptic curves; Scalar multiplication; Lightweight cryptography; Sliding window NAF (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:334:y:2018:i:c:p:41-59 DOI: 10.1016/j.amc.2018.03.112 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.