A big integer library for JavaScript
-
Updated
Sep 3, 2019 - JavaScript
A big integer library for JavaScript
A Javascript numerical library to represent numbers as large as 10^^1e308 and as small as 10^-10^^1e308. Sequel to break_infinity.js, designed for incremental games.
Utils for working with cryptography using native JS implementation of BigInt. It includes arbitrary precision modular arithmetics, cryptographically secure random numbers and strong probable prime generation/testing. It works with Node.js, and native JS, including React and Angular
NEWS! We will soon release a TypeScript transpilation and improvement of this library. Self-contained cryptographic library for use in electronic voting clients. Complete documentation with references to the literature makes it good teaching material.
A BigDecimal library for arbitrary precision that allows you to work with numbers in different bases from 2 to 36.
Encode and decode arbitrarily large signed and unsigned BigInts
Floating point precision on PI
🐘 Arbitrary precision arithmetic for integers in big-endian order for JavaScript
🐁 Arbitrary precision arithmetic for integers in little-endian order for JavaScript
💤 Integers for JavaScript (ℤ)
generate ascii hashmap using big integers
Elliptic utility base on http://www-cs-students.stanford.edu/~tjw
Large integers with high precision! Get precise calculations for numbers way bigger than thousands of numbers long!
De- and encryption platform featuring different ciphers and algorithms 👩💻
Write some util code for javascript
RSA algorithm is an asymmetric cryptography algorithm. Asymmetric actually means that it works on two different keys i.e. Public Key and Private Key.
Add a description, image, and links to the biginteger topic page so that developers can more easily learn about it.
To associate your repository with the biginteger topic, visit your repo's landing page and select "manage topics."