Research presented here is part of an effort to establish state-of-the-art factoring routines for polynomials. The foundation of such algorithms lies in the efficient factorization over a finite field GF(pk). The Cantor-Zassenhaus algorithm together with innovative ideas suggested by others is compared with the Bcrlekamp algorithm. The studies led us to design a hybrid algorithm that combine the strengths of the different approaches. The algorithms arc also implemented and machine timings arc obtained to measure the performance of these algorithms.