Serial multiplier architectures over GF(2/sup n/) for elliptic curve cryptosystems
Lejla Batina, Nele Mentens, Berna Örs, Bart Preneel · 2004
We present an FPGA implementation of a new multiplier for binary finite fields that combines two previously known methods. The multiplier is designed for polynomial bases which allow more flexibility in hardware and is dedicated to efficient implementations of elliptic curve cryptography. An extension to a digit-serial architecture is also sketched. For the introduced architecture we also discuss resistance to side-channel attacks.