Berlekamp's algorithm

Berlekamp's algorithm is a well known method in computational algebra for factoring polynomials over finite fields, invented by Elwyn Berlekamp in 1967. It works mainly through matrix reduction combined with polynomial greatest-common-divisor computations, and it remained the dominant algorithm for the problem until the Cantor-Zassenhaus algorithm was introduced in 1981. It is still implemented in many well known computer algebra systems today. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/