An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena
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...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
BYU ScholarsArchive
2005
|
| Subjects: | |
| Online Access: | https://scholarsarchive.byu.edu/etd/531 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1530&context=etd |