From 24b2677bfdbdb5bf808e0bd6e9908d11fb0d01fe Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Juan=20Hern=C3=A1ndez=20Serrano?= <jserrano@entel.upc.edu>
Date: Wed, 29 May 2019 17:45:36 +0200
Subject: [PATCH] modPow() comments

---
 README.md                                      | 4 ++--
 dist/bigint-crypto-utils-latest.browser.js     | 3 ++-
 dist/bigint-crypto-utils-latest.browser.mod.js | 3 ++-
 dist/bigint-crypto-utils-latest.node.js        | 3 ++-
 4 files changed, 8 insertions(+), 5 deletions(-)

diff --git a/README.md b/README.md
index c4bb6c4..178fd0c 100644
--- a/README.md
+++ b/README.md
@@ -108,7 +108,7 @@ iterations of Miller-Rabin Probabilistic Primality Test (FIPS 186-4 C.3.1)</p>
 <dd><p>Modular inverse.</p>
 </dd>
 <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>
 <dt><a href="#prime">prime(bitLength, iterations)</a> ⇒ <code>Promise</code></dt>
 <dd><p>A probably-prime (Miller-Rabin), cryptographically-secure, random-number generator. 
@@ -236,7 +236,7 @@ Modular inverse.
 <a name="modPow"></a>
 
 ## 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  
 **Returns**: <code>bigint</code> - b**e mod n  
diff --git a/dist/bigint-crypto-utils-latest.browser.js b/dist/bigint-crypto-utils-latest.browser.js
index 388d584..5b9001f 100644
--- a/dist/bigint-crypto-utils-latest.browser.js
+++ b/dist/bigint-crypto-utils-latest.browser.js
@@ -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} e exponent
      * @param {number|bigint} n modulo
diff --git a/dist/bigint-crypto-utils-latest.browser.mod.js b/dist/bigint-crypto-utils-latest.browser.mod.js
index 9726f72..fc0a59e 100644
--- a/dist/bigint-crypto-utils-latest.browser.mod.js
+++ b/dist/bigint-crypto-utils-latest.browser.mod.js
@@ -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} e exponent
  * @param {number|bigint} n modulo
diff --git a/dist/bigint-crypto-utils-latest.node.js b/dist/bigint-crypto-utils-latest.node.js
index 9ba3d28..5ce215b 100644
--- a/dist/bigint-crypto-utils-latest.node.js
+++ b/dist/bigint-crypto-utils-latest.node.js
@@ -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} e exponent
  * @param {number|bigint} n modulo