Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 4110778 (Why is no real title available?)
- scientific article; zbMATH DE number 52177 (Why is no real title available?)
- scientific article; zbMATH DE number 922674 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- A new efficient factorization algorithm for polynomials over small finite fields
- An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2
- Factorization of polynomials and some linear-algebra problems over finite fields
- Factorization of polynomials over finite fields and characteristic sequences
- On fast multiplication of polynomials over arbitrary algebras
- Optimal normal bases in \(GF(p^ n)\)
Cited in
(12)- scientific article; zbMATH DE number 691482 (Why is no real title available?)
- Primary decomposition of zero-dimensional ideals over finite fields
- Univariate polynomial factorization over finite fields
- A note on Gröbner bases and Berlekamp's algorithm
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Factoring polynomials over finite fields: A survey
- A note on the factorization method of Niederreiter
- Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter
- A Hybrid Approach for Normal Factorization of Polynomials
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Factorization of polynomials and some linear-algebra problems over finite fields
- Primitive Normal Polynomials Over Finite Fields
This page was built for publication: Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4292068)
