LumeWeb
/
bigint-crypto-utils
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fixed prime fn doc in README

This commit is contained in:
juanelas 2019-12-09 13:18:10 +01:00
parent cbb64b5dd1
commit b6129550e5
1 changed files with 0 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/main.js
View File

@ -281,7 +281,6 @@ export function modPow(b, e, n) {
* *
* @param {number} bitLength The required bit length for the generated prime * @param {number} bitLength The required bit length for the generated prime
* @param {number} [iterations = 16] The number of iterations for the Miller-Rabin Probabilistic Primality Test * @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.
* *
* @returns {Promise} A promise that resolves to a bigint probable prime of bitLength bits. * @returns {Promise} A promise that resolves to a bigint probable prime of bitLength bits.
*/ */