Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
A polynomial time algorithm for prime recognition
Dissertation (MSc (Applied Mathematics))--University of Pretoria, 2007.
Saved in:
| Other Authors: | |
|---|---|
| Format: | Thesis |
| Published: |
University of Pretoria
2013
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613677768671232 |
|---|---|
| access_status_str | Open Access |
| author2 | Pretorius, Lou M. (Lourens Martin) |
| author_browse | Pretorius, Lou M. (Lourens Martin) |
| author_facet | Pretorius, Lou M. (Lourens Martin) |
| collection | Thesis |
| dc_rights_str_mv | © University of Pretor |
| description | Dissertation (MSc (Applied Mathematics))--University of Pretoria, 2007. |
| format | Thesis |
| id | oai:repository.up.ac.za:2263/27421 |
| institution | University of Pretoria (South Africa) |
| last_indexed | 2026-06-10T12:39:57.392Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository |
| publishDate | 2013 |
| publishDateRange | 2013 |
| publishDateSort | 2013 |
| publisher | University of Pretoria |
| publisherStr | University of Pretoria |
| record_format | dspace |
| source_str | UPSpace — University of Pretoria Institutional Repository |
| spelling | oai:repository.up.ac.za:2263/27421 A polynomial time algorithm for prime recognition Pretorius, Lou M. (Lourens Martin) riaal@askas.co.za Domingues, Riaal Deterministic algorithms Nnon-deterministic algorithms deterministic Cryptography UCTD Dissertation (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. Mathematics and Applied Mathematics MSc unrestricted 2013-09-07T11:30:11Z 2007-08-21 2013-09-07T11:30:11Z 2006-01-17 2007-08-21 2007-08-21 Dissertation Domingues, R 2007, A polynomial time algorithm for prime recognition, MSc Dissertation, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/27421> Pretoria http://hdl.handle.net/2263/27421 http://upetd.up.ac.za/thesis/available/etd-08212007-100529/ © University of Pretor application/pdf University of Pretoria |
| spellingShingle | Deterministic algorithms Nnon-deterministic algorithms deterministic Cryptography UCTD A polynomial time algorithm for prime recognition |
| title | A polynomial time algorithm for prime recognition |
| title_full | A polynomial time algorithm for prime recognition |
| title_fullStr | A polynomial time algorithm for prime recognition |
| title_full_unstemmed | A polynomial time algorithm for prime recognition |
| title_short | A polynomial time algorithm for prime recognition |
| title_sort | polynomial time algorithm for prime recognition |
| topic | Deterministic algorithms Nnon-deterministic algorithms deterministic Cryptography UCTD |
| url | http://hdl.handle.net/2263/27421 http://upetd.up.ac.za/thesis/available/etd-08212007-100529/ |