Abstract
I present a thorough examination of the unconditional deterministic polynomial-time algorithm for determining whether an input number is prime or composite proposed by Agrawal, Kayal and Saxena in their paper [1]. All proofs cited have been reworked with full details for the sake of completeness and readability.
Degree
MS
College and Department
Physical and Mathematical Sciences; Mathematics
Rights
http://lib.byu.edu/about/copyright/
BYU ScholarsArchive Citation
Anderson, Robert Lawrence, "An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena" (2005). Theses and Dissertations. 531.
https://scholarsarchive.byu.edu/etd/531
Date Submitted
2005-06-29
Document Type
Thesis
Handle
http://hdl.lib.byu.edu/1877/etd869
Keywords
prime, polynomial, deterministic, algorithm, composite, agrawal
Language
English