An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2

DOI10.2307/2153543MaRDI QIDQ4292069zbMATH OpenOpenAlexFDO

Authors Rainer Göttfert

Publication date 1 June 1994

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

Full work available at URL https://semanticscholar.org/paper/2aedc2173f4a455772a6e140317e3a97d152238c

zbMATH Keywords

characteristic 2factorization algorithmfinite fieldspolynomial factorization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 691468
• scientific article; zbMATH DE number 691482
• On a New Factorization Algorithm for Polynomials Over Finite Fields

Cited in

(8)

• Univariate polynomial factorization over finite fields
• A note on the factorization method of Niederreiter
• Subspaces and polynomial factorizations over finite fields
• Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
• scientific article; zbMATH DE number 691468 (Why is no real title available?)
• scientific article; zbMATH DE number 691482 (Why is no real title available?)
• On a New Factorization Algorithm for Polynomials Over Finite Fields
• COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM

This page was built for publication: An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2

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