Pages that link to "Item:Q1112879"
From MaRDI portal
The following pages link to Optimal normal bases in \(GF(p^ n)\) (Q1112879):
Displaying 50 items.
- Complexity of computation in finite fields (Q378003) (← links)
- The Gaussian normal basis and its trace basis over finite fields (Q415255) (← links)
- Fast arithmetic with general Gauß periods (Q598216) (← links)
- Low complexity of a class of normal bases over finite fields (Q620930) (← links)
- Gauss periods as constructions of low complexity normal bases (Q663465) (← links)
- Specific irreducible polynomials with linearly independent roots over finite fields (Q677139) (← links)
- Characterization for a family of infinitely many irreducible equally spaced polynomials (Q750156) (← links)
- Selfdual normal bases on \(\mathrm{GF}(q)\) (Q757537) (← links)
- Construction of self-dual normal bases and their complexity (Q765817) (← links)
- Guest editorial: Special issue in honor of Scott A. Vanstone (Q887413) (← links)
- Low complexity normal bases for \(F_{2^{mn}}\) (Q918710) (← links)
- Low complexity normal bases (Q923627) (← links)
- On the complexity of the normal bases via prime Gauss period over finite fields (Q967983) (← links)
- An extension of TYT inversion algorithm in polynomial basis (Q991790) (← links)
- The trace of an optimal normal element and low complexity normal bases (Q1009092) (← links)
- Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) (Q1048342) (← links)
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (Q1124585) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- On primitive and free roots in a finite field (Q1201337) (← links)
- Optimal normal bases (Q1203948) (← links)
- Self-dual bases in \(\mathbb{F}_{q^ n}\) (Q1309828) (← links)
- Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- Trace-orthogonal normal bases (Q1314337) (← links)
- Almost weakly self-dual bases for finite fields (Q1352414) (← links)
- Rings of low multiplicative complexity (Q1570228) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Artin-Schreier extensions of normal bases (Q1654507) (← links)
- Complexities of normal bases constructed from Gauss periods (Q1741928) (← links)
- Elliptic periods and primality proving (Q1762314) (← links)
- Near subgroups of groups (Q1903720) (← links)
- The combinatorial power of the companion matrix (Q1906799) (← links)
- A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dynamical system (Q2107078) (← links)
- On the existence of pairs of primitive normal elements over finite fields (Q2107674) (← links)
- Normal bases from 1-dimensional algebraic groups (Q2188980) (← links)
- An implementation for a fast public-key cryptosystem (Q2277427) (← links)
- Finite field arithmetic using quasi-normal bases (Q2370646) (← links)
- Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields (Q2383972) (← links)
- A new characterization of dual bases in finite fields and its applications (Q2457004) (← links)
- WG: a family of stream ciphers with designed randomness properties (Q2476897) (← links)
- Normal bases and their dual-bases over finite fields (Q2508607) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- Elliptic periods for finite fields (Q2517811) (← links)
- Whirlwind: a new cryptographic hash function (Q2638401) (← links)
- On \(r\)-primitive \(k\)-normal elements over finite fields (Q2672341) (← links)
- The equivariant complexity of multiplication in finite field extensions (Q2693365) (← links)
- Using Normal Bases for Compact Hardware Implementations of the AES S-Box (Q3540049) (← links)
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases (Q4292068) (← links)
- Primitive Normal Polynomials Over Finite Fields (Q4317674) (← links)
- Gauss periods: orders and cryptographical applications (Q4372701) (← links)
