An algorithm for the construction of a normal basis

DOI10.1006/JNTH.1999.2388MaRDI QIDQ1306693zbMATH OpenOpenAlexFDO

Authors Kurt Girstmair

Publication date 11 November 1999

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jnth.1999.2388

zbMATH Keywords

algorithmic number theoryfield extensionnormal basis

Mathematics Subject Classification ID

Galois theory (11R32) Algebraic number theory computations (11Y40)

Recommendations

• Subquadratic-time algorithms for normal bases
• Quadratic-Time Algorithms for Normal Elements
• Algorithms to construct normal bases of cyclic number fields

Cites work

• A deterministic construction for normal bases of abelian extensions
• A Proof of the Normal Basis Theorem
• A remark on normal bases
• Algorithms to construct normal bases of cyclic number fields
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 4097511 (Why is no real title available?)
• scientific article; zbMATH DE number 3307642 (Why is no real title available?)
• The Normal Basis Theorem
• The Normal Basis Theorem

Cited in

(7)

• Algorithms to construct normal bases of cyclic number fields
• Subquadratic-time algorithms for normal bases
• Computing isomorphisms between lattices
• Algebraic construction of quasi-split algebraic tori
• Exact algorithms for p-adic fields and epsilon constant conjectures
• A Euclidean algorithm for normal bases
• Computing generators of free modules over orders in group algebras.

This page was built for publication: An algorithm for the construction of a normal basis

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