[ 原始碼： node-miller-rabin ]
套件：node-miller-rabin（4.0.1-9）
node-miller-rabin 的相關連結
Debian 的資源：
下載原始碼套件 node-miller-rabin：
- [node-miller-rabin_4.0.1-9.dsc]
- [node-miller-rabin_4.0.1.orig.tar.gz]
- [node-miller-rabin_4.0.1-9.debian.tar.xz]
維護小組：
外部的資源：
- 主頁 [github.com]
相似套件：
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.
其他與 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