On Orders of Optimal Normal Basis Generators
From MaRDI portal
Publication:4846174
DOI10.2307/2153492zbMath0868.11059OpenAlexW2084897040MaRDI QIDQ4846174
Shuhong Gao, Scott A. Vanstone
Publication date: 19 August 1997
Full work available at URL: https://doi.org/10.2307/2153492
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Related Items (13)
Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ Generating sets for the multiplicative groups of algebras over finite fields and expander graphs ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ On the existence of some specific elements in finite fields of characteristic 2 ⋮ Gauss periods: orders and cryptographical applications ⋮ Abelian groups, Gauss periods, and normal bases ⋮ Primitive elements with prescribed trace ⋮ An extension of TYT inversion algorithm in polynomial basis ⋮ Multiplicative orders of Gauss periods and the arithmetic of real quadratic fields ⋮ Normal bases and their dual-bases over finite fields ⋮ Finite field elements of high order arising from modular curves ⋮ Algorithms for exponentiation in finite fields ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient and optimal exponentiation in finite fields
- Optimal normal bases in \(GF(p^ n)\)
- On fast multiplication of polynomials over arbitrary algebras
- Optimal normal bases
- An implementation for a fast public-key cryptosystem
- Fast multiplication of large numbers
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- On Certain Chains of Primes
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
This page was built for publication: On Orders of Optimal Normal Basis Generators
