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

modPow() comments

This commit is contained in:
Juan Hernández Serrano 2019-05-29 17:45:36 +02:00
parent c175bbbd20
commit 24b2677bfd
4 changed files with 8 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -108,7 +108,7 @@ iterations of Miller-Rabin Probabilistic Primality Test (FIPS 186-4 C.3.1)</p>
<dd><p>Modular inverse.</p> <dd><p>Modular inverse.</p>
</dd> </dd>
<dt><a href="#modPow">modPow(b, e, n)</a> ⇒ <code>bigint</code></dt> <dt><a href="#modPow">modPow(b, e, n)</a> ⇒ <code>bigint</code></dt>
<dd><p>Modular exponentiation b**e mod n</p> <dd><p>Modular exponentiation b**e mod n. Currently using the right-to-left binary method</p>
</dd> </dd>
<dt><a href="#prime">prime(bitLength, iterations)</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. <dd><p>A probably-prime (Miller-Rabin), cryptographically-secure, random-number generator.
@ -236,7 +236,7 @@ Modular inverse.
<a name="modPow"></a> <a name="modPow"></a>
## modPow(b, e, n) ⇒ <code>bigint</code> ## modPow(b, e, n) ⇒ <code>bigint</code>
Modular exponentiation b**e mod n Modular exponentiation b**e mod n. Currently using the right-to-left binary method
**Kind**: global function **Kind**: global function
**Returns**: <code>bigint</code> - b**e mod n **Returns**: <code>bigint</code> - b**e mod n

3
dist/bigint-crypto-utils-latest.browser.js vendored
View File

@ -187,7 +187,8 @@ var bigintCryptoUtils = (function (exports) {
} }
/** /**
* Modular exponentiation b**e mod n * Modular exponentiation b**e mod n. Currently using the right-to-left binary method
*
* @param {number|bigint} b base * @param {number|bigint} b base
* @param {number|bigint} e exponent * @param {number|bigint} e exponent
* @param {number|bigint} n modulo * @param {number|bigint} n modulo

3
dist/bigint-crypto-utils-latest.browser.mod.js vendored
View File

@ -184,7 +184,8 @@ function modInv(a, n) {
} }
/** /**
* Modular exponentiation b**e mod n * Modular exponentiation b**e mod n. Currently using the right-to-left binary method
*
* @param {number|bigint} b base * @param {number|bigint} b base
* @param {number|bigint} e exponent * @param {number|bigint} e exponent
* @param {number|bigint} n modulo * @param {number|bigint} n modulo

3
dist/bigint-crypto-utils-latest.node.js vendored
View File

@ -194,7 +194,8 @@ function modInv(a, n) {
} }
/** /**
* Modular exponentiation b**e mod n * Modular exponentiation b**e mod n. Currently using the right-to-left binary method
*
* @param {number|bigint} b base * @param {number|bigint} b base
* @param {number|bigint} e exponent * @param {number|bigint} e exponent
* @param {number|bigint} n modulo * @param {number|bigint} n modulo