[ Källkod: node-miller-rabin ]
Paket: node-miller-rabin (4.0.1-1)
Länkar för node-miller-rabin
Trisquelresurser:
Hämta källkodspaketet node-miller-rabin:
- [node-miller-rabin_4.0.1-1.dsc]
- [node-miller-rabin_4.0.1.orig.tar.gz]
- [node-miller-rabin_4.0.1-1.debian.tar.xz]
Ansvarig:
Original Maintainers:
- Debian Javascript Maintainers (E-postarkiv)
- Bastien Roucariès
Externa resurser:
- Hemsida [github.com]
Liknande paket:
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.
Andra paket besläktade med node-miller-rabin
|
|
|
-
- dep: node-bn.js (>= 4.0.0)
- Big number implementation in pure javascript
-
- dep: node-brorand (>= 1.0.1)
- Random number generator for browsers and node.js
-
- dep: nodejs (>= 4.7)
- evented I/O for V8 javascript
Hämta node-miller-rabin
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 3,8 kbyte | 19 kbyte | [filförteckning] |