.png){kind=icon}
.png){kind=icon}
Return
Long Polynomial Modular Multiplication Using Low-Complexity Number Theoretic Transform
.png){kind=icon}
PRE
AI
DOI：10.1109/MSP.2024.3368239.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This tutorial aims to establish connections between polynomial modular multiplication over a ring to circular convolution and the discrete Fourier transform (DFT). The main goal is to extend the well-known theory of the DFT in signal processing (SP) to other applications involving polynomials in a ring, such as homomorphic encryption (HE).
Keywords:
Convolution
Discrete Fourier transforms
Tutorials
Transforms
Polynomials
Homomorphic encryption
Optimization methods
Mathematics
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W