Implementation of the Miller-Rabin primality test.
Minimal implementation of older cryptography algorithms: RSA, DSA, DH, ElGamal
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 Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt
A JavaScript library for prime numbers.
check if a number is prime
A time-lock puzzle generator
Usefull functions for solving programming tasks
Table-driven tests for Mocha
Integer Factorization Approaches with JavaScript
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
Lucas-Lehmer primality test
An implementation of the Miller-Rabin primality test to efficiently determine with high probability whether some arbitrarily-large number is prime.
module with functions relating to the prime factors of a positive integer
Memory-efficient JavaScript utility for index-based prime searching.
A high-performance TypeScript library for primality testing using Miller-Rabin and Fermat algorithms.
prime number utilities for cryptomancy
TypeScript implementation of a probabilistic primality testing on the basis of Fermat's Little Theorem and Miller Rabin Theorem
My Prime Library is a comprehensive TypeScript/React package for prime number operations and visualization. This library provides optimized algorithms for prime checking, generation, factorization, and advanced prime analysis with a feature-rich React com
Assertion checker for Solidity smart contracts based on MythX
Fermat's probabilistic primality test
Provide a collection of cryptography functions and a CLI.
Strict integer validation and hybrid prime identification using BigInt
Uses the Fermat primality test with 100 runs to determine if a number is prime