Best of all windows for point multiplication in elliptic curve cryptosystems
Zhang Yan · Jisuanji gongcheng yu sheji · 2004
To improve rate of encryption and decryption in the elliptic curve cryptosystems, the key is key to calculate fast for the point multiplication. A basic form is to shrink the length of the 2 sequence representation of a number, and 2k sequence representation is consisted of dividing some in the 2 sequence representation. When the 2 sequence representation is changed, the 2k sequence representation, the optimum length of the windows for k is presented, so the best of all efficiency of the algorithm can be obtained.