Improving the Performance of {0,1,3}-NAF Recoding Algorithm for Elliptic Curve Scalar Multiplication

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.

Authors and Affiliations

Waleed K. AbdulRaheem, Sharifah Bte Md Yasin, Nur Izura Binti Udzir, Muhammad Rezal bin Kamel Ariffin

Keywords

Related Articles

Micro Agent and Neural Network based Model for Data Error Detection in a Real Time Data Stream

In this paper, we present a model for learning and detecting the presence of data type errors in a real time big data stream processing context. The proposed approach is based on a collection of micro-agents. Each micro-...

Analysis and Formal Model of RFID-Based Patient Registration System

Patient Registration System (PRS) is an important part of hospital environment. Therefore, semiformal model of Patient Registration System that registers the patients by assigning Radio Frequency Identification (RFID) ca...

Analysis of Resource Utilization on GPU

The problems arising due to massive data storage and data analysis can be handled by recent technologies, like cloud computing and parallel computing. MapReduce, MPI, CUDA, OpenMP, OpenCL are some of the widely available...

Person Detection from Overhead View: A Survey

In recent years, overhead view based person detection gained importance, due to handling occlusion problem and providing better coverage in scene, as com-pared to frontal view. In computer vision, overhead based person d...

Geographical Distance and Communication Challenges in Global Software Development: A Review

Due to innumerous advantages the Global software engineering is trending now a days in software development industry. Basic drivers for this trend are flexibility, faster development and expected cost saving. Software de...

Download PDF file
  • EP ID EP551378
  • DOI 10.14569/IJACSA.2019.0100432
  • Views 80
  • Downloads 0

How To Cite

Waleed K. AbdulRaheem, Sharifah Bte Md Yasin, Nur Izura Binti Udzir, Muhammad Rezal bin Kamel Ariffin (2019). Improving the Performance of {0,1,3}-NAF Recoding Algorithm for Elliptic Curve Scalar Multiplication. International Journal of Advanced Computer Science & Applications, 10(4), 275-279. https://europub.co.uk/articles/-A-551378