 Berlekamp–Zassenhaus algorithm

The Berlekamp–Zassenhaus algorithm is a method in computational algebraic geometry and number theory, primarily used for factoring multivariate polynomials over finite fields. It is particularly well-known for its application in coding theory and cryptography. The algorithm is a combination of the Berlekamp algorithm for univariate polynomials and the Zassenhaus algorithm for more general multivariate cases.