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

DOI10.1007/s10623-013-9875-7zbMath1342.11098OpenAlexW1973942261MaRDI QIDQ2260788

Javad Doliskani, Éric Schost

Publication date: 12 March 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-013-9875-7

zbMATH Keywords

complexityfinite fieldalgebraic closuresquare root

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20)

Related Items (2)

Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Explicit isogenies in quadratic time in any characteristic

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Genus 2 point counting over prime fields
• Fast arithmetics in Artin-Schreier towers over finite fields
• Homotopy techniques for multiplication modulo triangular sets
• On fast multiplication of polynomials over arbitrary algebras
• Computing Frobenius maps and factoring polynomials
• Taking roots over high extensions of finite fields
• Fast Polynomial Factorization and Modular Composition
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Fast Algorithms for Manipulating Formal Power Series
• Fast construction of irreducible polynomials over finite fields

This page was built for publication: Computing in degree \(2^k\)-extensions of finite fields of odd characteristic