Showing 1-20 of 67 packages
Miller Rabin algorithm for primality test
A JavaScript library for prime numbers.
Implementation of the Miller-Rabin primality test.
Lucas-Lehmer primality test
Primality test using fast checks and miller-rabin (all in one)
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
Fermat's probabilistic primality test
Ultra-fast primality testing with Montgomery arithmetic (32-bit and 64-bit)
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
Eratosthenes primality implementation
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
Minimal implementation of older cryptography algorithms: RSA, DSA, DH, ElGamal
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
Test if number is prime with Miller–Rabin primality test
Uses the Fermat primality test with 100 runs to determine if a number is prime
integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test
TypeScript implementation of a probabilistic primality testing on the basis of Fermat's Little Theorem and Miller Rabin Theorem
An implementation of the Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt
check if a number is prime
A Miller-Rabin primality test implementation for TypeScript