Fast arithmetic for the algebraic closure of finite fields

L. de Feo J. Doliskani 1 É. Schost
1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
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).
Keywords : Extensions Finite fields Irreducible polynomials
Document type :
Conference papers
Complete list of metadatas
https://hal.uvsq.fr/hal-02177228
Contributor : Équipe Hal Uvsq <>
Submitted on : Monday, July 8, 2019 - 5:15:23 PM
Last modification on : Tuesday, July 9, 2019 - 1:27:43 AM

Links full text

openaccess

Identifiers

Collections

LM-VERSAILLES | UVSQ | INSMI | PRISM

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

14

Contact

CCSD