Fast arithmetics in Artin-Schreier towers over finite fields

DOI10.1016/J.JSC.2011.12.008MaRDI QIDQ420745zbMATHOpenAlexFDO

Authors Luca De Feo, Éric Schost

Publication date 23 May 2012

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2011.12.008

zbMATH Keywords

algorithmscomplexityArtin-Schreier towers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Fast arithmetics in Artin-Schreier towers over finite fields
• Isomorphisms between Artin-Schreier towers
• A tower of Artin-Schreier extensions of finite fields and its applications
• Fast algorithms for \(\ell\)-adic towers over finite fields
• Algorithms for finite field arithmetic

Cites work

• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 1113825 (Why is no real title available?)
• scientific article; zbMATH DE number 1113839 (Why is no real title available?)
• scientific article; zbMATH DE number 2151179 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• An elliptic curve trapdoor system
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Change of order for bivariate triangular sets
• Computing Frobenius maps and factoring polynomials
• Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
• Fast arithmetic for triangular sets: from theory to practice
• Fast arithmetics in Artin-Schreier towers over finite fields
• Fast construction of irreducible polynomials over finite fields
• Faster Multiplication in GF(2)[x]
• Finite fields: normal bases and completely free elements
• Isomorphisms between Artin-Schreier towers
• Modern computer algebra
• On Computing Factors of Cyclotomic Polynomials
• On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
• On arithmetical algorithms over finite fields
• Polynomial factorization over ${\mathbb F}_2$
• Solving zero-dimensional systems through the rational univariate representation
• The Magma algebra system. I: The user language

Cited in

(9)

• Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
• Fast arithmetics in Artin-Schreier towers over finite fields
• Efficient computation of maximal orders in Artin-Schreier extensions
• Accelerated tower arithmetic
• Fast arithmetic with general Gauß periods
• Modular composition via factorization
• Fast algorithms for \(\ell\)-adic towers over finite fields
• A tower of Artin-Schreier extensions of finite fields and its applications
• Explicit isogenies in quadratic time in any characteristic

Describes a project that uses

Uses Software

• Magma
• NTL
• ISOLATE

This page was built for publication: Fast arithmetics in Artin-Schreier towers over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420745)