UPM Institutional Repository

Improving the performance of {0,1,3}-NAF recoding algorithm for elliptic curve scalar multiplication


Citation

Abdul Raheem, Waleed K. and Md Yasin, Sharifah and Udzir, Nur Izura and Kamel Ariffin, Muhammad Rezal (2019) Improving the performance of {0,1,3}-NAF recoding algorithm for elliptic curve scalar multiplication. International Journal of Advanced Computer Science and Applications, 10 (4). pp. 275-279. ISSN 2158-107X; ESSN: 2156-5570

Abstract

Abstract: Although scalar multiplication is highly fundamental to elliptic curve cryptography (ECC), it is the most time-consuming operation. The performance of such scalar multiplication depends on the performance of its scalar recoding which can be measured in terms of the time and memory consumed, as well as its level of security. This paper focuses on the conversion of binary scalar key representation into {0, 1, 3}-NAF non-adjacent form. Thus, we propose an improved {0, 1, 3}-NAF lookup table and mathematical formula algorithm which improves the performance of {0, 1, 3}-NAF algorithm. This is achieved by reducing the number of rows from 15 rows to 6 rows, and reading two (instead of three) digits to produce one. Furthermore, the improved lookup table reduces the recoding time of the algorithm by over 60% with a significant reduction in memory consumption even with an increase in key size. Specifically, the improved lookup table reduces the memory consumption by as much as 75% for the big key, which shows its higher level of resilience to side channel attacks.


Download File

[img] Text (Abstract)
Improving the performance of {0,1,3}-NAF recoding algorithm for elliptic curve scalar multiplication.pdf

Download (5kB)

Additional Metadata

Item Type: Article
Divisions: Faculty of Computer Science and Information Technology
Institute for Mathematical Research
DOI Number: https://doi.org/10.14569/IJACSA.2019.0100432
Publisher: The Science and Information Organization
Keywords: Elliptic Curve Cryptosystem (ECC); Scalar multiplication algorithm; {0, 1, 3}-NAF method; Non-Adjacent Form (NAF)
Depositing User: Azhar Abdul Rahman
Date Deposited: 02 Oct 2020 01:55
Last Modified: 02 Oct 2020 01:55
Altmetrics: http://altmetrics.com-details.php?domain=psair.upm.edu.my&doi=10.14569/IJACSA.2019.0100432
URI: http://psasir.upm.edu.my/id/eprint/80208
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item