scientific article; zbMATH DE number 1092441

MaRDI QIDQ4367599zbMATH OpenFDO

Authors Peter Roelse

Publication date 1 December 1997

zbMATH Keywords

algorithmsfactorization of polynomialsfinite field arithmeticpolynomial arithmeticsoftware implementation

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 953213
• scientific article; zbMATH DE number 691468
• Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields

Cited in

(8)

• Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
• A note on the factorization method of Niederreiter
• Linearized polynomials over finite fields revisited
• An algorithm to obtain linear determinantal representations of smooth plane cubics over finite fields
• scientific article; zbMATH DE number 691468 (Why is no real title available?)
• The black-box Niederreiter algorithm and its implementation over the binary field
• scientific article; zbMATH DE number 1519867 (Why is no real title available?)
• scientific article; zbMATH DE number 953213 (Why is no real title available?)

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 Q4367599)