Package: node-miller-rabin (4.0.1-5)
Links for node-miller-rabin
Download Source Package node-miller-rabin:
- Homepage [github.com]
Miller Rabin algorithm for primality test
The Miller–Rabin primality test or Rabin–Miller primality test is a primality test: an algorithm which determines whether a given number is prime.
Like the Fermat and Solovay–Strassen tests, the Miller–Rabin test relies on an equality or set of equalities that hold true for prime values, then checks whether or not they hold for a number that is tested for primality.
Other Packages Related to node-miller-rabin