A NAF_ω algorithm for detection window
Shen Xianqing · Electronic Design Engineering · 2012
The point multiplication on elliptic curves is a key operation for Elliptic Curve Cryptography.Its speed affect the speed of ECC directly.The width w of the non-adjacent form(NAF) algorithm is analyzed and a NAFω algorithm for detection window is proposed by the character of NAF in this article.This algorithm reduces the number of times for the shift operations and XOR to shorten the computing time.The modeling and simulation results show that the time consumption of detection window method is about times for the original algorithm and the computational efficiency is also improving with ω increase.