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. / Dissertation (MSc (Applied Mathematics))--University of Pretoria, 2007. / Mathematics and Applied Mathematics / MSc / unrestricted
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:up/oai:repository.up.ac.za:2263/27421 |
| Date | 21 August 2007 |
| Creators | Domingues, Riaal |
| Contributors | Prof L Pretorius, riaal@askas.co.za |
| Source Sets | South African National ETD Portal |
| Detected Language | English |
| Type | Dissertation |
| Rights | © University of Pretor |
Page generated in 0.002 seconds