Fast arithmetic for the algebraic closure of finite fields - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Fast arithmetic for the algebraic closure of finite fields

, (1) ,
1
L. de Feo
  • Function : Author
É. Schost
  • Function : Author

Abstract

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. Copyright is held by the owner/author(s).
Not file

Dates and versions

hal-02177228 , version 1 (08-07-2019)

Identifiers

Cite

L. de Feo, J. Doliskani, É. Schost. Fast arithmetic for the algebraic closure of finite fields. 2014 39th International Symposium on Symbolic and Algebraic Computation, ISSAC 2014, Jul 2014, kobe, Japan. pp.122-129, ⟨10.1145/2608628.2608672⟩. ⟨hal-02177228⟩
9 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More