Fast Comb-multiplication without Shift Operation
Hao Yue-tong · 2009
Efficient algorithms for multiplication in GF(2n) are required to implement elliptic curve cryptosystems over GF(2n).Comb-multiplication,based on window technology,is considered one of the fastest algorithms for multiplication in GF(2n).However,it includes SHIFT operations,and SHIFT operations are just time-consuming operation among the operations of multuiplication in GF(2n).A new algorithm for multiplication in GF(2n),based on window technology,was presented,it completely avoided the SHIFT operations,and did not increase the number of XOR operations.The analysis and experiment results show that the new algorithm is faster than the comb-multiplication based on window technology,and is particularly useful for software implementation of elliptic curve cryptosystems over GF(2n).