Optimized AKS Primality Testing: A Fluctuation Theory Perspective

The AKS algorithm is an important breakthrough in showing that primality testing of an integer can be done in polynomial time. In this paper, we study the optimization of its runtime. Namely, given a finite cardinality set of alphabets of a deterministic polynomial runtime Turing machine and the num...

Full description

Bibliographic Details
Main Authors: Bhupendra Nath Tiwari, Jude Kibinde Kuipo, Joshua M. Adeegbe, Ninoslav Marina
Format: Article
Language:English
Published: MDPI AG 2019-04-01
Series:Cryptography
Subjects:
Online Access:https://www.mdpi.com/2410-387X/3/2/12