Fast transforms over finite fields of characteristic two

DOI10.1016/j.jsc.2020.10.002OpenAlexW3093950773MaRDI QIDQ2229746

Nicholas Coxon

Publication date: 18 February 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.07785

zbMATH Keywords

fast Fourier transformfinite fieldcharacteristic twoNewton basis

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Uses Software

• McBits

Cites Work

• Unnamed Item
• Unnamed Item
• On arithmetical algorithms over finite fields
• A cache-friendly truncated FFT
• Multi-point evaluation in higher dimensions
• Fast Hermite interpolation and evaluation over finite fields of characteristic two
• Fast Lagrange-Newton transformations
• Polynomial evaluation and interpolation on special sets of points
• Fast systematic encoding of multiplicity codes
• Faster Binary-Field Multiplication and Faster Binary-Field MACs
• McBits: Fast Constant-Time Code-Based Cryptography
• An in-place truncated fourier transform and applications to polynomial multiplication
• Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes
• FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes
• Efficient computation of the DFT with only a subset of input or output points
• Efficient generation of the binary reflected gray code and its applications
• The truncated fourier transform and applications
• McBits Revisited
• The Truncated Fourier Transform for Mixed Radices
• Frobenius Additive Fast Fourier Transform
• Computational Integrity with a Public Random String from Quasi-Linear PCPs
• Additive Fast Fourier Transforms Over Finite Fields
• Faster Multiplication in GF(2)[x]

This page was built for publication: Fast transforms over finite fields of characteristic two