Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/1564
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSatender.-
dc.contributor.authorAribam, Chandrakant S.-
dc.date.accessioned2021-12-08T19:43:47Z-
dc.date.available2021-12-08T19:43:47Z-
dc.date.issued2021-07-28-
dc.identifier.urihttp://hdl.handle.net/123456789/1564-
dc.description.abstractThis thesis is a detailed study of primality testing and factorization algorithms. In the first part, we study about famous algorithms such as Fermat’s factorization scheme, Robin-Miller Test, Solovay-Strassen Test, Continued Fraction Factoring Algo rithm, Pollard-rho and p − 1 test etc., then we study deterministic polynomial time AKS Algorithm. In, second part we study about Quadratic sieve algorithm and polynomial time lattice reduction algorithm, The LLL-Algorithm. Then we study in detail about poly nomial factorization in finite field Z/pZ and in field of rationals, Q. In the last part, we study polynomial factorization using the LLL-Algorithm.en_US
dc.language.isoen_USen_US
dc.publisherIISERMen_US
dc.subjectPrimalityen_US
dc.subjectTestingen_US
dc.subjectFactorizationen_US
dc.titlePrimality testing and factorizationen_US
dc.typeThesisen_US
Appears in Collections:MS-16

Files in This Item:
File Description SizeFormat 
MS16069.docx12.41 kBMicrosoft Word XMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.