Large Integer Atkin Primality Test

This application proves whether a large integer is prime and provides an elliptic curve certificate of primality. The Atkin algorithm is an improvement on the Goldwasser-Kilian primality test that requires the calculation of the number of points on an elliptic curve.

C# (223.7 KB)
125 times
Add to favorites
E-mail Twitter Digg Facebook