A faster pseudo-primality test

Details A faster pseudo-primality test A faster pseudo-primality test

2012-04-07

arxiv.org/abs/1204.1657v1

Mathematics

Number Theory

Scientific paper

We propose a pseudo-primality test using cyclic extensions of $\ZZ/n\ZZ$. For
every positive integer $k$ this test achieves the security of $k^2$
Miller-Rabin tests at the cost of $k^{1+o(1)}$ Miller-Rabin tests.

Affiliated with

Also associated with

No associations

Rating

A faster pseudo-primality test 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 faster pseudo-primality test, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A faster pseudo-primality test will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-37334