Bug#860331: ITP: node-miller-rabin -- Miller Rabin algorithm for primality test

[Bastien ROUCARIES <roucaries.bastien@gmail.com>]

Package: wnpp
Severity: wishlist
Owner: rouca@debian.org
X-Debbugs-CC: debian-devel@lists.debian.org

* Package name    : node-miller-rabin
  Version         : 4.0.0
  Upstream Author : Fedor Indutny <fedor@indutny.com>
* URL             : https://github.com/indutny/miller-rabin
* License         : Expat
  Programming Lang: JavaScript
  Description     : Miller Rabin algorithm for primality test

 This a pure javascript implementation of Miller Rabin 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.
Just 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.
.
Node.js is an event-based server-side JavaScript engine.