A new efficient factorization algorithm for polynomials over small finite fields

DOI10.1007/BF01386831zbMath0776.11070OpenAlexW1995704027MaRDI QIDQ2366271

Harald Niederreiter

Publication date: 29 June 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01386831

zbMATH Keywords

efficiencyfinite fieldsfactorization algorithmpolynomialsdifferential equations over rational function fields

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Algebraic number theory computations (11Y40)

Related Items (19)

Factoring multivariate polynomials via partial differential equations ⋮ Lifting and recombination techniques for absolute factorization ⋮ Univariate polynomial factorization over finite fields ⋮ A note on Gao's algorithm for polynomial factorization ⋮ Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields ⋮ A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) ⋮ 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\) ⋮ A note on the factorization method of Niederreiter ⋮ The black-box Niederreiter algorithm and its implementation over the binary field ⋮ Primary decomposition of zero-dimensional ideals over finite fields ⋮ On a New Factorization Algorithm for Polynomials Over Finite Fields ⋮ Sharp precision in Hensel lifting for bivariate polynomial factorization ⋮ Subspaces and polynomial factorizations over finite fields ⋮ Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x\)] ⋮ Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\) ⋮ Factorization of polynomials and some linear-algebra problems over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorization of polynomials over finite fields and characteristic sequences
• A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
• Factoring Polynomials over a Finite Field

This page was built for publication: A new efficient factorization algorithm for polynomials over small finite fields