Fast arithmetics in Artin-Schreier towers over finite fields
DOI10.1016/J.JSC.2011.12.008zbMATH Open1267.11126OpenAlexW2951648961MaRDI QIDQ420745FDOQ420745
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
Recommendations
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)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving zero-dimensional systems through the rational univariate representation
- Change of order for bivariate triangular sets
- Title not available (Why is that?)
- Modern computer algebra
- Title not available (Why is that?)
- An elliptic curve trapdoor system
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Computing Frobenius maps and factoring polynomials
- Title not available (Why is that?)
- Fast construction of irreducible polynomials over finite fields
- On arithmetical algorithms over finite fields
- Finite fields: normal bases and completely free elements
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Isomorphisms between Artin-Schreier towers
- Fast arithmetics in Artin-Schreier towers over finite fields
- On Computing Factors of Cyclotomic Polynomials
- Polynomial factorization over ${\mathbb F}_2$
- Title not available (Why is that?)
- Fast arithmetic for triangular sets: from theory to practice
- Faster Multiplication in GF(2)[x]
Cited In (9)
- Accelerated tower arithmetic
- Fast arithmetic with general Gauß periods
- Fast arithmetics in Artin-Schreier towers over finite fields
- Modular composition via factorization
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Efficient computation of maximal orders in Artin-Schreier extensions
- Explicit isogenies in quadratic time in any characteristic
- Fast algorithms for \(\ell\)-adic towers over finite fields
- A tower of Artin-Schreier extensions of finite fields and its applications
Uses Software
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)
