A generalisation of the Cantor-Zassenhaus algorithm
From MaRDI portal
Publication:1377270
DOI10.1007/BF02684415zbMath0895.11052OpenAlexW2089853886MaRDI QIDQ1377270
Publication date: 3 March 1998
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02684415
Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Factorization (11Y05)
Cites Work
- Unnamed Item
- Computing Frobenius maps and factoring polynomials
- Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
- A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
- A New Algorithm for Factoring Polynomials Over Finite Fields
This page was built for publication: A generalisation of the Cantor-Zassenhaus algorithm