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.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:lnu-11553 |
| Date | January 2011 |
| Creators | Hanif, Sajid, Imran, Muhammad |
| Publisher | Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0016 seconds