Miller Rabin algorithm for primality test
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
Implementation of the Miller-Rabin primality test.
Lucas-Lehmer primality test
Fermat's probabilistic primality test
Primality test using fast checks and miller-rabin (all in one)
integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test
A Miller-Rabin primality test implementation for TypeScript
Test if a number is a prime using Strengthening the Baillie-PSW primality test.
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
Uses the Fermat primality test with 100 runs to determine if a number is prime
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
Test if number is prime with Miller–Rabin primality test
Minimal implementation of older cryptography algorithms: RSA, DSA, DH, ElGamal
Arbitrary precision modular arithmetic, cryptographically secure random numbers and strong probable prime generation/testing. It works in modern browsers, Angular, React, Node.js, etc. since it uses the native JS implementation of BigInt
An implementation of the Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt
A JavaScript library for prime numbers.
Give a regex, get a robust predicate function that tests it against a string.
Table-driven tests for Mocha
check if a number is prime
test for inclusion or exclusion of paths using globs
Helper functions
A pure JS implementation SHA256.
Pure JS implementation of CRC32 https://en.wikipedia.org/wiki/Cyclic_redundancy_check
test primality
An Uber-fast primality testing library.
An Uber-fast primality testing library.
A number theory library written in pure Ruby. Provides methods for primality test, factoring integers, and more.