Additive Fast Fourier Transforms Over Finite Fields

DOI10.1109/TIT.2010.2079016zbMath1367.65197MaRDI QIDQ5281178

Todd D. Mateer, Shuhong Gao

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

A New Algorithm for Decoding Reed-Solomon Codes ⋮ A practicable timing attack against HQC and its countermeasure ⋮ Simple algorithms for decoding systematic Reed-Solomon codes ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Fast systematic encoding of multiplicity codes ⋮ Syndrome decoding in the head: shorter signatures from zero-knowledge proofs ⋮ Fast transforms over finite fields of characteristic two ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ Unnamed Item ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs