A polynomial time algorithm for prime recognition

Show simple item record

dc.contributor.advisor Pretorius, Lou M. (Lourens Martin) en
dc.contributor.postgraduate Domingues, Riaal en
dc.date.accessioned 2013-09-07T11:30:11Z
dc.date.available 2007-08-21 en
dc.date.available 2013-09-07T11:30:11Z
dc.date.created 2006-01-17 en
dc.date.issued 2007-08-21 en
dc.date.submitted 2007-08-21 en
dc.description Dissertation (MSc (Applied Mathematics))--University of Pretoria, 2007. en
dc.description.abstract Prime 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.availability unrestricted en
dc.description.degree MSc
dc.description.department Mathematics and Applied Mathematics en
dc.identifier.citation Domingues, 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.other Pretoria en
dc.identifier.upetdurl http://upetd.up.ac.za/thesis/available/etd-08212007-100529/ en
dc.identifier.uri http://hdl.handle.net/2263/27421
dc.language.iso en
dc.publisher University of Pretoria en_ZA
dc.rights © University of Pretor en
dc.subject Deterministic algorithms en
dc.subject Nnon-deterministic algorithms deterministic en
dc.subject Cryptography en
dc.subject UCTD en_US
dc.title A polynomial time algorithm for prime recognition en
dc.type Dissertation en


Files in this item

Icon
Name: 00dissertation.pdf
Size: 272.6Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Show simple item record