Cantor–Zassenhaus algorithm

In computational algebra, the Cantor–Zassenhaus algorithm is a method for factoring polynomials over finite fields (also called Galois fields). The algorithm consists mainly of exponentiation and polynomial GCD computations.

Source: Wikipedia — Cantor–Zassenhaus algorithm (CC BY-SA 4.0)

Cantor–Zassenhaus algorithm

In computational algebra, the Cantor–Zassenhaus algorithm is a method for factoring polynomials over finite fields (also called Galois fields). The algorithm consists mainly of exponentiation and polynomial GCD computations.

Source: Wikipedia "Cantor–Zassenhaus algorithm" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy