arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.16082math.AG
收藏

Multiplication in finite fields with Chudnovsky-type algorithms on the projective line

Stéphane Ballet, Alexis Bonnecaze, Bastien Pacifico

英文摘要:

We propose a Recursive Polynomial Generic Construction (RPGC) of multiplication algorithms in any finite field $\mathbb{F}_{q^n}$ based on the method of D.V. and G.V. Chudnovsky specialized on the projective line. They are usual polynomial interpolation algorithms in small extensions and the Karatsuba algorithm is seen as a particular case of this construction. Using an explicit family of such algorithms, we show that their bilinear complexity is quasi-linear with respect to the extension degree n, and we give a uniform bound for this complexity. We also prove that the construction of these algorithms is deterministic and can be done in polynomial time. We give an asymptotic bound for the complexity of their construction.

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

↑