A polynomial time algorithm for prime recognition

by Domingues, Riaal.

Abstract (Summary)
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. Secondly, the deterministic primality test discovered by Agrawal, Kayal and Saxena 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.
Bibliographical Information:


School:University of Pretoria/Universiteit van Pretoria

School Location:South Africa

Source Type:Master's Thesis

Keywords:polynomials algorithms cryptography number theory numbers prime


Date of Publication:

© 2009 All Rights Reserved.