Fast arithmetic for the algebraic closure of finite fields
ISSAC(2014)
摘要
We present algorithms to construct and do arithmetic operations in the algebraic closure of the finite field Fp. Our approach is inspired by algorithms for constructing irreducible polynomials, which first reduce to prime power degrees, then use composita techniques. We use similar ideas to give efficient algorithms for embeddings and isomorphisms.
更多查看译文
关键词
algorithms,computations in finite fields,extensions,finite fields,irreducible polynomials,theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络