A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Recently, implementations of normal basis multiplication over the extended binary field GF ð2 m Þ have received considerable attention. A class of low complexity normal bases called Gaussian normal bases has been included in a number of standards, such as IEEE  and NIST  for an elliptic curve digital signature algorithm. The multiplication algorithms presented there are slow in software since they rely on bit-wise inner product operations. In this paper, we present two vector-leveldoi:10.1109/tc.2006.10 fatcat:lllysbpbmbhpvi7jx6hqlsfmmi