Finite field arithmetic using quasi-normal bases
From MaRDI portal
Publication:2370646
Recommendations
Cites Work
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 2080690 (Why is no real title available?)
- scientific article; zbMATH DE number 1504805 (Why is no real title available?)
- A modified Massey-Omura parallel multiplier for a class of finite fields
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An efficient optimal normal basis type II multiplier
- An implementation for a fast public-key cryptosystem
- Bit-serial Reed - Solomon encoders
- Density of normal elements
- Elliptic Curve Cryptosystems
- Elliptic curve cryptosystems over small fields of odd characteristic
- Low complexity normal bases
- New directions in cryptography
- Optimal normal bases in \(GF(p^ n)\)
Cited In (13)
- On finite field arithmetic in characteristic 2
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- On the number of k-normal elements over finite fields
- CONSTRUCTION OF POLYNOMIALS IRREDUCIBLE OVER A FINITE FIELD WITH LINEARLY INDEPENDENT ROOTS
- Pairs of \(r\)-primitive and \(k\)-normal elements in finite fields
- Artin-Schreier extensions of normal bases
- Elliptic periods for finite fields
- Existence of primitive 2-normal elements in finite fields
- r -primitive k -normal elements in arithmetic progressions over finite fields
- A new criterion on \(k\)-normal elements over finite fields
- Existence and properties of \(k\)-normal elements over finite fields
- Polynomial and normal bases for finite fields
- Direct hardware solution to quadratic equation Z2⊕Z⊕β=0 in Galois fields based on normal basis representation
This page was built for publication: Finite field arithmetic using quasi-normal bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2370646)