The Fast Fourier Transform in a Finite Field
From MaRDI portal
Cites work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Computing Multiplicative Inverses in GF(p)
- scientific article; zbMATH DE number 3752962 (Why is no real title available?)
- scientific article; zbMATH DE number 3264869 (Why is no real title available?)
- scientific article; zbMATH DE number 3269473 (Why is no real title available?)
- scientific article; zbMATH DE number 3338265 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- scientific article; zbMATH DE number 3061638 (Why is no real title available?)
- scientific article; zbMATH DE number 3077849 (Why is no real title available?)
- Matrix Multiplication and Fast Fourier Transforms
- Primitive Trinomials of High Degree
- Three New Mersenne Primes and a Statistical Theory
Cited in
(42)- Finite field transforms and symmetry groups
- Exact deconvolution using number-theoretic transforms
- Group character tables in discrete transform theory
- A note on discrete logarithms in finite fields
- Fast modular transforms
- Another polynomial homomorphism
- Feedback shift registers, 2-adic span, and combiners with memory
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- A fast algorithm for computing the number of magic series
- A class of functions with low-valued Walsh spectrum
- Fractional Fourier, Hartley, cosine and sine number-theoretic transforms based on matrix functions
- Integer multiplication in time \(O(n\log n)\)
- An elliptic curve cryptographic processor using Edwards curves and the number theoretic transform
- Even faster integer multiplication
- Optimal Extension Field Inversion in the Frequency Domain
- Precise deconvolution using the Fermat number transform
- Computational Complexity of Fourier Transforms Over Finite Fields
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Finite field trigonometric transforms
- Faster integer multiplication using plain vanilla FFT primes
- Group Convolutions and Matrix Transforms
- Communication complexity of matrix computation over finite fields
- Polynomial multiplication over finite fields in time O(n n)
- Multiplication
- The eigenstructure of finite field trigonometric transforms
- Algebraic complexities and algebraic curves over finite fields
- A novel approach for defining a Hilbert number transform
- A survey of elliptic curves for proof systems
- Batched fully homomorphic encryption from TFHE
- Fast norm computation in smooth-degree abelian number fields
- A novel approach for computation of morphological operations using the number theoretic transform
- Faster truncated integer multiplication
- Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
- Quantum circuits for high-degree and half-multiplication for post-quantum analysis
- A fast multiplication algorithm and RLWE-PLWE equivalence for the maximal real subfield of the 2rp^s-th cyclotomic field
- Rhizomes and the roots of efficiency -- improving Prio
- Fast multiplication and the PLWE-RLWE equivalence for an infinite family of maximal real subfields of cyclotomic fields
- Computing \(\pi (N)\): an elementary approach in \(\tilde{O}(\sqrt{N})\) time
- Frequency distance sequences for packet detection in physical-layer security. In memory of Kai-Uwe Schmidt
- SMALL: \underline{S}calable \underline{M}atrix origin\underline{A}ted \underline{L}arge integer po\underline{L}ynomial multiplication \underline{A}ccelerator for lattice-based post-quantum cryptography
- Towards a library for straight-line programs
- A survey of polynomial multiplications for lattice-based cryptosystems
This page was built for publication: The Fast Fourier Transform in a Finite Field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625308)
