Fast Implementation of Elliptic Curve Scalar Multiplication
Jianfeng Ma · Jisuanji gongcheng · 2004
This paper presents a new algorithm to quickly implement the fixed point scalar multiplication.This algorithm is much faster than fixed-base windowing method, and a little faster than fixed-base comb method when the amount of precomputation is less than 255.Furthermore,this algorithm can change the amount of time and memory to fit various platform environments.