An Optimal Normal Basis Type II Multiplier over GF(2~n) for FPGAs
Yiqi Dai · Dianzi xuebao · 2002
The elliptic curve cryptosystems over the finite field GF(2n) receive considerable attention and are widely used because of their small key size and high security. Multiplication operation over the finite field GF(2n) is the crucial arithmetic operation. This paper presents a multiplication algorithm for the optimal normal basis type Ⅱ. The algorithm has the advantage of Massey-Omura multiplication algorithm and eliminate its deficiency.The test shows that this algorithm is simple,fast and is easy to be implemented by FPGA.