How to Install and Uninstall node-miller-rabin Package on Kali Linux
Last updated: January 23,2025
1. Install "node-miller-rabin" package
This guide let you learn how to install node-miller-rabin on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
node-miller-rabin
Copied
2. Uninstall "node-miller-rabin" package
Here is a brief guide to show you how to uninstall node-miller-rabin on Kali Linux:
$
sudo apt remove
node-miller-rabin
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the node-miller-rabin package on Kali Linux
Package: node-miller-rabin
Version: 4.0.1-9
Installed-Size: 19
Maintainer: Debian Javascript Maintainers
Architecture: all
Depends: node-brorand, node-bn.js, nodejs:any
Size: 4688
SHA256: f793089fec87896a622415cbc2aa5097f5cce5cf96f2fd1008ed21a9f1417a3f
SHA1: 254af089548f96ab1390ccc0a7067e412b72a927
MD5sum: eff9f3607a8a8cd754e9474e118535fc
Description: 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.
Description-md5:
Homepage: https://github.com/indutny/miller-rabin
Section: javascript
Priority: optional
Filename: pool/main/n/node-miller-rabin/node-miller-rabin_4.0.1-9_all.deb
Version: 4.0.1-9
Installed-Size: 19
Maintainer: Debian Javascript Maintainers
Architecture: all
Depends: node-brorand, node-bn.js, nodejs:any
Size: 4688
SHA256: f793089fec87896a622415cbc2aa5097f5cce5cf96f2fd1008ed21a9f1417a3f
SHA1: 254af089548f96ab1390ccc0a7067e412b72a927
MD5sum: eff9f3607a8a8cd754e9474e118535fc
Description: 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.
Description-md5:
Homepage: https://github.com/indutny/miller-rabin
Section: javascript
Priority: optional
Filename: pool/main/n/node-miller-rabin/node-miller-rabin_4.0.1-9_all.deb