Abstract: Efficient algorithms for multiplication in GF（2^n） are required to implement elliptic curve cryptosystems over GF（2^n）. Comb-multiplication, based on window technology, is considered one of the fastest algorithms for multiplication in GF（2^n）. However, it

Key words: Multiplication in GF（2^n）, Shift operation, Comb multiplication, Elliptic curve cryptography