Low complexity of a class of normal bases over finite fields

DOI10.1016/J.FFA.2010.09.005zbMath1204.12004OpenAlexW2069074268MaRDI QIDQ620930

Qunying Liao, Lin You

Publication date: 2 February 2011

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

Full work available at URL: https://doi.org/10.1016/j.ffa.2010.09.005

zbMATH Keywords

complexityfinite fieldsnormal basesdual basestrace mapping

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20)

Related Items (3)

Normal bases from 1-dimensional algebraic groups ⋮ A new criterion on normal bases of finite field extensions ⋮ Normal bases on Galois ring extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of the dual basis of a type I optimal normal basis
• The trace of an optimal normal element and low complexity normal bases
• Optimal normal bases in \(GF(p^ n)\)
• Optimal normal bases
• Normal bases and their dual-bases over finite fields
• Normal bases via general Gauss periods
• Abelian groups, Gauss periods, and normal bases

This page was built for publication: Low complexity of a class of normal bases over finite fields