Fast transforms over finite fields of characteristic two

Transformées rapides sur les corps finis de caractéristique deux

Nicholas Coxon (1)

1 GRACE - Geometry, arithmetic, algorithms, codes and encryption

An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an F_2-linear subspace of the field. We view these transforms as performing a change of basis from the monomial basis to the associated Lagrange basis, and consider the problem of performing the various conversions between these two bases, the associated Newton basis, and the " novel " basis of Lin, Chung and Han (FOCS 2014). Existing algorithms are divided between two families, those designed for arbitrary subspaces and more efficient algorithms designed for specially constructed subspaces of fields with degree equal to a power of two. We generalise techniques from both families to provide new conversion algorithms that may be applied to arbitrary subspaces, but which benefit equally from the specially constructed subspaces. We then construct subspaces of fields with smooth degree for which our algorithms provide better performance than existing algorithms.

Domaines: Calcul formel [cs.SC]; Complexité [cs.CC]

Nicholas Coxon. Fast transforms over finite fields of characteristic two. 2018. ⟨hal-01845238v1⟩