In August 2002, agrawal, kayal and saxena announced the first deterministic and polynomial-time primality-testingalgorithm. For an input n, the Agarwal-kayal-saxena (AKS) algorithm runs in time Omicron (log(7.5) n) (...
详细信息
In August 2002, agrawal, kayal and saxena announced the first deterministic and polynomial-time primality-testingalgorithm. For an input n, the Agarwal-kayal-saxena (AKS) algorithm runs in time Omicron (log(7.5) n) (heuristic time Omicron (log(6) n)). Verification takes roughly the same amount of time. On the other hand, the Elliptic Curve primality Proving algorithm (ECPP) runs in random heuristic time 6 (log6 n) (some variant has heuristic time complexity Omicron(log(4) n)) and generates certificates which can be easily verified. However, it is hard to analyze the provable time complexity of ECPP even for a small portion of primes. More recently, Berrizbeitia gave a variant of the AKS algorithm, in which some primes (of density Omicron(1/log(2) n)) cost much less time to prove than a general prime does. Building on these celebrated results, this paper explores the possibility of designing a randomized primality-proving algorithm based on the AKS algorithm. We first generalize Berrizbeitia's algorithm to one which has higher density (Omega (1/log log n)) of primes whose primality can be proved in time complexity 6(log4 n). For a general prime, one round of ECPP is deployed to reduce its primality proof to the proof of a random easily
暂无评论