The black-box Niederreiter algorithm and its implementation over the binary field

DOI10.1090/S0025-5718-03-01494-7MaRDI QIDQ4417166zbMATHOpenAlexFDO

Authors Peter Fleischmann, Markus Chr. Holder, Peter Roelse

Publication date 28 July 2003

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0025-5718-03-01494-7

zbMATH Keywords

finite fieldspolynomial factorizationimplicit linear algebra

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
• scientific article; zbMATH DE number 953213
• A note on the factorization method of Niederreiter
• scientific article; zbMATH DE number 1092441
• scientific article; zbMATH DE number 691468

Cites work

• scientific article; zbMATH DE number 1222356 (Why is no real title available?)
• scientific article; zbMATH DE number 1263398 (Why is no real title available?)
• scientific article; zbMATH DE number 1296286 (Why is no real title available?)
• scientific article; zbMATH DE number 691468 (Why is no real title available?)
• scientific article; zbMATH DE number 691482 (Why is no real title available?)
• scientific article; zbMATH DE number 1092441 (Why is no real title available?)
• scientific article; zbMATH DE number 1519867 (Why is no real title available?)
• scientific article; zbMATH DE number 953213 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• A new efficient factorization algorithm for polynomials over small finite fields
• Applied algebra, algebraic algorithms and error-correcting codes. 9th international symposium, AAECC '9, New Orleans, LA, USA, October 7-11, 1991. Proceedings
• Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
• Factorization of polynomials over finite fields and characteristic sequences
• On arithmetical algorithms over finite fields
• Shift-register synthesis and BCH decoding
• Solving sparse linear equations over finite fields
• Subquadratic-time factoring of polynomials over finite fields

Cited in

(5)

• scientific article; zbMATH DE number 1519867 (Why is no real title available?)
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 691468 (Why is no real title available?)
• A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)
• A note on the factorization method of Niederreiter

This page was built for publication: The black-box Niederreiter algorithm and its implementation over the binary field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417166)