返回
Long Polynomial Modular Multiplication Using Low-Complexity Number Theoretic Transform
DOI:10.1109/MSP.2024.3368239.png)
摘要
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).
Keyword:
Convolution
Discrete Fourier transforms
Tutorials
Transforms
Polynomials
Homomorphic encryption
Optimization methods
Mathematics
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
PaReNTT: Low-Latency Parallel Residue Number System and NTT-Based Long Polynomial Modular Multiplication for Homomorphic EncryptionPaReNTT: 用于同态加密的低延迟并行残差数系统和基于NTT的长多项式模乘
没有更多内容

