Journal of Computer Science

Optimizing {0, 1, 3}-NAF Recoding Algorithm Using Block-Method Technique in Elliptic Curve Cryptosystem

Mohsen Bafandehkar, Sharifah Md Yasin and Ramlan Mahmod

DOI : 10.3844/jcssp.2016.534.544

Journal of Computer Science

Volume 12, Issue 11

Pages 534-544

Abstract

The most expensive and time-consuming operation in Elliptic curve cryptosystem is scalar multiplication operation. Optimization of scalar multiplication will substantially enhance the ECC performance. Scalar multiplication can be improved by using an enhanced scalar recoding algorithm that can decrease the number of operations in the scalar representation process. The objective of this research is to introduce an efficient design and implementation of {0,1,3}-NAF scalar recoding algorithm by applying block method technique. The base algorithm has a complex look up table. With block method application on base algorithm, a complex look up table is undesired. Instead a fix look up table is introduced with less computation required for recoding. The Big-O notation is used to measure the complexity and (µs) used to evaluate the running time of base and proposed algorithm.

Copyright

© 2016 Mohsen Bafandehkar, Sharifah Md Yasin and Ramlan Mahmod. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.