A fast multiplier over GF (2^n)
M.J. Potgieter, BJ van Dyk, T.J. Tjalkens · TU/e Research Portal · 2002
In this paper we will present a hardware implementation of a GF(2n) polynomial basis multiplier that is twice as fast a the classical multiplier while requiring about 50 % more chip area. We implement a flexible scalar (or point) multiplier for elliptic curve cryptosystems using this multiplier and find that the flexible system performs almost twice as fast as compared with the classical multiplier.