Reducibility of certain class of polynomials over Fp, whose degree depends on p, can be deduced by checking the reducibility of a quadratic and cubic polynomial. This thesis explains how can we speeds up the reducibility procedure.
Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:lnu-17994 |
Date | January 2012 |
Creators | Imran, Muhammad |
Publisher | 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.0028 seconds