Source: wikibot/cantor-zassenhaus-algorithm
= Cantor–Zassenhaus algorithm
{wiki=Cantor–Zassenhaus_algorithm}
The Cantor–Zassenhaus algorithm, also known as the Cantor-Zassenhaus factoring algorithm, is a classical algorithm used for integer factorization, particularly for finding the prime factors of composite numbers. It's especially effective for numbers that are not too large and is known for its ability to factorize numbers using a combination of techniques.