scientific article; zbMATH DE number 177888
From MaRDI portal
Publication:4038771
Recommendations
- scientific article; zbMATH DE number 5733040
- A fast algorithm to compute irreducible and primitive polynomials in finite fields
- Fast construction of irreducible polynomials over finite fields
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Fast algorithm for finding primitive polynomials over GF(q)
Cited in
(14)- Subexponential-time computation of isolated primary components of a polynomial ideal
- Fast computation of special resultants
- Implementation of prime decomposition of polynomial ideals over small finite fields
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- scientific article; zbMATH DE number 5733040 (Why is no real title available?)
- A fast algorithm to compute irreducible and primitive polynomials in finite fields
- An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic
- Elimination ideal and bivariate resultant over finite fields
- Bivariate polynomial reduction and elimination ideal over finite fields
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- Fast arithmetic in unramified \(p\)-adic fields
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038771)
