CantorZassenhausalgoritmer
Cantor–Zassenhaus algorithm is a probabilistic method for factoring polynomials over finite fields. It was introduced by Gerhard Cantor and Hans Zassenhaus and remains a foundational technique in computational algebra for breaking polynomials in F_q[x] into irreducible factors. The algorithm requires the input polynomial to be square-free and works best as part of a larger factorization pipeline.
The method proceeds in two main phases. First, distinct-degree factorization (DDF) separates the polynomial into a
Second, equal-degree factorization (EDF) takes each factor produced by the DDF phase, where all irreducible components
The Cantor–Zassenhaus algorithm is a Las Vegas probabilistic algorithm with expected polynomial-time complexity in the degree