A note on the factorization method of Niederreiter
From MaRDI portal
Recommendations
- An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2
- scientific article; zbMATH DE number 953213
- scientific article; zbMATH DE number 1092441
- scientific article; zbMATH DE number 691468
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
Cites work
- scientific article; zbMATH DE number 177858 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 691468 (Why is no real title available?)
- scientific article; zbMATH DE number 691469 (Why is no real title available?)
- scientific article; zbMATH DE number 691482 (Why is no real title available?)
- scientific article; zbMATH DE number 953213 (Why is no real title available?)
- A new efficient factorization algorithm for polynomials over small finite fields
- Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
- Factorization of polynomials and some linear-algebra problems over finite fields
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Solving sparse linear equations over finite fields
- The black-box Niederreiter algorithm and its implementation over the binary field
- The digit principle
Cited in
(2)
This page was built for publication: A note on the factorization method of Niederreiter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779329)
