Showing 1-20 of 431 packages
Miller Rabin algorithm for primality test
Implementation of the Miller-Rabin primality test.
Generate a cryptographically-random probable prime number that passes the Miller-Rabin test with the given number of bits of entropy.
Primality test using fast checks and miller-rabin (all in one)
encrypt and decrypt with Miller-Rabin
A Miller-Rabin primality test implementation for TypeScript
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
Rabin fingerprinting implemented in AssemblyScript
Rabin chunker for IPFS implementation in Rust
TypeScript definitions for ramda
Test if number is prime with Miller–Rabin primality test
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large 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
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
detector of copy/paste in files
@intlify/shared
Park-Miller pseudorandom number generator (PRNG)
A robust & optimized `String.prototype.includes` polyfill, based on the ECMAScript 6 specification.
TypeScript definitions for @recurly/recurly-js