Fast algorithms for l -adic towers over finite fields

DOI10.1145/2465506.2465956zbMath1360.11142arXiv1301.6021OpenAlexW2160227782MaRDI QIDQ2963230

Éric Schost, Javad Doliskani, Luca De Feo

Publication date: 10 February 2017

Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

elliptic curvesfinite fieldsPell's equationirreducible polynomialsalgebraic toriextension towers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (5)

Distorting the volcano ⋮ Directed evaluation ⋮ Standard generators of finite fields and their cyclic subgroups ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Accelerated tower arithmetic

This page was built for publication: Fast algorithms for l -adic towers over finite fields