Primality Proving via One Round in ECPP and One Iteration in AKS
Number Theory
2007-05-23 v1
Abstract
In this paper, a random primality proving algorithm is proposed, which generates prime certificate of length O(log n). The certificate can be verified in deterministic time O(log^4 n). The algorithm runs in heuristical time tilde{O}(log^4 n), some supporting evidences are provided.
Cite
@article{arxiv.math/0301179,
title = {Primality Proving via One Round in ECPP and One Iteration in AKS},
author = {Qi Cheng},
journal= {arXiv preprint arXiv:math/0301179},
year = {2007}
}
Comments
10 pages, No figure