The complexity of elliptic normal bases
From MaRDI portal
Cites work
- Algorithms for exponentiation in finite fields
- Artin-Schreier extensions of normal bases
- Elliptic periods for finite fields
- Handbook of finite fields
- scientific article; zbMATH DE number 4154569 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- Low complexity normal bases
- Low Complexity Normal Elements over Finite Fields of Characteristic Two
- Normal bases from 1-dimensional algebraic groups
- Normal basis exhaustive search: 10 years later
- On finite field arithmetic in characteristic 2
- Optimal normal bases in \(GF(p^ n)\)
- Primitive Normal Bases for Finite Fields
- The Arithmetic of Elliptic Curves
- The equivariant complexity of multiplication in finite field extensions
- The trace of an optimal normal element and low complexity normal bases
This page was built for publication: The complexity of elliptic normal bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008111)