A polynomial time algorithm for prime recognition

dc.contributor.advisorPretorius, Lou M. (Lourens Martin)en
dc.contributor.emailriaal@askas.co.zaen
dc.contributor.postgraduateDomingues, Riaalen
dc.date.accessioned2013-09-07T11:30:11Z
dc.date.available2007-08-21en
dc.date.available2013-09-07T11:30:11Z
dc.date.created2006-01-17en
dc.date.issued2007-08-21en
dc.date.submitted2007-08-21en
dc.descriptionDissertation (MSc (Applied Mathematics))--University of Pretoria, 2007.en
dc.description.abstractPrime numbers are of the utmost importance in many applications and in particular cryptography. Firstly, number theory background is introduced in order to present the non-deterministic Solovay-Strassen primality test. Sec- ondly, the deterministic primality test discovered by Agrawal, Kayal and Sax- ena in 2002 is presented with the proofs following their original paper. Lastly, a remark will be made about the practical application of the deterministic algorithm versus using the non-deterministic algorithms in applications.en
dc.description.availabilityunrestricteden
dc.description.degreeMSc
dc.description.departmentMathematics and Applied Mathematicsen
dc.identifier.citationDomingues, R 2007, A polynomial time algorithm for prime recognition, MSc Dissertation, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/27421>
dc.identifier.otherPretoriaen
dc.identifier.upetdurlhttp://upetd.up.ac.za/thesis/available/etd-08212007-100529/en
dc.identifier.urihttp://hdl.handle.net/2263/27421
dc.language.isoen
dc.publisherUniversity of Pretoriaen_ZA
dc.rights© University of Pretoren
dc.subjectDeterministic algorithmsen
dc.subjectNnon-deterministic algorithms deterministicen
dc.subjectCryptographyen
dc.subjectUCTDen_US
dc.titleA polynomial time algorithm for prime recognitionen
dc.typeDissertationen

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
00dissertation.pdf
Size:
272.63 KB
Format:
Adobe Portable Document Format