Spectral modular arithmetic for binary extension fields

We describe a method of carrying multiplication in the binary extension fields. The new method fully operates on the Fourier representations of the field elements by successively applying the convolution property and a reduction technique defined on the Fourier coefficients. With some careful parameter selection, the method yields highly parallel architectures for operations involving several field multiplications such as the scalar multiplication calculation of elliptic curve cryptography.