Pretorius, Lou M. (Lourens Martin)2013-09-072007-08-212013-09-072006-01-172007-08-212007-08-21Domingues, R 2007, A polynomial time algorithm for prime recognition, MSc Dissertation, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/27421>Pretoriahttp://hdl.handle.net/2263/27421Dissertation (MSc (Applied Mathematics))--University of Pretoria, 2007.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.© University of PretorDeterministic algorithmsNnon-deterministic algorithms deterministicCryptographyUCTDDissertationhttp://upetd.up.ac.za/thesis/available/etd-08212007-100529/