Taking roots over high extensions of finite fields

DOI10.1090/S0025-5718-2013-02715-9zbMath1285.11149arXiv1110.4350OpenAlexW2092948697MaRDI QIDQ2862538

Éric Schost, Javad Doliskani

Publication date: 15 November 2013

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.4350

zbMATH Keywords

square rootsfinite field arithmeticroot extraction

Mathematics Subject Classification ID

Related Items (7)

Multiradical isogenies ⋮ On the Cipolla-Lehmer type algorithms in finite fields ⋮ Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Effective black-box constructive recognition of classical groups. ⋮ Computing in degree \(2^k\)-extensions of finite fields of odd characteristic ⋮ Modular composition via factorization

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Genus 2 point counting over prime fields
• Improved generalized Atkin algorithm for computing square roots in finite fields
• Matrix multiplication via arithmetic progressions
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• On fast multiplication of polynomials over arbitrary algebras
• Fast rectangular matrix multiplication and applications
• Taking cube roots in \(\mathbb Z_{m}\)
• On the computation of square roots in finite fields
• Computing Frobenius maps and factoring polynomials
• Efficient computation of roots in finite fields
• Fast multiplication of large numbers
• A Refinement of H. C. Williams' qth Root Algorithm
• Fast Polynomial Factorization and Modular Composition
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Fast Algorithms for Manipulating Formal Power Series
• Improved Computation of Square Roots in Specific Finite Fields
• Fast construction of irreducible polynomials over finite fields

This page was built for publication: Taking roots over high extensions of finite fields