| Document Type |
Master's Dissertation |
| Author |
Domingues, Riaal
|
| Email |
riaal@askas.co.za |
| URN |
etd-08212007-100529 |
| Document Title |
A polynomial time algorithm for prime recognition |
| Degree |
MSc (Applied Mathematics) |
| Department |
Mathematics and Applied Mathematics |
| Supervisor |
| Advisor Name |
Title |
| Prof L Pretorius |
|
|
| Keywords |
- deterministic algorithms
- nnon-deterministic algorithms deterministic
- cryptography
|
| Date |
2006-01-17 |
| Availability |
unrestricted |
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.
© University of Pretoria
|
| Files |
| Filename |
Size |
Approximate Download Time
(Hours:Minutes:Seconds)
|
| 28.8 Modem |
56K Modem |
ISDN (64 Kb) |
ISDN (128 Kb) |
Higher-speed Access |
| |
00dissertation.pdf |
277.87 Kb |
00:01:17 |
00:00:39 |
00:00:34 |
00:00:17 |
00:00:01 |
|
