Cantor-Zassenhaus Algorithm

The Cantor-Zassenhaus algorithm is a method for factoring polynomials over finite fields, invented by David G. Cantor and Hans Zassenhaus in 1981. It solves the problem of decomposing a polynomial defined over a finite field, also called a Galois field, into its irreducible factors, working primarily through exponentiation and polynomial greatest common divisor computations. The algorithm superseded Berlekamp's algorithm from 1967 as the standard approach to this problem, and it remains the dominant method used in computer algebra systems today, including PARI/GP. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/