加载中…
2003-01-16
Primality Proving via One Round in ECPP and One Iteration in AKS
Qi Cheng
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本