Pages that link to "Item:Q3036662"
From MaRDI portal
The following pages link to Fast polynomial transform algorithms for digital convolution (Q3036662):
Displaying 18 items.
- Faster polynomial multiplication via multipoint Kronecker substitution (Q840717) (← links)
- A cache-friendly truncated FFT (Q1029334) (← links)
- Special algorithms for convolutions over Galois fields (Q1071810) (← links)
- On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption (Q1746967) (← links)
- Improved fast polynomial transform algorithm for cyclic convolutions (Q1902509) (← links)
- On algorithms for digital signal processing of sequences (Q1922614) (← links)
- Saber on ESP32 (Q2229290) (← links)
- Fast systematic encoding of multiplicity codes (Q2422714) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited (Q2672460) (← links)
- Irregular primes to 163 million (Q3094304) (← links)
- Detecting perfect powers in essentially linear time (Q4396462) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms (Q5957034) (← links)
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented (Q6605315) (← links)
- Exploring the advantages and challenges of Fermat NTT in FHE acceleration (Q6652893) (← links)