On the complexity of the normal bases via prime Gauss period over finite fields

DOI10.1007/s11424-009-9172-8zbMath1185.11078OpenAlexW1973106039MaRDI QIDQ967983

Qunying Liao, Ke Qin Feng

Publication date: 3 May 2010

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-009-9172-8

zbMATH Keywords

complexityfinite fieldnormal basisGauss periodcyclotomic number

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (4)

The Gaussian normal basis and its trace basis over finite fields ⋮ A new criterion on normal bases of finite field extensions ⋮ Construction of self-dual normal bases and their complexity ⋮ Normal bases on Galois ring extensions

Cites Work

• Unnamed Item
• Unnamed Item
• The trace of an optimal normal element and low complexity normal bases
• Optimal normal bases in \(GF(p^ n)\)
• Optimal normal bases
• Low complexity normal bases in \(\mathbb F_{2^n}\)
• An implementation for a fast public-key cryptosystem
• Normal bases via general Gauss periods
• Abelian groups, Gauss periods, and normal bases

This page was built for publication: On the complexity of the normal bases via prime Gauss period over finite fields