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 . All proofs cited have been reworked with full details for the sake of completeness and readability.
College and Department
Physical and Mathematical Sciences; Mathematics
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.
prime, polynomial, deterministic, algorithm, composite, agrawal