arrow
Return

Long Polynomial Modular Multiplication Using Low-Complexity Number Theoretic Transform

delete2024-04-16
delete0
PRE
AI
S
Sin-Wei Chiu *
K
Keshab K. Parhi
DOI:10.1109/MSP.2024.3368239delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

IEEE Signal Processing Magazine cover
IEEE Signal Processing Magazine
IF:
9.6
Papers:
1.1W
Citations:
1.7W

Organization

U
University of Minnesota Twin Cities
Scholars:
3.7W
Papers: 3.1W
Citations: 58
Cited Papers

Cited Papers

Animal species detection and classification framework based on modified multi-scale attention mechanism and feature pyramid network
err2022-07-01
err0
errOAAI
errChiagoziem C. Ukwuoma; Zhiguang Qin; Sophyani B. Yussif; Monday N. Happy; Grace U. Nneji; Gilbert C. Urama; Chibueze D. Ukwuoma; Nimo B. Darkwa; Harriet Agobah
errShare
errSave
Thermal and mechanical stability of retained austenite in high carbon steel: An in - situ investigation
err2016-01-01
err0
PREAI
errAbhilash Molkeri; Farshid Pahlevani; Irene Emmanuelawati; Veena Sahajwalla
errShare
errSave
Survey on Fully Homomorphic Encryption, Theory, and Applications
err2022-10-01
err64
errOAAI
errMarcolla, Chiara; Sucasas, Victor; Manzano, Marc; Bassoli, Riccardo; Fitzek, Frank H. P.; Aaraj, Najwa
errShare
errSave
Number Theoretic Transforms for Secure Signal Processing
err2017-05-01
err33
errOAAI
errPedrouzo-Ulloa, Alberto; Ramon Troncoso-Pastoriza, Juan; Perez-Gonzalez, Fernando
errShare
errSave
no more