Factorization Algorithms for Polynomials over Finite Fields
Independent thesis Advanced level (degree of Master (One Year)), 15 credits / 22,5 HE creditsStudent thesis
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.
Place, publisher, year, edition, pages
2011. , 18 p.
IdentifiersURN: urn:nbn:se:lnu:diva-11553OAI: oai:DiVA.org:lnu-11553DiVA: diva2:414578
Subject / course
Mathematics and Modelling, Master Programme, 60 credits
UppsokPhysics, Chemistry, Mathematics