Fast convolution structures are mathematically equivalent to fast algorithms for parallel FIR filters, polynomial modular multiplication, and pointwise multiplication in the DFT/NTT domains.
KyberMat: Efficient accelerator for matrix-vector polynomial multiplication in CRYSTALS-Kyber scheme via NTT and polyphase decomposition
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Equivalence of Fast Algorithms for Convolution, Parallel FIR Filters, Polynomial Modular Multiplication, and Pointwise Multiplication in DFT/NTT Domain
Fast convolution structures are mathematically equivalent to fast algorithms for parallel FIR filters, polynomial modular multiplication, and pointwise multiplication in the DFT/NTT domains.