Factorization of polynomials over finite fields and characteristic sequences

DOI10.1006/jsco.1993.1055zbMath0797.11091OpenAlexW2030334833MaRDI QIDQ1322768

Harald Niederreiter, Rainer Göttfert

Publication date: 20 October 1994

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1993.1055

zbMATH Keywords

linearizationlinear recurring sequencesfinite fieldsfactorization algorithmpolynomial factorizationHasse-Teichmüller derivatives

Mathematics Subject Classification ID

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

Related Items

A new efficient factorization algorithm for polynomials over small finite fields, Univariate polynomial factorization over finite fields, Factoring polynomials over finite fields: A survey, Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases, Subquadratic-time factoring of polynomials over finite fields, A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\), The black-box Niederreiter algorithm and its implementation over the binary field, On a New Factorization Algorithm for Polynomials Over Finite Fields, Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter