Pages that link to "Item:Q5625308"
From MaRDI portal
The following pages link to The Fast Fourier Transform in a Finite Field (Q5625308):
Displaying 23 items.
- Even faster integer multiplication (Q306687) (← links)
- Finite field trigonometric transforms (Q429771) (← links)
- The eigenstructure of finite field trigonometric transforms (Q551319) (← links)
- Finite field transforms and symmetry groups (Q1073775) (← links)
- Exact deconvolution using number-theoretic transforms (Q1123581) (← links)
- Group character tables in discrete transform theory (Q1143162) (← links)
- A note on discrete logarithms in finite fields (Q1196517) (← links)
- Fast modular transforms (Q1216049) (← links)
- Another polynomial homomorphism (Q1219683) (← links)
- Feedback shift registers, 2-adic span, and combiners with memory (Q1363072) (← links)
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions (Q2109992) (← links)
- A fast algorithm for computing the number of magic series (Q2155555) (← links)
- A class of functions with low-valued Walsh spectrum (Q2181219) (← links)
- Fractional Fourier, Hartley, cosine and sine number-theoretic transforms based on matrix functions (Q2405466) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform (Q2947104) (← links)
- Optimal Extension Field Inversion in the Frequency Domain (Q3519551) (← links)
- Precise deconvolution using the Fermat number transform (Q3750038) (← links)
- Faster integer multiplication using plain vanilla FFT primes (Q4683179) (← links)
- A novel approach for defining a Hilbert number transform (Q6046505) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
- Faster truncated integer multiplication (Q6203462) (← links)
