Factorization Algorithms for Polynomials over Finite Fields
Sajid Hanif, Muhammad Imran · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2011
Integer factorization is a dicult task. Some cryptosystem such asRSA (which stands for Rivest, Shamir and Adleman ) are in fact designedaround the diculty of integer factorization.For factorization of polynomials in a given nite eld Fp we can useBerlekamp's and Zassenhaus algorithms. In this project we will see howBerlekamp's and Zassenhaus algorithms work for factorization of polyno-mials in a nite eld Fp. This project is aimed toward those with interestsin computational algebra, nite elds, and linear algebra.