On Orders of Optimal Normal Basis Generators
From MaRDI portal
Recommendations
- Optimal normal bases in \(GF(p^ n)\)
- Optimal normal bases
- The trace of an optimal normal element and low complexity normal bases
- Orbits of normal basis generators
- scientific article; zbMATH DE number 812069
- Generalizations of the Primitive and Normal Basis Theorems
- On multiplication tables of optimal normal bases over finite fields
- A generalization of the primitive normal basis theorem
- On the complexity of the dual basis of a type I optimal normal basis
- A note on the generation of \(\Delta\)-orthonormal bases
Cites work
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 503339 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- An implementation for a fast public-key cryptosystem
- Efficient and optimal exponentiation in finite fields
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Fast multiplication of large numbers
- On Certain Chains of Primes
- On fast multiplication of polynomials over arbitrary algebras
- Optimal normal bases
- Optimal normal bases in \(GF(p^ n)\)
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
Cited in
(17)- Optimal normal bases in \(GF(p^ n)\)
- Constructing normal bases in finite fields
- On the existence of some specific elements in finite fields of characteristic 2
- Multiplicative orders of Gauss periods and the arithmetic of real quadratic fields
- Gauss periods: orders and cryptographical applications
- Finite field elements of high order arising from modular curves
- An extension of TYT inversion algorithm in polynomial basis
- Algorithms for exponentiation in finite fields
- The trace of an optimal normal element and low complexity normal bases
- Constructing high order elements through subspace polynomials
- Guest editorial: Special issue in honor of Scott A. Vanstone
- Low Complexity Normal Elements over Finite Fields of Characteristic Two
- Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields
- Abelian groups, Gauss periods, and normal bases
- Normal bases and their dual-bases over finite fields
- Primitive elements with prescribed trace
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs
This page was built for publication: On Orders of Optimal Normal Basis Generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846174)
