Miller Rabin algorithm for primality test

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)

An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.

A Miller-Rabin primality test implementation for TypeScript

integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test

Test if a number is a prime using Strengthening the Baillie-PSW primality test.

Test if number is prime with Miller–Rabin primality test

A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes

Uses the Fermat primality test with 100 runs to determine if a number is prime

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

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.

Give a regex, get a robust predicate function that tests it against a string.

Parameterised tests for Jest

unist utility to check if a node passes a test

Storybook Vitest addon: Blazing fast component testing using stories

An implementation of the Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt