A primality test for $Kp^n+1$ numbers

Details A primality test for $Kp^n+1$ numbers A primality test for $Kp^n+1$ numbers

2010-11-22

arxiv.org/abs/1011.4836v3

Mathematics

Number Theory

Scientific paper

In this paper we generalize the classical Proth's theorem for integers of the form $N=Kp^n+1$. For these families, we present a primality test whose computational complexity is $\widetilde{O}(\log^2(N))$ and, what is more important, that requires only one modular exponentiation similar to that of Fermat's test. Consequently, the presented test improves the most often used one, derived from Pocklington's theorem, which usually requires the computation of several modular exponentiations together with some GCD's.

Affiliated with

Also associated with

No associations

Rating

A primality test for $Kp^n+1$ numbers 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 A primality test for $Kp^n+1$ numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A primality test for $Kp^n+1$ numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-657739