An Optimization to Multiplication with Normal Basis in GF(2~m)
Zhou Xian-chang · Journal of Nanchang University · 2008
GF(2m) is widely used in Elliptic Curve Cryptography as the base finite field,as a result,the efficiency of multiplication in GF(2m) is of great importance.It is concerned with the multiplication with normal basis in GF(2m),and proposes an optimization to the multiplication implementation.