Fast algorithm of scalar multiplication based on recoding
基于重编码的快速标量乘算法*

This paper designed a recoding algorithm which scans the sequence of the scalar only once, employed four intermediate variables at most as well as comparisons and evaluations on digits. The algorithm was more efficientand more convenient to application of scalar multiplication on hardware. The result is proved to possess the character of the canonicalrepresentation. When the algorithm is applied to compute gP+hQin digital signatures,the result is unique,optimaland has the least joint weight.