Gauss periods as constructions of low complexity normal bases
From MaRDI portal
Publication:663465
DOI10.1007/s10623-011-9490-4zbMath1261.11087OpenAlexW2016474650MaRDI QIDQ663465
Publication date: 15 February 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9490-4
Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Cyclotomy (11T22)
Related Items (9)
Nonexistence of twenty-fourth power residue addition sets ⋮ On the Complexity of the Dual Bases of the Gaussian Normal Bases ⋮ Artin-Schreier extensions of normal bases ⋮ The Gaussian normal basis and its trace basis over finite fields ⋮ A new criterion on normal bases of finite field extensions ⋮ Complexities of normal bases constructed from Gauss periods ⋮ AFFINE TRANSFORMATION OF A NORMAL ELEMENT AND ITS APPLICATION ⋮ Construction of self-dual normal bases and their complexity ⋮ Normal bases on Galois ring extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast arithmetic with general Gauß periods
- Low complexity normal bases
- 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
- Orders of Gauss periods in finite fields
- Low complexity normal bases in \(\mathbb F_{2^n}\)
- Algorithms for exponentiation in finite fields
- An efficient optimal normal basis type II multiplier
- A modified Massey-Omura parallel multiplier for a class of finite fields
- Low Complexity Normal Elements over Finite Fields of Characteristic Two
- MULTIPLICATIVE ORDER OF GAUSS PERIODS
- Gauss periods: orders and cryptographical applications
This page was built for publication: Gauss periods as constructions of low complexity normal bases
