New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

Abstract

We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal and polynomial basis multipliers for the five binary fields GF(2m),m = 163, 233, 283, 409, 571, recommended by NIST for elliptic curve digital signature algorithm. © Springer-Verlag Berlin Heidelberg 2006.