Package: node-miller-rabin (4.0.1-9)

[ Source: node-miller-rabin  ]

Miller Rabin algorithm for primality test

This a pure javascript implementation of Miller Rabin 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.

Node.js is an event-based server-side JavaScript engine.

Other Packages Related to node-miller-rabin

• dep: node-bn.js

  Big number implementation in pure javascript

• dep: node-brorand

  Random number generator for browsers and node.js

• dep: nodejs

  evented I/O for V8 javascript - runtime executable

Download node-miller-rabin

Download for all available architectures

Architecture	Package Size	Installed Size	Files
all	4.6 kB	19.0 kB	[list of files]