A fast algorithm for the Fourier transform over finite fields and its VLSI implementation

No abstract is available for this paper.

• Publication year

  1988

• Venue

  IEEE J. Sel. Areas Commun.

• Publication date

  1988-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/49.1926
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Theory and practice of error control codes

  1983cited by this paper

• Cooley-Tukey FFT over $\mathbb{Q}_p$ via Unramified Cyclotomic Extension

  2025cites this paper
• Advances in Reed-Solomon Code-Based Masking and Application to ML-KEM

  2025cites this paper
• The polynomial based method for the discrete Fourier transform computation over the finite field

  2025cites this paper
• Trimmed FFTs and Applications to Coding and Secret Sharing

  2025cites this paper
• Accelerating Post-quantum Secure zkSNARKs by Optimizing Additive FFT

  2025cites this paper
• Efficient Interpolation-Based Decoding of Reed-Solomon Codes

  2023cites this paper
• Quasi-linear masking to protect against both SCA and FIA

  2023cites this paper
• Quasi-linear masking against SCA and FIA, with cost amortization

  2023cites this paper
• Quasi-linear Masking to Protect Kyber against both SCA and FIA

  2023cites this paper
• Syndrome Decoding in the Head: Shorter Signatures from Zero-Knowledge Proofs

  2022cites this paper
• Probing Security through Input-Output Separation and Revisited Quasilinear Masking

  2021cites this paper
• Computing the distribution of the Robinson-Foulds distance

  2020cites this paper
• Fast finite field arithmetic

  2019cites this paper
• CYCLOTOMIC FAST FOURIER TRANSFORM

  2019cites this paper
• Multiplier-Free Implementation of Galois Field Fourier Transform on a FPGA

  2019cites this paper
• Fast transforms over finite fields of characteristic two

  2018cites this paper
• Encoding of Non-binary Quasi-cyclic Codes by Lin-Chung-Han Transform

  2018cites this paper
• Accelerating pre- and post-quantum cryptography

  2016cites this paper
• Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes

  2016cites this paper
• Polynomial Evaluation and Side Channel Analysis

  2015cites this paper
• Design of cyclotomic Fast Fourier Transform architecture over Galois field for 15 point DFT

  2015cites this paper
• On The Parallelization Of Integer Polynomial Multiplication

  2014cites this paper
• Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes

  2014cites this paper
• A Hybrid Decoding Scheme for Short Non-Binary LDPC Codes

  2014cites this paper
• The design approach for fast computation of fourier transform over a finite field

  2014cites this paper
• McBits: Fast Constant-Time Code-Based Cryptography

  2013cites this paper
• On Algorithms and Complexities of Cyclotomic Fast Fourier Transforms Over Arbitrary Finite Fields

  2012cites this paper
• On the additive complexity of the cyclotomic FFT algorithm

  2012cites this paper
• On the Use of Shamir's Secret Sharing against Side-Channel Analysis

  2012cites this paper
• Decoding nonsystematic Reed-Solomon codes using the Berlekamp-Massey algorithm

  2011cites this paper
• Signal Processing Algorithms and Their Applications

  2011influential citation
• A Future Simplification of Procedure for Decoding Nonsystematic Reed-Solomon Codes Using the Berlekamp-Massey Algorithm

  2011cites this paper
• Fast fourier transforms over poor fields

  2011cites this paper
• Computational complexity of cyclotomic fast Fourier transforms over characteristic-2 fields

  2011cites this paper
• New Area-Time Lower Bounds for the Multidimensional DFT

  2011cites this paper
• Truncated Fast Fourier Transform algorithms

  2011cites this paper
• Composite Cyclotomic Fourier Transforms With Reduced Complexities

  2010cites this paper
• Additive Fast Fourier Transforms Over Finite Fields

  2010influential citation
• Prime factor cyclotomic Fourier transforms with reduced complexity over finite fields

  2010cites this paper
• Fast Algorithms for Towers of Finite Fields and Isogenies. (Algorithmes Rapides pour les Tours de Corps Finis et les Isogénies)

  2010cites this paper
• Simplified procedure for decoding nonsystematic reed-solomon codes over gf(2m) using euclid's algorithm and the fast fourier transform

  2009cites this paper
• Fast arithmetics in artin-schreier towers over finite fields

  2009cites this paper
• Cyclotomic FFT of Length 2047 Based on a Novel 11-point Cyclic Convolution

  2008cites this paper
• Contribution to the study of the common FFT operator in Software radio context: application to channel coding. (Contribution à l'étude de l'opérateur commun FFT dans le contexte de la Radio logicielle : application au codage de canal)

  2008cites this paper
• Complexity Analysis of Reed-Solomon Decoding over GF(2m) without Using Syndromes

  2008influential citation
• Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm

  2007influential citation
• Simplified procedure for decoding reed-solomon codes using Euclid’s algorithm and the fast fourier transform over GF(2m)

  2007cites this paper
• Complexity Analysis of The GAO Algorithm

  2007cites this paper
• On the FPGA implementation of the Fourier Transform over finite fields GF(2m)

  2007influential citation
• Reduced-Complexity Cyclotomic FFTs

  2007influential citation
• A Fast Algorithm for the Syndrome Calculation in Algebraic Decoding of Reed–Solomon Codes

  2007cites this paper
• Efficient Implementation of DFT over GF(qm)

  2006cites this paper
• A method for computation of the discrete Fourier transform over a finite field

  2006influential citation
• Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8 leq m leq 10

  2006cites this paper
• A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm

  2005cites this paper
• Fast, prime factor, discrete Fourier transform

  2004cites this paper
• An efficient prime-length DFT algorithm over finite fields GF(2m)

  2003cites this paper
• A Method for Fast Computation of the Fourier Transform over a Finite Field

  2003cites this paper
• Design of Multiple-Valued Logic Circuits on Reed-Muller Expansions Using Perfect Shuffle

  2002cites this paper
• Developments in Error Control Coding Techniques and some Results on Concatenated Codes

  1990cites this paper
• Quasilinear Masking to Protect ML-KEM Against Both SCA and FIA ⋆

  year unknowncites this paper
• Securing Lattice-Based KEMs with Code-Based Masking: A Theoretical Approach ⋆

  year unknowncites this paper
• Quasi-linear masking against SCA and FIA, 1 with cost amortization 2

  year unknowncites this paper
• Ieee Transactions on Information Forensics and Security an Efficient (n, K) Information Dispersal Algorithm Based on Fermat Number Transforms

  year unknowncites this paper