Frobenius加性快速傅里叶变换
Frobenius Additive Fast Fourier Transform
摘要:
在ISSAC 2017中,van der Hoeven和Larrieu表明,在GF($q^d$)的所有n阶单位根处计算GF(q)[x]中次数<n的多项式P,基本上可以比在所有这些根处计算GF($q^d$)[x]中的Q快d倍,假设GF($q^d$)包含本原n阶单位根。这一发现被称为Frobenius FFT,对多项式乘法,特别是二进制多项式乘法产生了深远的影响,在编码理论和密码学中有着广泛的应用。在本文中,我们表明,Frobenius FFT的理论漂亮地推广到一类加性FFT康托和高Mateer。此外,我们证明了Frobenius加法FFT在q=2时的能力:将两个乘积次数<256的二进制多项式相乘,新技术只需要29,005位操作,而之前报道的最佳结果是33,397。据我们所知,这是基于FFT的乘法第一次在位操作计数方面以如此低的程度优于Karatsuba等。
英文摘要:
In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P in GF(q)[x] of degree <n at all n-th roots of unity in GF($q^d$) can essentially be computed d-time faster than evaluating Q in GF($q^d$)[x] at all these roots, assuming GF($q^d$) contains a primitive n-th root of unity. Termed the Frobenius FFT, this discovery has a profound impact on polynomial multiplication, especially for multiplying binary polynomials, which finds ample application in coding theory and cryptography. In this paper, we show that the theory of Frobenius FFT beautifully generalizes to a class of additive FFT developed by Cantor and Gao-Mateer. Furthermore, we demonstrate the power of Frobenius additive FFT for q=2: to multiply two binary polynomials whose product is of degree <256, the new technique requires only 29,005 bit operations, while the best result previously reported was 33,397. To the best of our knowledge, this is the first time that FFT-based multiplication outperforms Karatsuba and the like at such a low degree in terms of bit-operation count.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。