利用预处理机制以及改进NTT的多项式乘法运算方法
By employing a preprocessing mechanism and an improved NTT algorithm, the polynomial is decomposed into two linear terms in two variables. By utilizing incomplete NTT and inverse NTT algorithms, the number of multiplications is reduced, solving the problem of low efficiency in existing NTT algorithms and achieving efficient polynomial multiplication operations.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHINA UNIV OF GEOSCIENCES (WUHAN)
- Filing Date
- 2023-03-03
- Publication Date
- 2026-07-17
AI Technical Summary
The existing NTT algorithm is inefficient in polynomial multiplication operations, resulting in excessive overhead, especially in the case of large numbers where multiplication operations are extremely costly.
A preprocessing mechanism is adopted to split the polynomial into two linear polynomial terms in two variables. Multiplication and merging are performed using incomplete NTT and inverse NTT algorithms to reduce the number of multiplications and increase the number of additions and subtractions. However, in modern x86 architecture processors, the multiplication overhead is much higher than that of additions and subtractions.
It significantly reduces the number of multiplication operations and improves the efficiency of polynomial multiplication, especially enabling efficient polynomial multiplication operations in modern processors.
Smart Images
Figure CN116466912B_ABST