The Design of Windowing Algorithm for Scalar Multiplication of the Elliptic Curve Cryptography Based on the Dyadic Groups
Guodong Wang · Journal of Kunming Teachers College · 2007
Based on the analysis of the traditional windowing algorithm(TWA) for the scalar point multiplication of the Elliptic Curve Cryptography,and by means of regular partition of the dyadic additive group,a new optimized algorithm,i.e.dyadic windowing algorithm(DWA),is presented.The characteristics of the DWA is having lower space complexity than the TWA,furthermore,having the TWA as its special case.Moreover,program implementation of the DWA is provided.