Additive fast Fourier transforms over finite fields

Authors:
Shuhong Gao;Todd Mateer
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC;Mathematics Division, Howard Community College, Columbia, MD
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 7
Cited 1

On arithmetical algorithms over finite fields

Journal of Combinatorial Theory Series A
Arithmetic and factorization of polynomial over F2 (extended abstract)

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Modern Computer Algebra

Modern Computer Algebra
A Method for Fast Computation of the Fourier Transform over a Finite Field

Problems of Information Transmission
A method for computation of the discrete Fourier transform over a finite field

Problems of Information Transmission
Fast fourier transform algorithms with applications

Fast fourier transform algorithms with applications
Cyclotomic FFTs with reduced additive complexities based on a novel common subexpression elimination algorithm

IEEE Transactions on Signal Processing

McBits: fast constant-time code-based cryptography

CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems

Quantified Score

Hi-index	754.84

Visualization

Abstract

We present new additive Fast Fourier Transform (FFT) algorithms based on Taylor expansions over finite fields of characteristic two. The new algorithms improve previous approaches by Wang and Zhu (1988), Cantor (1989), and von zur Gathen and Gerhard (1996).