Low complexity normal bases in \(\mathbb F_{2^n}\)

DOI10.1016/S1071-5797(03)00040-6zbMath1044.11105MaRDI QIDQ1418182

Daniel Panario, Benjamin J. Young

Publication date: 19 January 2004

Published in: Finite Fields and their Applications (Search for Journal in Brave)

zbMATH Keywords

Multiplication tablesNormal elementsOptimal normal bases

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (5)

A new criterion on normal bases of finite field extensions ⋮ Gauss periods as constructions of low complexity normal bases ⋮ On the complexity of the dual basis of a type I optimal normal basis ⋮ On the complexity of the normal bases via prime Gauss period over finite fields ⋮ The trace of an optimal normal element and low complexity normal bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low complexity normal bases
• Optimal normal bases
• Algorithms for exponentiation in finite fields
• Matrix fields over finite extensions of prime fields

This page was built for publication: Low complexity normal bases in \(\mathbb F_{2^n}\)