加载中…
2021-10-26
The equivariant complexity of multiplication in finite field extensions
Jean-Marc CouveignesTony Ezome
文献摘要
We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本