Fast arithmetics in artin-schreier towers over finite fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Additive fast Fourier transforms over finite fields
IEEE Transactions on Information Theory
Fast arithmetics in Artin-Schreier towers over finite fields
Journal of Symbolic Computation
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Resolving the conflict between generality and plausibility in verified computation
Proceedings of the 8th ACM European Conference on Computer Systems
A new truncated fourier transform algorithm
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On the concrete efficiency of probabilistically-checkable proofs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.06 |
This manuscript describes a number of algorithms that can be used to quickly evaluate a polynomial over a collection of points and interpolate these evaluations back into a polynomial. Engineers define the “Fast Fourier Transform” as a method of solving the interpolation problem where the coefficient ring used to construct the polynomials has a special multiplicative structure. Mathematicians define the “Fast Fourier Transform” as a method of solving the evaluation problem. One purpose of the document is to provide a mathematical treatment of the topic of the “Fast Fourier Transform” that can also be understood by someone who has an understanding of the topic from the engineering perspective.The manuscript will also introduce several new algorithms that solve the fast multipoint evaluation problem over certain finite fields and require fewer finite field operations than existing techniques. The document will also demonstrate that these new algorithms can be used to multiply polynomials with finite field coefficients with fewer operations than Schönhage's algorithm in most circumstances.A third objective of this document is to provide a mathematical perspective of several algorithms which can be used to multiply polynomials of size which is not a power of two. Several improvements to these algorithms will also be discussed.Finally, the document will describe several applications of the “Fast Fourier Transform” algorithms presented and will introduce improvements in several of these applications. In addition to polynomial multiplication, the applications of polynomial division with remainder, the greatest common divisor, decoding of Reed-Solomon error-correcting codes, and the computation of the coefficients of a discrete Fourier Series will be addressed.