Long Polynomial Modular Multiplication Using Low-Complexity Number Theoretic Transform [Lecture Notes]
Long Polynomial Modular Multiplication Using Low-Complexity Number Theoretic Transform [Lecture Notes]
复制标题
DOI：
10.1109/msp.2024.3368239
复制
发表时间：
2023-06
影响因子：
14.9
通讯作者：
S.W. Chiu;K. Parhi
中科院分区：
文献类型：
--
作者：
S.W. Chiu;K. Parhi
本教程旨在建立多项式模乘法在环到圆卷积和离散傅立叶变换（DFT）之间的联系。主要目标是将众所周知的DFT理论在信号处理（SP）中扩展到涉及环中多项式的其他应用，例如同态加密（HE）。
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).