Alexandria Digital Research Library

Analysis and improvements of the AKS algorithm

Author:
Cayton, Tiawna Lorae
Degree Grantor:
University of California, Santa Barbara. Computer Science
Degree Supervisor:
Cetin K. Koc and Omer Egecioglu
Place of Publication:
[Santa Barbara, Calif.]
Publisher:
University of California, Santa Barbara
Creation Date:
2016
Issued Date:
2016
Topics:
Computer science
Genres:
Dissertations, Academic and Online resources
Dissertation:
M.S.--University of California, Santa Barbara, 2016
Description:

Testing for prime numbers has long been an interesting mathematical challenge. Due to the popular use of cryptography, there exists important applications for finding large primes. We present a survey of primality testing algorithms ending with an algorithm originally proposed by Agrawal, Kayal, and Saxena (AKS) in their paper, ''PRIMES is in P''. The AKS algorithm is the first deterministic polynomial-time primality-proving algorithm. We then do an analysis on the runtime of this algorithm and present observations as well as suggestions for improvements to the algorithm.

Physical Description:
1 online resource (26 pages)
Format:
Text
Collection(s):
UCSB electronic theses and dissertations
ARK:
ark:/48907/f3b27vch
ISBN:
9781369147438
Catalog System Number:
990046968100203776
Rights:
Inc.icon only.dark In Copyright
Copyright Holder:
Tiawna Cayton
Access: This item is restricted to on-campus access only. Please check our FAQs or contact UCSB Library staff if you need additional assistance.