Skip to search formSkip to main contentSkip to account menu

Cantor–Zassenhaus algorithm

Known as: Cantor-Zassenhaus, Cantor-Zassenhaus Algorithm, Cantor–Zassenhaus 
In computational algebra, the Cantor–Zassenhaus algorithm is a well known method for factorising polynomials over finite fields (also called Galois… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Berlekamp's algorithmComputational mathematicsComputer algebra systemDiscrete logarithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Mathematica Bohemica
The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on… 
2017
2017
A formalization of the Berlekamp-Zassenhaus factorization algorithm
We formalize the Berlekamp–Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt… 
2015
2015
Galois 2-Extensions
The inverse Galois problem is a major question in mathematics. For a given base field F and a given finite group G, one would… 
Review
2015
Review
2015
Deterministic root finding in finite fields
Finding roots of polynomials with coefficients in a finite field is a special instance of the polynomial factorization problem… 
2014
2014
Cohomology of Absolute Galois Groups
The main problem this thesis deals with is the characterization of profinite groups which are realizable as absolute Galois… 
2013
2013
p-Johnson homomorphisms in non-Abelian Iwasawa theory
We propose an approach to study non-Abelian Iwasawa theory, using the idea of Johnson homomorphisms in low dimensional topology… 
Review
2007
Review
2007
Abstracts for the conference in honor of John Labute
s for the conference in honor of John Labute. Montreal, November 15-16, 2007. • Nigel Boston: “Random Pro-p Groups and Random… 
1997
1997
A generalisation of the Cantor-Zassenhaus algorithm
We generalise the Cantor-Zassenhaus algorithm for factoring polynomials over finite fields. The generalisation yields a class of… 
1991
1991
Practical factorization of univariate polynomials over finite fields
Research presented fort to establish state-of-the-art Kent State University “ Kent, Ohio 44242-0001 here is part of an… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)