Paper 2016/362
An Empirical Study towards Refining the AKS Primality Testing Algorithm
Lalitha Kiran Nemana and V. Ch. Venkaiah
Abstract
The AKS (Agrawal-Kayal-Saxena) algorithm is the first ever deterministic polynomial-time primality-proving algorithm whose asymptotic run time complexity is
Note: ~ character not recognized in the abstract.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- primality testingAKS algorithm
- Contact author(s)
- nemana lalithakiran @ gmail com
- History
- 2019-03-22: last of 4 revisions
- 2016-04-11: received
- See all versions
- Short URL
- https://ia.cr/2016/362
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/362, author = {Lalitha Kiran Nemana and V. Ch. Venkaiah}, title = {An Empirical Study towards Refining the {AKS} Primality Testing Algorithm}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/362}, year = {2016}, url = {https://eprint.iacr.org/2016/362} }