Showing 1-20 of 323,358 packages
Miller Rabin algorithm for primality test
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
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
Test if number is prime with Miller–Rabin primality test
integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test
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
A Miller-Rabin primality test implementation for TypeScript
Give a regex, get a robust predicate function that tests it against a string.
Test if a number is a prime using Strengthening the Baillie-PSW primality test.
Minimal implementation of older cryptography algorithms: RSA, DSA, DH, ElGamal
Parameterised tests for Jest
unist utility to check if a node passes a test
Storybook Vitest addon: Blazing fast component testing using stories
Starts server, waits for URL, then runs test command; when the tests end, shuts down server
An implementation of the Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt