[ ソース: 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