Cantor–Zassenhaus Algorithm

- Pure Mathematics -
Algebra Dictionary
Definition
A randomized algorithm for factoring polynomials over finite fields, typically executed in two phases: distinct-degree factorization followed by equal-degree splitting using random polynomials and exponentiation in the multiplicative group to separate factors with high probability.