Computing in degree 2^k -extensions of finite fields of odd characteristic

Designs, Codes and Cryptography（2013）

引用 10|浏览5

暂无评分

摘要

We show how to perform basic operations (arithmetic, square roots, computing isomorphisms) over finite fields of the form 𝔽 _q^2^k in essentially linear time.

查看译文

关键词

Finite field,Algebraic closure,Complexity,Square root

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要