 Berlekamp's algorithm

In mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known as "Galois fields").The algorithm consists mainly of matrix reduction and polynomial GCD computations.