Optimal normal bases in \(GF(p^ n)\)

DOI10.1016/0166-218X(88)90090-XzbMath0661.12007OpenAlexW2054020579MaRDI QIDQ1112879

Scott A. Vanstone, I. M. Onyszchuk, Richard M. Wilson, Ronald C. Mullin

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(88)90090-x

zbMATH Keywords

optimal normal bases

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99) Arithmetic theory of polynomial rings over finite fields (11T55)

Related Items (59)

Finite field arithmetic using quasi-normal bases ⋮ Almost weakly self-dual bases for finite fields ⋮ Whirlwind: a new cryptographic hash function ⋮ Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ Computing special powers in finite fields ⋮ Near subgroups of groups ⋮ A class of Gaussian normal bases and their dual bases ⋮ The combinatorial power of the companion matrix ⋮ Artin-Schreier extensions of normal bases ⋮ Fast arithmetic with general Gauß periods ⋮ Structure of parallel multipliers for a class of fields \(GF(2^ m)\) ⋮ Complexity of computation in finite fields ⋮ On \(r\)-primitive \(k\)-normal elements over finite fields ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Normal bases from 1-dimensional algebraic groups ⋮ Low complexity of a class of normal bases over finite fields ⋮ Primitive normal values of rational functions over finite fields ⋮ Inverses of \(r\)-primitive \(k\)-normal elements over finite fields ⋮ The Gaussian normal basis and its trace basis over finite fields ⋮ The equivariant complexity of multiplication in finite field extensions ⋮ Low complexity normal bases for \(F_{2^{mn}}\) ⋮ Low complexity normal bases ⋮ Using Normal Bases for Compact Hardware Implementations of the AES S-Box ⋮ Gauss periods as constructions of low complexity normal bases ⋮ A new characterization of dual bases in finite fields and its applications ⋮ Computational problems in the theory of finite fields ⋮ Complexities of normal bases constructed from Gauss periods ⋮ Gauss periods: orders and cryptographical applications ⋮ Specific irreducible polynomials with linearly independent roots over finite fields ⋮ WG: a family of stream ciphers with designed randomness properties ⋮ On primitive and free roots in a finite field ⋮ Abelian groups, Gauss periods, and normal bases ⋮ Optimal normal bases ⋮ Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases ⋮ On Orders of Optimal Normal Basis Generators ⋮ Elliptic periods and primality proving ⋮ On the complexity of the normal bases via prime Gauss period over finite fields ⋮ On the number of k-normal elements over finite fields ⋮ Primitive Normal Polynomials Over Finite Fields ⋮ An implementation for a fast public-key cryptosystem ⋮ An extension of TYT inversion algorithm in polynomial basis ⋮ Normal bases and their dual-bases over finite fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Elliptic periods for finite fields ⋮ The trace of an optimal normal element and low complexity normal bases ⋮ AFFINE TRANSFORMATION OF A NORMAL ELEMENT AND ITS APPLICATION ⋮ Characterization for a family of infinitely many irreducible equally spaced polynomials ⋮ Selfdual normal bases on \(\mathrm{GF}(q)\) ⋮ Construction of self-dual normal bases and their complexity ⋮ Rings of low multiplicative complexity ⋮ Complexities of self-dual normal bases ⋮ Algorithms for exponentiation in finite fields ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) ⋮ Self-dual bases in \(\mathbb{F}_{q^ n}\) ⋮ Factorization of polynomials and some linear-algebra problems over finite fields ⋮ 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 ⋮ On the existence of pairs of primitive normal elements over finite fields

Cites Work

• Systolic Multipliers for Finite Fields GF(2^m)
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• Self-Complementary Normal Bases in Finite Fields
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal normal bases in \(GF(p^ n)\)