Additive Fast Fourier Transforms Over Finite Fields

DOI10.1109/TIT.2010.2079016MaRDI QIDQ5281178zbMATH OpenFDO

Authors Shuhong Gao, Todd D. Mateer

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/TIT.2010.2079016

Mathematics Subject Classification ID

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

Cited in

(17)

• Two-server distributed ORAM with sublinear computation and constant rounds
• A practicable timing attack against HQC and its countermeasure
• Fast transforms over finite fields of characteristic two
• Fast Hermite interpolation and evaluation over finite fields of characteristic two
• Fast systematic encoding of multiplicity codes
• A New Algorithm for Decoding Reed-Solomon Codes
• Simple algorithms for decoding systematic Reed-Solomon codes
• Paraunitary filter banks over finite fields
• scientific article; zbMATH DE number 2147607 (Why is no real title available?)
• Multiplication
• Computational integrity with a public random string from quasi-linear PCPs
• Additive bases via Fourier analysis
• On interactive oracle proofs for Boolean R1CS statements
• Ligero: lightweight sublinear arguments without a trusted setup
• Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
• Uni/multi variate polynomial embeddings for zkSNARKs
• Magic pot: cryptanalysis of full AIM2 in the standard and related-/reused-key settings using new elimination framework

This page was built for publication: Additive Fast Fourier Transforms Over Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281178)