Go to file
Juanra Dikal b967f954b3 3.1.7 2022-10-03 23:43:58 +02:00
.github github default branch moved from master to main 2022-10-03 23:41:08 +02:00
.vscode project migrated to typescript 2021-03-25 13:40:04 +01:00
build github default branch moved from master to main 2022-10-03 23:41:08 +02:00
dist coverage is properly working again 2022-10-03 19:57:08 +02:00
docs 3.1.7 2022-10-03 23:43:58 +02:00
examples finally ESM working with tests!! 2022-08-01 19:10:00 +02:00
src minor fixes 2022-10-03 23:20:46 +02:00
test coverage is properly working again 2022-10-03 19:57:08 +02:00
types fixed issues/typos with docs 2022-09-12 11:14:59 +02:00
.gitignore fixed bug in node ESM and better packing 2022-08-01 22:27:32 +02:00
.npmignore fixed bug in node ESM and better packing 2022-08-01 22:27:32 +02:00
CODE_OF_CONDUCT.md Create CODE_OF_CONDUCT.md 2021-08-06 19:34:48 +02:00
LICENSE working with worker file 2019-04-19 09:42:28 +02:00
README.md 3.1.7 2022-10-03 23:43:58 +02:00
package-lock.json 3.1.7 2022-10-03 23:43:58 +02:00
package.json 3.1.7 2022-10-03 23:43:58 +02:00
tsconfig.json coverage is properly working again 2022-10-03 19:57:08 +02:00

README.md

License: MIT JavaScript Style Guide Node.js CI Coverage Status

bigint-crypto-utils

Arbitrary precision modular arithmetic, cryptographically secure random numbers and strong probable prime generation/testing.

It relies on the native JS implementation of (BigInt). It can be used by any Web Browser or webview supporting BigInt and with Node.js (>=10.4.0). The bundles can be imported directly by the browser or in Angular projects, React apps, Node.js, etc.

Secure random numbers are generated using the native crypto implementation of the browsers (Web Cryptography API) or Node.js Crypto. Strong probable prime generation and testing use Miller-Rabin primality tests and are automatically sped up using parallel workers both in browsers and Node.js.

The operations supported on BigInts are not constant time. BigInt can be therefore unsuitable for use in cryptography. Many platforms provide native support for cryptography, such as Web Cryptography API or Node.js Crypto.

Usage

bigint-crypto-utils can be imported to your project with npm:

npm install bigint-crypto-utils

Then either require (Node.js CJS):

const bigintCryptoUtils = require('bigint-crypto-utils')

or import (JavaScript ES module):

import * as bigintCryptoUtils from 'bigint-crypto-utils'

The appropriate version for browser or node is automatically exported.

bigint-crypto-utils uses ES2020 BigInt, so take into account that:

  1. If you experience issues using webpack/babel to create your production bundles, you may edit the supported browsers list and leave only supported browsers and versions. The browsers list is usually located in your project's package.json or the .browserslistrc file.
  2. In order to use bigint-crypto-utils with TypeScript you need to set target, and lib and module if in use, to ES2020 in your project's tsconfig.json.

You can also download the IIFE bundle, the ESM bundle or the UMD bundle and manually add it to your project, or, if you have already installed bigint-crypto-utils in your project, just get the bundles from node_modules/bigint-crypto-utils/dist/bundles/.

An example of usage could be (complete examples can be found in the examples directory):

/* A BigInt with value 666 can be declared calling the bigint constructor as
BigInt('666') or with the shorter 666n.
Notice that you can also pass a number to the constructor, e.g. BigInt(666).
However, it is not recommended since values over 2**53 - 1 won't be safe but
no warning will be raised.
*/
const a = BigInt('5')
const b = BigInt('2')
const n = 19n

console.log(bigintCryptoUtils.modPow(a, b, n)) // prints 6

console.log(bigintCryptoUtils.modInv(2n, 5n)) // prints 3

console.log(bigintCryptoUtils.modInv(BigInt('3'), BigInt('5'))) // prints 2

console.log(bigintCryptoUtils.randBetween(2n ** 256n)) // prints a cryptographically secure random number between 1 and 2**256 (both included).

async function primeTesting (): void {
  // Let us print out a probable prime of 2048 bits
  console.log(await bigintCryptoUtils.prime(2048))

  // Testing if number is a probable prime (Miller-Rabin)
  const number = 27n
  const isPrime = await bigintCryptoUtils.isProbablyPrime(number)
  if (isPrime === true) {
    console.log(`${number} is prime`)
  } else {
    console.log(`${number} is composite`)
  }
}

primeTesting()

API reference documentation

Check the API