Back to results
Brigham Young University - Provo
An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena
Abstract
dc:description.abstractI 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
thesis:*- Name thesis:degree_name
- MS
- Grantor dc:publisher
- Brigham Young University - Provo
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Anderson, Robert Lawrence
Subjects
dc:subject × 7Rights
- Language dc:language
- English
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://scholarsarchive.byu.edu/etd/531
- OAI identifier oai:identifier
- oai:scholarsarchive.byu.edu:etd-1530