Primality Proving via One Round in ECPP and One Iteration in AKS

Details Primality Proving via One Round in ECPP and One Iteration in AKS Primality Proving via One Round in ECPP and One Iteration in AKS

2003-01-16

arxiv.org/abs/math/0301179v1

Mathematics

Number Theory

10 pages, No figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Primality Proving via One Round in ECPP and One Iteration in AKS does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Primality Proving via One Round in ECPP and One Iteration in AKS, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Primality Proving via One Round in ECPP and One Iteration in AKS will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-585868