arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.09746cs.SCmath.NT
收藏

长二元多项式的快速乘法

Faster Multiplication for Long Binary Polynomials

Ming-Shing Chen, Chen-Mou Cheng, Po-Chun Kuo, Wen-Ding Li, Bo-Yin Yang

摘要:

我们为特征为2的有限域上的长多项式相乘创造了新的速度记录。我们的乘法算法基于Lin,Chung和Huang在2014年提出的加法FFT(快速傅立叶变换),与之前基于乘法FFT的最佳结果相比。这两种方法对于基础有限域上的算术运算具有相似的复杂度;然而,我们的实现表明,加性FFT具有更少的开销。为了进一步优化,我们采用了塔场结构,因为加法FFT中的乘法器自然会落入较小的子场中,这导致在现代CPU中使用查表指令来加速。基准测试表明,我们的方法节省了约$40 \%$计算时间时,乘多项式的$2^{28}$和$2^{29}$比特相比,以前的乘法FFT实现。

英文摘要:

We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously best results based on multiplicative FFTs. Both methods have similar complexity for arithmetic operations on underlying finite field; however, our implementation shows that the additive FFT has less overhead. For further optimization, we employ a tower field construction because the multipliers in the additive FFT naturally fall into small subfields, which leads to speed-ups using table-lookup instructions in modern CPUs. Benchmarks show that our method saves about $40 \%$ computing time when multiplying polynomials of $2^{28}$ and $2^{29}$ bits comparing to previous multiplicative FFT implementations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑