Quadratic-Time Algorithms for Normal Elements

DOI10.1145/3326229.3326260MaRDI QIDQ5121105zbMATH OpenOpenAlexWikidataFDO

Authors Armin Jamshidpey, Éric Schost, Mark Giesbrecht

Publication date 10 September 2020

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

Full work available at URL https://doi.org/10.1145/3326229.3326260

zbMATH Keywords

fast algorithmsGalois groupsmetacyclic groupsnormal bases

Mathematics Subject Classification ID

Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Subquadratic-time algorithms for normal bases
• Quadratic-time certificates in linear algebra
• Primitive normalisers in quasipolynomial time
• scientific article; zbMATH DE number 4132307
• Computing absolutely normal numbers in nearly linear time
• scientific article; zbMATH DE number 733559
• A polynomial-time algorithm for computing absolutely normal numbers
• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
• Polynomial-time normalizers
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case

Cited in

(6)

• An algorithm for the construction of a normal basis
• Subquadratic-time algorithms for normal bases
• Constructing normal bases in finite fields
• scientific article; zbMATH DE number 1262434 (Why is no real title available?)
• scientific article; zbMATH DE number 1942456 (Why is no real title available?)
• Orbits of normal basis generators

This page was built for publication: Quadratic-Time Algorithms for Normal Elements

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