Abelian groups, Gauss periods, and normal bases
From MaRDI portal
Publication:5927544
DOI10.1006/ffta.2000.0304zbMath0990.11077MaRDI QIDQ5927544
Publication date: 17 August 2002
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5c6fac3ca18f3f960e7d4ad94d7a453fda70228d
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
11T06: Polynomials over finite fields
11T30: Structure theory for finite fields and commutative rings (number-theoretic aspects)
Related Items
A new criterion on normal bases of finite field extensions, Fast arithmetic with general Gauß periods, Low complexity of a class of normal bases over finite fields, On the complexity of the normal bases via prime Gauss period over finite fields, Normal bases and their dual-bases over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Low complexity normal bases
- Optimal normal bases in \(GF(p^ n)\)
- Optimal normal bases
- Algorithms for exponentiation in finite fields
- An implementation for a fast public-key cryptosystem
- Factoring with Cyclotomic Polynomials
- Normal bases via general Gauss periods
- Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$
- Gauss periods: orders and cryptographical applications
- On Orders of Optimal Normal Basis Generators