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
Implementation of the Miller-Rabin primality test.
Provides functions for detecting if the host environment supports the WebCrypto API
A pure JS implementation SHA256.
SHA256 wrapper for browsers that prefers `window.crypto.subtle` but will fall back to a pure JS implementation in @aws-crypto/sha256-js to provide a consistent interface for SHA256.
implementation of crypto for the browser
JavaScript library of crypto standards.
Helper functions
Pure JS implementation of CRC32 https://en.wikipedia.org/wiki/Cyclic_redundancy_check
A time-lock puzzle generator
Pure JS implementation of CRC32-C https://en.wikipedia.org/wiki/Cyclic_redundancy_check
adds node crypto signing for browsers
Provides functions and types for detecting if the host environment is IE11
aes, for browserify
abstract base class for hash-streams
TypeScript definitions for crypto-js
Minimalistic tools for JS crypto modules
RSA for browserify
SHA1 wrapper for browsers that prefers `window.crypto.subtle`.
abstract base class for crypto-streams
browserify version of publicEncrypt & privateDecrypt
Generate a cryptographically strong random string
Single API for Web Crypto API and Crypto Subtle working in Node.js, Browsers and other runtimes
An implementation of the Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt
Implementation of primality tests for multi-precision numbers using crypto-bigint
Random prime number generation and primality checking library