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/

Date Submitted

2005-06-29

Document Type

Thesis

Handle

http://hdl.lib.byu.edu/1877/etd869

Keywords

prime, polynomial, deterministic, algorithm, composite, agrawal

Included in

Mathematics Commons

Share

COinS