Primality Proving via One Round in ECPP and One Iteration in AKS
classification
🧮 math.NT
keywords
algorithmcertificateprimalityprovingtimedeterministicecppevidences
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.