miller-rabin

Miller Rabin algorithm for primality test

v4.0.1 URL: https://unpkg.com/miller-rabin@4.0.1/lib/mr.js

Open Browse Files

prime miller-rabin bignumber

bigint-crypto-utils

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

v3.3.0 URL: https://unpkg.com/bigint-crypto-utils@3.3.0/dist/index.browser.esm.js

Open Browse Files

modular arithmetics crypto prime random rng prng primality test BigInt angular react

@stdlib/assert-is-prime

Test if a value is a prime number.

v0.2.2 URL: https://unpkg.com/@stdlib/assert-is-prime@0.2.2/lib/index.js

Open Browse Files

stdlib stdassert assertion assert utilities utility utils util number numeric integer int prime primality is isprime type check valid validate test primitive object

wasmcurves

elliptic curves implementations in wasm

v0.2.2 URL: https://unpkg.com/wasmcurves@0.2.2/index.js

Open Browse Files

bigint bignum biginteger zq elliptic curve prime field

is-prime-fast

Fastest algorithm ever created to detect if a number is prime in O(1), that works in 95%+ cases for numbers in the 32-bit int range

v1.1.69420 URL: https://unpkg.com/is-prime-fast@1.1.69420/index.js

Open Browse Files