Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields

DOI10.1016/j.jsc.2006.02.007zbMath1165.11085OpenAlexW2061871339MaRDI QIDQ2457415

Giulio Genovese

Publication date: 23 October 2007

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2006.02.007

zbMATH Keywords

finite fieldspolynomial factorizationBerlekamp algorithmDeterministic algorithmsNiederreiter algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Numerical computation of solutions to single equations (65H05) Polynomials over finite fields (11T06) Polynomials, factorization in commutative rings (13P05)

Related Items (1)

\textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• An introduction to pseudo-linear algebra
• A new polynomial factorization algorithm and its implementation
• Computing Frobenius maps and factoring polynomials
• A new efficient factorization algorithm for polynomials over small finite fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Subquadratic-time factoring of polynomials over finite fields
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields