bigint-crypto-utils - npm Package Compare versions

Comparing version 2.3.2 to 2.3.3

dist/bigint-crypto-utils-latest.browser.js

		@@ -260,3 +260,2 @@ var bigintCryptoUtils = (function (exports) {
		* @param {number} [iterations = 16] The number of iterations for the Miller-Rabin Probabilistic Primality Test
		* @param {boolean} sync NOT RECOMMENDED. Invoke the function synchronously. It won't use workers so it'll be slower and may freeze thw window in browser's javascript.
		*
		@@ -263,0 +262,0 @@ * @returns {Promise} A promise that resolves to a bigint probable prime of bitLength bits.

dist/bigint-crypto-utils-latest.browser.mod.js

		@@ -257,3 +257,2 @@ const _ZERO = BigInt(0);
		* @param {number} [iterations = 16] The number of iterations for the Miller-Rabin Probabilistic Primality Test
		* @param {boolean} sync NOT RECOMMENDED. Invoke the function synchronously. It won't use workers so it'll be slower and may freeze thw window in browser's javascript.
		*
		@@ -260,0 +259,0 @@ * @returns {Promise} A promise that resolves to a bigint probable prime of bitLength bits.

dist/bigint-crypto-utils-latest.node.js

		@@ -267,3 +267,2 @@ 'use strict';
		* @param {number} [iterations = 16] The number of iterations for the Miller-Rabin Probabilistic Primality Test
		* @param {boolean} sync NOT RECOMMENDED. Invoke the function synchronously. It won't use workers so it'll be slower and may freeze thw window in browser's javascript.
		*
		@@ -270,0 +269,0 @@ * @returns {Promise} A promise that resolves to a bigint probable prime of bitLength bits.

package.json

		{
		"name": "bigint-crypto-utils",
		"version": "2.3.2",
		"version": "2.3.3",
		"description": "Utils for working with cryptography using native JS (stage 3) implementation of BigInt. It includes arbitrary precision modular arithmetics, cryptographically secure random numbers and strong probable prime generation/testing.",
		@@ -5,0 +5,0 @@ "keywords": [

README.md

		@@ -119,3 +119,3 @@ # bigint-crypto-utils
		</dd>
		<dt><a href="#prime">prime(bitLength, [iterations], sync)</a> ⇒ <code>Promise</code></dt>
		<dt><a href="#prime">prime(bitLength, [iterations])</a> ⇒ <code>Promise</code></dt>
		<dd><p>A probably-prime (Miller-Rabin), cryptographically-secure, random-number generator.
		@@ -289,3 +289,3 @@ The browser version uses web workers to parallelise prime look up. Therefore, it does not lock the UI

		## prime(bitLength, [iterations], sync) ⇒ <code>Promise</code>
		## prime(bitLength, [iterations]) ⇒ <code>Promise</code>
		A probably-prime (Miller-Rabin), cryptographically-secure, random-number generator.
		@@ -304,3 +304,2 @@ The browser version uses web workers to parallelise prime look up. Therefore, it does not lock the UI
		\| [iterations] \| <code>number</code> \| <code>16</code> \| The number of iterations for the Miller-Rabin Probabilistic Primality Test \|
		\| sync \| <code>boolean</code> \| \| NOT RECOMMENDED. Invoke the function synchronously. It won't use workers so it'll be slower and may freeze thw window in browser's javascript. \|

		@@ -307,0 +306,0 @@ <a name="primeSync"></a>

src/main.js

		@@ -284,3 +284,2 @@ 'use strict';
		* @param {number} [iterations = 16] The number of iterations for the Miller-Rabin Probabilistic Primality Test
		* @param {boolean} sync NOT RECOMMENDED. Invoke the function synchronously. It won't use workers so it'll be slower and may freeze thw window in browser's javascript.
		*
		@@ -287,0 +286,0 @@ * @returns {Promise} A promise that resolves to a bigint probable prime of bitLength bits.

New alerts