Fixed window algorithm of scalar multiplication in elliptic curves
Hao Lin · Jisuanji gongcheng yu sheji · 2005
Elliptic curve cryptosystem is a hot topic in public key cryptosystems. The scalar multiplication in elliptic curves is the basic to elliptic curve cryptosystem. A fixed window algorithm, which uses 2 representation for large integer and acceptable computations, can greatly reduce the number of points addition, so the efficiency of the scalar multiplication in elliptic curves can be improved . Using mixed coordinates method to decrease the number of inversion in finite fields, a partial optimization algorithm can be obtained. The complexity analysis of the fixed window algorithm and the optimal length of window are also discussed.