Finite field arithmetic using quasi-normal bases
From MaRDI portal
Publication:2370646
DOI10.1016/J.FFA.2006.09.008zbMath1130.11073OpenAlexW2162554250MaRDI QIDQ2370646
Publication date: 29 June 2007
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2006.09.008
Polynomials in general fields (irreducibility, etc.) (12E05) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Field arithmetic (12E30)
Related Items (7)
Pairs of \(r\)-primitive and \(k\)-normal elements in finite fields ⋮ r -primitive k -normal elements in arithmetic progressions over finite fields ⋮ Existence and properties of \(k\)-normal elements over finite fields ⋮ A new criterion on \(k\)-normal elements over finite fields ⋮ On the number of k-normal elements over finite fields ⋮ Existence of primitive 2-normal elements in finite fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Low complexity normal bases
- Optimal normal bases in \(GF(p^ n)\)
- Density of normal elements
- Elliptic curve cryptosystems over small fields of odd characteristic
- An implementation for a fast public-key cryptosystem
- An efficient optimal normal basis type II multiplier
- A modified Massey-Omura parallel multiplier for a class of finite fields
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Elliptic Curve Cryptosystems
- New directions in cryptography
- Bit-serial Reed - Solomon encoders
This page was built for publication: Finite field arithmetic using quasi-normal bases