10 KiB
bigint-crypto-utils - v3.2.1
Table of contents
Functions
- abs
- bitLength
- eGcd
- gcd
- isProbablyPrime
- lcm
- max
- min
- modInv
- modPow
- prime
- primeSync
- randBetween
- randBits
- randBitsSync
- randBytes
- randBytesSync
- toZn
Functions
abs
▸ abs(a
): number
| bigint
Parameters
Name | Type |
---|---|
a |
number | bigint |
Returns
number
| bigint
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:1
bitLength
▸ bitLength(a
): number
Parameters
Name | Type |
---|---|
a |
number | bigint |
Returns
number
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:3
eGcd
▸ eGcd(a
, b
): Egcd
Parameters
Name | Type |
---|---|
a |
number | bigint |
b |
number | bigint |
Returns
Egcd
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:10
gcd
▸ gcd(a
, b
): bigint
Parameters
Name | Type |
---|---|
a |
number | bigint |
b |
number | bigint |
Returns
bigint
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:12
isProbablyPrime
▸ isProbablyPrime(w
, iterations?
, disableWorkers?
): Promise
<boolean
>
The test first tries if any of the first 250 small primes are a factor of the input number and then passes several iterations of Miller-Rabin Probabilistic Primality Test (FIPS 186-4 C.3.1)
Throws
RangeError if w<0
Parameters
Name | Type | Default value | Description |
---|---|---|---|
w |
number | bigint |
undefined |
A positive integer to be tested for primality |
iterations |
number |
16 |
The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3 of FIPS 186-4 |
disableWorkers |
boolean |
false |
Disable the use of workers for the primality test |
Returns
Promise
<boolean
>
A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite)
Defined in
lcm
▸ lcm(a
, b
): bigint
Parameters
Name | Type |
---|---|
a |
number | bigint |
b |
number | bigint |
Returns
bigint
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:14
max
▸ max(a
, b
): number
| bigint
Parameters
Name | Type |
---|---|
a |
number | bigint |
b |
number | bigint |
Returns
number
| bigint
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:16
min
▸ min(a
, b
): number
| bigint
Parameters
Name | Type |
---|---|
a |
number | bigint |
b |
number | bigint |
Returns
number
| bigint
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:18
modInv
▸ modInv(a
, n
): bigint
Parameters
Name | Type |
---|---|
a |
number | bigint |
n |
number | bigint |
Returns
bigint
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:20
modPow
▸ modPow(b
, e
, n
): bigint
Parameters
Name | Type |
---|---|
b |
number | bigint |
e |
number | bigint |
n |
number | bigint |
Returns
bigint
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:22
prime
▸ prime(bitLength
, iterations?
): Promise
<bigint
>
A probably-prime (Miller-Rabin), cryptographically-secure, random-number generator. The browser version uses web workers to parallelise prime look up. Therefore, it does not lock the UI main process, and it can be much faster (if several cores or cpu are available). The node version can also use worker_threads if they are available (enabled by default with Node 11 and and can be enabled at runtime executing node --experimental-worker with node >=10.5.0).
Throws
RangeError if bitLength < 1
Parameters
Name | Type | Default value | Description |
---|---|---|---|
bitLength |
number |
undefined |
The required bit length for the generated prime |
iterations |
number |
16 |
The number of iterations for the Miller-Rabin Probabilistic Primality Test |
Returns
Promise
<bigint
>
A promise that resolves to a bigint probable prime of bitLength bits.
Defined in
primeSync
▸ primeSync(bitLength
, iterations?
): bigint
A probably-prime (Miller-Rabin), cryptographically-secure, random-number generator. The sync version is NOT RECOMMENDED since it won't use workers and thus it'll be slower and may freeze thw window in browser's javascript. Please consider using prime() instead.
Throws
RangeError if bitLength < 1
Parameters
Name | Type | Default value | Description |
---|---|---|---|
bitLength |
number |
undefined |
The required bit length for the generated prime |
iterations |
number |
16 |
The number of iterations for the Miller-Rabin Probabilistic Primality Test |
Returns
bigint
A bigint probable prime of bitLength bits.
Defined in
randBetween
▸ randBetween(max
, min?
): bigint
Returns a cryptographically secure random integer between [min,max].
Throws
RangeError if max <= min
Parameters
Name | Type | Description |
---|---|---|
max |
bigint |
Returned value will be <= max |
min |
bigint |
Returned value will be >= min |
Returns
bigint
A cryptographically secure random bigint between [min,max]
Defined in
randBits
▸ randBits(bitLength
, forceLength?
): Promise
<Uint8Array
| Buffer
>
Secure random bits for both node and browsers. Node version uses crypto.randomFill() and browser one self.crypto.getRandomValues()
Throws
RangeError if bitLength < 1
Parameters
Name | Type | Default value | Description |
---|---|---|---|
bitLength |
number |
undefined |
The desired number of random bits |
forceLength |
boolean |
false |
Set to true if you want to force the output to have a specific bit length. It basically forces the msb to be 1 |
Returns
Promise
<Uint8Array
| Buffer
>
A Promise that resolves to a UInt8Array/Buffer (Browser/Node.js) filled with cryptographically secure random bits
Defined in
randBitsSync
▸ randBitsSync(bitLength
, forceLength?
): Uint8Array
| Buffer
Secure random bits for both node and browsers. Node version uses crypto.randomFill() and browser one self.crypto.getRandomValues()
Throws
RangeError if bitLength < 1
Parameters
Name | Type | Default value | Description |
---|---|---|---|
bitLength |
number |
undefined |
The desired number of random bits |
forceLength |
boolean |
false |
Set to true if you want to force the output to have a specific bit length. It basically forces the msb to be 1 |
Returns
Uint8Array
| Buffer
A Uint8Array/Buffer (Browser/Node.js) filled with cryptographically secure random bits
Defined in
randBytes
▸ randBytes(byteLength
, forceLength?
): Promise
<Uint8Array
| Buffer
>
Secure random bytes for both node and browsers. Node version uses crypto.randomBytes() and browser one self.crypto.getRandomValues()
Throws
RangeError if byteLength < 1
Parameters
Name | Type | Default value | Description |
---|---|---|---|
byteLength |
number |
undefined |
The desired number of random bytes |
forceLength |
boolean |
false |
Set to true if you want to force the output to have a bit length of 8*byteLength. It basically forces the msb to be 1 |
Returns
Promise
<Uint8Array
| Buffer
>
A promise that resolves to a UInt8Array/Buffer (Browser/Node.js) filled with cryptographically secure random bytes
Defined in
randBytesSync
▸ randBytesSync(byteLength
, forceLength?
): Uint8Array
| Buffer
Secure random bytes for both node and browsers. Node version uses crypto.randomFill() and browser one self.crypto.getRandomValues() This is the synchronous version, consider using the asynchronous one for improved efficiency.
Throws
RangeError if byteLength < 1
Parameters
Name | Type | Default value | Description |
---|---|---|---|
byteLength |
number |
undefined |
The desired number of random bytes |
forceLength |
boolean |
false |
Set to true if you want to force the output to have a bit length of 8*byteLength. It basically forces the msb to be 1 |
Returns
Uint8Array
| Buffer
A UInt8Array/Buffer (Browser/Node.js) filled with cryptographically secure random bytes
Defined in
toZn
▸ toZn(a
, n
): bigint
Parameters
Name | Type |
---|---|
a |
number | bigint |
n |
number | bigint |
Returns
bigint
Defined in
node_modules/bigint-mod-arith/dist/index.d.ts:24