The Polynomial Transform

12/03/2019

∙

by   Matt Groff, et al.

∙

0

∙

share

We explore a new form of DFT, which we call the Polynomial Transform. It functions over finite fields,or DFTs, of size m3 for m prime and of the form 3l+1 for some natural l. It uses only O(m3) arithmetic operations on numbers of size log m, and takes total time NKlogN , for N = Θ(m3 log m).