Low complexity normal bases
From MaRDI portal
Publication:923627
DOI10.1016/0166-218X(89)90001-2zbMath0712.11073OpenAlexW1970404001MaRDI QIDQ923627
David W. Ash, Ian F. Blake, Scott A. Vanstone
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(89)90001-2
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Related Items
Finite field arithmetic using quasi-normal bases ⋮ High-performance generic-point parallel scalar multiplication ⋮ On design of circuits of logarithmic depth for inversion in finite fields ⋮ Artin-Schreier extensions of normal bases ⋮ Fast arithmetic with general Gauß periods ⋮ Complexity of computation in finite fields ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Normal bases from 1-dimensional algebraic groups ⋮ Low complexity normal bases in \(\mathbb F_{2^n}\) ⋮ Low complexity normal bases for \(F_{2^{mn}}\) ⋮ A new criterion on normal bases of finite field extensions ⋮ Gauss periods as constructions of low complexity normal bases ⋮ Computational problems in the theory of finite fields ⋮ Existence and cardinality of \(k\)-normal elements in finite fields ⋮ Specific irreducible polynomials with linearly independent roots over finite fields ⋮ Abelian groups, Gauss periods, and normal bases ⋮ MULTIPLICATIVE ORDER OF GAUSS PERIODS ⋮ Elliptic periods and primality proving ⋮ An implementation for a fast public-key cryptosystem ⋮ Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic ⋮ Elliptic periods for finite fields ⋮ The trace of an optimal normal element and low complexity normal bases ⋮ Construction of self-dual normal bases and their complexity ⋮ Complexities of self-dual normal bases ⋮ Algorithms for exponentiation in finite fields ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) ⋮ Normal bases on Galois ring extensions ⋮ Elliptic curve cryptosystems and their implementation ⋮ Trace-orthogonal normal bases ⋮ A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dynamical system
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal normal bases in \(GF(p^ n)\)
- A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
- Bit-serial Reed - Solomon encoders
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- On Symmetric Representations of Finite Fields
- Bases for Finite Fields
- Primitive Roots in a Finite Field
