Looking for a more efficient primality testing Algorithm than Miller-Rabin

780 Views Asked by At

I am looking for a practical probabilistic primality testing algorithm that is more superior than Miller-Rabin. By "more superior", I mean that the probability of giving the wrong answer is better than (1/4)^h where h is the number of times the test is conducted. Any help on this will be highly appreciated.

1

There are 1 best solutions below

0
On

Grantham's Frobenius pseudoprimality test has far less error probability per round than a Miller-Rabin round. It requires somewhat more effort per round, but it seems that this is more than compensated by the smaller error margin.