Multiplication of polynomials over the binary field

Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(logn)(\log \log n{)}^2)$.