[ 源代码： node-miller-rabin ]
软件包：node-miller-rabin（4.0.1-5）
node-miller-rabin 的相关链接
Debian 的资源：
下载源码包 node-miller-rabin：
- [node-miller-rabin_4.0.1-5.dsc]
- [node-miller-rabin_4.0.1.orig.tar.gz]
- [node-miller-rabin_4.0.1-5.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 (>= 4.7)
- evented I/O for V8 javascript - runtime executable