Polynomial and normal bases for finite fields
From MaRDI portal
Publication:2499258
Recommendations
Cited in
(18)- Polynomial bases for algebraic elements
- A new approach for finding low-weight polynomial multiples
- Finite field arithmetic using quasi-normal bases
- On the distribution of irreducible trinomials over \(\mathbb F_3\)
- Elliptic periods for finite fields
- scientific article; zbMATH DE number 1618060 (Why is no real title available?)
- scientific article; zbMATH DE number 5906482 (Why is no real title available?)
- Some remarks on parallel exponentiation (extended abstract)
- Operation-efficient subgroups of finite fields
- Multiplicative order of Gauss periods
- Bases for integer-valued polynomials in a Galois field
- Accelerating Pollard's rho algorithm on finite fields
- scientific article; zbMATH DE number 2077085 (Why is no real title available?)
- Efficient parallel exponentiation in using normal basis representations
- Computing special powers in finite fields
- Finding low-weight polynomial multiples using the rho method
- Presentations of finite simple groups: a computational approach.
- Formulas for cube roots in \(\mathbb F_{3^m}\)
This page was built for publication: Polynomial and normal bases for finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2499258)