An algorithm for the construction of a normal basis

DOI10.1006/jnth.1999.2388zbMath0954.11035OpenAlexW1966502132MaRDI QIDQ1306693

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

field extensionnormal basisalgorithmic number theory

Mathematics Subject Classification ID

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

Related Items (5)

Computing isomorphisms between lattices ⋮ Algebraic construction of quasi-split algebraic tori ⋮ Computing generators of free modules over orders in group algebras. ⋮ Exact algorithms for \(p\)-adic fields and epsilon constant conjectures ⋮ Subquadratic-time algorithms for normal bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms to construct normal bases of cyclic number fields
• A remark on normal bases
• A Proof of the Normal Basis Theorem
• The Normal Basis Theorem
• A deterministic construction for normal bases of abelian extensions
• The Normal Basis Theorem

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