qidian-shared 1.0.68 → 1.0.69

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/rsa.mjs

@@ -0,0 +1,357 @@
+import { BigInteger, parseBigInt, nbi } from "./jsbn.mjs";
+import { SecureRandom } from "./rng.mjs";
+import { rstr_sha256 } from "./sha256.mjs";
+function pkcs1pad1(s, n) {
+  if (n < s.length + 22) {
+    console.error("Message too long for RSA");
+    return null;
+  }
+  var len = n - s.length - 6;
+  var filler = "";
+  for (var f = 0; f < len; f += 2) {
+    filler += "ff";
+  }
+  var m = "0001" + filler + "00" + s;
+  return parseBigInt(m, 16);
+}
+function pkcs1pad2(s, n) {
+  if (n < s.length + 11) {
+    console.error("Message too long for RSA");
+    return null;
+  }
+  var ba = [];
+  var i = s.length - 1;
+  while (i >= 0 && n > 0) {
+    var c = s.charCodeAt(i--);
+    if (c < 128) {
+      ba[--n] = c;
+    } else if (c > 127 && c < 2048) {
+      ba[--n] = c & 63 | 128;
+      ba[--n] = c >> 6 | 192;
+    } else {
+      ba[--n] = c & 63 | 128;
+      ba[--n] = c >> 6 & 63 | 128;
+      ba[--n] = c >> 12 | 224;
+    }
+  }
+  ba[--n] = 0;
+  var rng = new SecureRandom();
+  var x = [];
+  while (n > 2) {
+    x[0] = 0;
+    while (x[0] == 0) {
+      rng.nextBytes(x);
+    }
+    ba[--n] = x[0];
+  }
+  ba[--n] = 2;
+  ba[--n] = 0;
+  return new BigInteger(ba);
+}
+function oaep_mgf1_arr(seed, len, hashFunc) {
+  var mask = "", i = 0;
+  while (mask.length < len) {
+    mask += hashFunc(String.fromCharCode.apply(String, seed.concat([
+      (i & 4278190080) >> 24,
+      (i & 16711680) >> 16,
+      (i & 65280) >> 8,
+      i & 255
+    ])));
+    i += 1;
+  }
+  return mask;
+}
+var SHA256_SIZE = 32;
+function oaep_pad(s, n) {
+  var hashLen = SHA256_SIZE;
+  var hashFunc = rstr_sha256;
+  if (s.length + 2 * hashLen + 2 > n) {
+    throw "Message too long for RSA";
+  }
+  var PS = "", i;
+  for (i = 0; i < n - s.length - 2 * hashLen - 2; i += 1) {
+    PS += "\0";
+  }
+  var DB = hashFunc("") + PS + "
" + s, seed = new Array(hashLen);
+  new SecureRandom().nextBytes(seed);
+  var dbMask = oaep_mgf1_arr(seed, DB.length, hashFunc), maskedDB = [];
+  for (i = 0; i < DB.length; i += 1) {
+    maskedDB[i] = DB.charCodeAt(i) ^ dbMask.charCodeAt(i);
+  }
+  var seedMask = oaep_mgf1_arr(maskedDB, seed.length, hashFunc), maskedSeed = [0];
+  for (i = 0; i < seed.length; i += 1) {
+    maskedSeed[i + 1] = seed[i] ^ seedMask.charCodeAt(i);
+  }
+  return new BigInteger(maskedSeed.concat(maskedDB));
+}
+var RSAKey = (
+  /** @class */
+  (function() {
+    function RSAKey2() {
+      this.n = null;
+      this.e = 0;
+      this.d = null;
+      this.p = null;
+      this.q = null;
+      this.dmp1 = null;
+      this.dmq1 = null;
+      this.coeff = null;
+    }
+    RSAKey2.prototype.doPublic = function(x) {
+      return x.modPowInt(this.e, this.n);
+    };
+    RSAKey2.prototype.doPrivate = function(x) {
+      if (this.p == null || this.q == null) {
+        return x.modPow(this.d, this.n);
+      }
+      var xp = x.mod(this.p).modPow(this.dmp1, this.p);
+      var xq = x.mod(this.q).modPow(this.dmq1, this.q);
+      while (xp.compareTo(xq) < 0) {
+        xp = xp.add(this.p);
+      }
+      return xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq);
+    };
+    RSAKey2.prototype.setPublic = function(N, E) {
+      if (N != null && E != null && N.length > 0 && E.length > 0) {
+        this.n = parseBigInt(N, 16);
+        this.e = parseInt(E, 16);
+      } else {
+        console.error("Invalid RSA public key");
+      }
+    };
+    RSAKey2.prototype.encrypt = function(text, paddingFunction) {
+      if (typeof paddingFunction === "undefined") {
+        paddingFunction = pkcs1pad2;
+      }
+      var maxLength = this.n.bitLength() + 7 >> 3;
+      var m = paddingFunction(text, maxLength);
+      if (m == null) {
+        return null;
+      }
+      var c = this.doPublic(m);
+      if (c == null) {
+        return null;
+      }
+      var h = c.toString(16);
+      var length = h.length;
+      for (var i = 0; i < maxLength * 2 - length; i++) {
+        h = "0" + h;
+      }
+      return h;
+    };
+    RSAKey2.prototype.setPrivate = function(N, E, D) {
+      if (N != null && E != null && N.length > 0 && E.length > 0) {
+        this.n = parseBigInt(N, 16);
+        this.e = parseInt(E, 16);
+        this.d = parseBigInt(D, 16);
+      } else {
+        console.error("Invalid RSA private key");
+      }
+    };
+    RSAKey2.prototype.setPrivateEx = function(N, E, D, P, Q, DP, DQ, C) {
+      if (N != null && E != null && N.length > 0 && E.length > 0) {
+        this.n = parseBigInt(N, 16);
+        this.e = parseInt(E, 16);
+        this.d = parseBigInt(D, 16);
+        this.p = parseBigInt(P, 16);
+        this.q = parseBigInt(Q, 16);
+        this.dmp1 = parseBigInt(DP, 16);
+        this.dmq1 = parseBigInt(DQ, 16);
+        this.coeff = parseBigInt(C, 16);
+      } else {
+        console.error("Invalid RSA private key");
+      }
+    };
+    RSAKey2.prototype.generate = function(B, E) {
+      var rng = new SecureRandom();
+      var qs = B >> 1;
+      this.e = parseInt(E, 16);
+      var ee = new BigInteger(E, 16);
+      for (; ; ) {
+        for (; ; ) {
+          this.p = new BigInteger(B - qs, 1, rng);
+          if (this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) {
+            break;
+          }
+        }
+        for (; ; ) {
+          this.q = new BigInteger(qs, 1, rng);
+          if (this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) {
+            break;
+          }
+        }
+        if (this.p.compareTo(this.q) <= 0) {
+          var t = this.p;
+          this.p = this.q;
+          this.q = t;
+        }
+        var p1 = this.p.subtract(BigInteger.ONE);
+        var q1 = this.q.subtract(BigInteger.ONE);
+        var phi = p1.multiply(q1);
+        if (phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {
+          this.n = this.p.multiply(this.q);
+          this.d = ee.modInverse(phi);
+          this.dmp1 = this.d.mod(p1);
+          this.dmq1 = this.d.mod(q1);
+          this.coeff = this.q.modInverse(this.p);
+          break;
+        }
+      }
+    };
+    RSAKey2.prototype.decrypt = function(ctext) {
+      var c = parseBigInt(ctext, 16);
+      var m = this.doPrivate(c);
+      if (m == null) {
+        return null;
+      }
+      return pkcs1unpad2(m, this.n.bitLength() + 7 >> 3);
+    };
+    RSAKey2.prototype.generateAsync = function(B, E, callback) {
+      var rng = new SecureRandom();
+      var qs = B >> 1;
+      this.e = parseInt(E, 16);
+      var ee = new BigInteger(E, 16);
+      var rsa = this;
+      var loop1 = function() {
+        var loop4 = function() {
+          if (rsa.p.compareTo(rsa.q) <= 0) {
+            var t = rsa.p;
+            rsa.p = rsa.q;
+            rsa.q = t;
+          }
+          var p1 = rsa.p.subtract(BigInteger.ONE);
+          var q1 = rsa.q.subtract(BigInteger.ONE);
+          var phi = p1.multiply(q1);
+          if (phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {
+            rsa.n = rsa.p.multiply(rsa.q);
+            rsa.d = ee.modInverse(phi);
+            rsa.dmp1 = rsa.d.mod(p1);
+            rsa.dmq1 = rsa.d.mod(q1);
+            rsa.coeff = rsa.q.modInverse(rsa.p);
+            setTimeout(function() {
+              callback();
+            }, 0);
+          } else {
+            setTimeout(loop1, 0);
+          }
+        };
+        var loop3 = function() {
+          rsa.q = nbi();
+          rsa.q.fromNumberAsync(qs, 1, rng, function() {
+            rsa.q.subtract(BigInteger.ONE).gcda(ee, function(r) {
+              if (r.compareTo(BigInteger.ONE) == 0 && rsa.q.isProbablePrime(10)) {
+                setTimeout(loop4, 0);
+              } else {
+                setTimeout(loop3, 0);
+              }
+            });
+          });
+        };
+        var loop2 = function() {
+          rsa.p = nbi();
+          rsa.p.fromNumberAsync(B - qs, 1, rng, function() {
+            rsa.p.subtract(BigInteger.ONE).gcda(ee, function(r) {
+              if (r.compareTo(BigInteger.ONE) == 0 && rsa.p.isProbablePrime(10)) {
+                setTimeout(loop3, 0);
+              } else {
+                setTimeout(loop2, 0);
+              }
+            });
+          });
+        };
+        setTimeout(loop2, 0);
+      };
+      setTimeout(loop1, 0);
+    };
+    RSAKey2.prototype.sign = function(text, digestMethod, digestName) {
+      var header = getDigestHeader(digestName);
+      var digest = header + digestMethod(text).toString();
+      var maxLength = this.n.bitLength() / 4;
+      var m = pkcs1pad1(digest, maxLength);
+      if (m == null) {
+        return null;
+      }
+      var c = this.doPrivate(m);
+      if (c == null) {
+        return null;
+      }
+      var h = c.toString(16);
+      var length = h.length;
+      for (var i = 0; i < maxLength - length; i++) {
+        h = "0" + h;
+      }
+      return h;
+    };
+    RSAKey2.prototype.verify = function(text, signature, digestMethod) {
+      var c = parseBigInt(signature, 16);
+      var m = this.doPublic(c);
+      if (m == null) {
+        return null;
+      }
+      var unpadded = m.toString(16).replace(/^1f+00/, "");
+      var digest = removeDigestHeader(unpadded);
+      return digest == digestMethod(text).toString();
+    };
+    return RSAKey2;
+  })()
+);
+function pkcs1unpad2(d, n) {
+  var b = d.toByteArray();
+  var i = 0;
+  while (i < b.length && b[i] == 0) {
+    ++i;
+  }
+  if (b.length - i != n - 1 || b[i] != 2) {
+    return null;
+  }
+  ++i;
+  while (b[i] != 0) {
+    if (++i >= b.length) {
+      return null;
+    }
+  }
+  var ret = "";
+  while (++i < b.length) {
+    var c = b[i] & 255;
+    if (c < 128) {
+      ret += String.fromCharCode(c);
+    } else if (c > 191 && c < 224) {
+      ret += String.fromCharCode((c & 31) << 6 | b[i + 1] & 63);
+      ++i;
+    } else {
+      ret += String.fromCharCode((c & 15) << 12 | (b[i + 1] & 63) << 6 | b[i + 2] & 63);
+      i += 2;
+    }
+  }
+  return ret;
+}
+var DIGEST_HEADERS = {
+  md2: "3020300c06082a864886f70d020205000410",
+  md5: "3020300c06082a864886f70d020505000410",
+  sha1: "3021300906052b0e03021a05000414",
+  sha224: "302d300d06096086480165030402040500041c",
+  sha256: "3031300d060960864801650304020105000420",
+  sha384: "3041300d060960864801650304020205000430",
+  sha512: "3051300d060960864801650304020305000440",
+  ripemd160: "3021300906052b2403020105000414"
+};
+function getDigestHeader(name) {
+  return DIGEST_HEADERS[name] || "";
+}
+function removeDigestHeader(str) {
+  for (var name_1 in DIGEST_HEADERS) {
+    if (DIGEST_HEADERS.hasOwnProperty(name_1)) {
+      var header = DIGEST_HEADERS[name_1];
+      var len = header.length;
+      if (str.substring(0, len) == header) {
+        return str.substring(len);
+      }
+    }
+  }
+  return str;
+}
+export {
+  RSAKey,
+  oaep_pad
+};
+//# sourceMappingURL=rsa.mjs.map

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/rsa.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"rsa.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/rsa.js"],"sourcesContent":["// Depends on jsbn.js and rng.js\n// Version 1.1: support utf-8 encoding in pkcs1pad2\n// convert a (hex) string to a bignum object\nimport { BigInteger, nbi, parseBigInt } from \"./jsbn\";\nimport { SecureRandom } from \"./rng\";\nimport { rstr_sha256 } from './sha256';\n// function linebrk(s,n) {\n//   var ret = \"\";\n//   var i = 0;\n//   while(i + n < s.length) {\n//     ret += s.substring(i,i+n) + \"\\n\";\n//     i += n;\n//   }\n//   return ret + s.substring(i,s.length);\n// }\n// function byte2Hex(b) {\n//   if(b < 0x10)\n//     return \"0\" + b.toString(16);\n//   else\n//     return b.toString(16);\n// }\nfunction pkcs1pad1(s, n) {\n    if (n < s.length + 22) {\n        console.error(\"Message too long for RSA\");\n        return null;\n    }\n    var len = n - s.length - 6;\n    var filler = \"\";\n    for (var f = 0; f < len; f += 2) {\n        filler += \"ff\";\n    }\n    var m = \"0001\" + filler + \"00\" + s;\n    return parseBigInt(m, 16);\n}\n// PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint\nfunction pkcs1pad2(s, n) {\n    if (n < s.length + 11) { // TODO: fix for utf-8\n        console.error(\"Message too long for RSA\");\n        return null;\n    }\n    var ba = [];\n    var i = s.length - 1;\n    while (i >= 0 && n > 0) {\n        var c = s.charCodeAt(i--);\n        if (c < 128) { // encode using utf-8\n            ba[--n] = c;\n        }\n        else if ((c > 127) && (c < 2048)) {\n            ba[--n] = (c & 63) | 128;\n            ba[--n] = (c >> 6) | 192;\n        }\n        else {\n            ba[--n] = (c & 63) | 128;\n            ba[--n] = ((c >> 6) & 63) | 128;\n            ba[--n] = (c >> 12) | 224;\n        }\n    }\n    ba[--n] = 0;\n    var rng = new SecureRandom();\n    var x = [];\n    while (n > 2) { // random non-zero pad\n        x[0] = 0;\n        while (x[0] == 0) {\n            rng.nextBytes(x);\n        }\n        ba[--n] = x[0];\n    }\n    ba[--n] = 2;\n    ba[--n] = 0;\n    return new BigInteger(ba);\n}\n// PKCS#1 (OAEP) mask generation function, using SHA-256\nfunction oaep_mgf1_arr(seed, len, hashFunc) {\n    var mask = \"\", i = 0;\n    while (mask.length < len) {\n        mask += hashFunc(String.fromCharCode.apply(String, seed.concat([\n            (i & 0xff000000) >> 24,\n            (i & 0x00ff0000) >> 16,\n            (i & 0x0000ff00) >> 8,\n            i & 0x000000ff,\n        ])));\n        i += 1;\n    }\n    return mask;\n}\nvar SHA256_SIZE = 32;\n// PKCS#1 (OAEP) pad input string s to n bytes, and return a BigInteger\nexport function oaep_pad(s, n) {\n    var hashLen = SHA256_SIZE;\n    var hashFunc = rstr_sha256;\n    if (s.length + 2 * hashLen + 2 > n) {\n        throw \"Message too long for RSA\";\n    }\n    var PS = \"\", i;\n    for (i = 0; i < n - s.length - 2 * hashLen - 2; i += 1) {\n        PS += \"\\x00\";\n    }\n    var DB = hashFunc(\"\") + PS + \"\\x01\" + s, seed = new Array(hashLen);\n    new SecureRandom().nextBytes(seed);\n    var dbMask = oaep_mgf1_arr(seed, DB.length, hashFunc), maskedDB = [];\n    for (i = 0; i < DB.length; i += 1) {\n        maskedDB[i] = DB.charCodeAt(i) ^ dbMask.charCodeAt(i);\n    }\n    var seedMask = oaep_mgf1_arr(maskedDB, seed.length, hashFunc), maskedSeed = [0];\n    for (i = 0; i < seed.length; i += 1) {\n        maskedSeed[i + 1] = seed[i] ^ seedMask.charCodeAt(i);\n    }\n    return new BigInteger(maskedSeed.concat(maskedDB));\n}\n// \"empty\" RSA key constructor\nvar RSAKey = /** @class */ (function () {\n    function RSAKey() {\n        this.n = null;\n        this.e = 0;\n        this.d = null;\n        this.p = null;\n        this.q = null;\n        this.dmp1 = null;\n        this.dmq1 = null;\n        this.coeff = null;\n    }\n    //#region PROTECTED\n    // protected\n    // RSAKey.prototype.doPublic = RSADoPublic;\n    // Perform raw public operation on \"x\": return x^e (mod n)\n    RSAKey.prototype.doPublic = function (x) {\n        return x.modPowInt(this.e, this.n);\n    };\n    // RSAKey.prototype.doPrivate = RSADoPrivate;\n    // Perform raw private operation on \"x\": return x^d (mod n)\n    RSAKey.prototype.doPrivate = function (x) {\n        if (this.p == null || this.q == null) {\n            return x.modPow(this.d, this.n);\n        }\n        // TODO: re-calculate any missing CRT params\n        var xp = x.mod(this.p).modPow(this.dmp1, this.p);\n        var xq = x.mod(this.q).modPow(this.dmq1, this.q);\n        while (xp.compareTo(xq) < 0) {\n            xp = xp.add(this.p);\n        }\n        return xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq);\n    };\n    //#endregion PROTECTED\n    //#region PUBLIC\n    // RSAKey.prototype.setPublic = RSASetPublic;\n    // Set the public key fields N and e from hex strings\n    RSAKey.prototype.setPublic = function (N, E) {\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\n            this.n = parseBigInt(N, 16);\n            this.e = parseInt(E, 16);\n        }\n        else {\n            console.error(\"Invalid RSA public key\");\n        }\n    };\n    // RSAKey.prototype.encrypt = RSAEncrypt;\n    // Return the PKCS#1 RSA encryption of \"text\" as an even-length hex string\n    RSAKey.prototype.encrypt = function (text, paddingFunction) {\n        if (typeof paddingFunction === 'undefined') {\n            paddingFunction = pkcs1pad2;\n        }\n        var maxLength = (this.n.bitLength() + 7) >> 3;\n        var m = paddingFunction(text, maxLength);\n        if (m == null) {\n            return null;\n        }\n        var c = this.doPublic(m);\n        if (c == null) {\n            return null;\n        }\n        var h = c.toString(16);\n        var length = h.length;\n        // fix zero before result\n        for (var i = 0; i < maxLength * 2 - length; i++) {\n            h = \"0\" + h;\n        }\n        return h;\n    };\n    // RSAKey.prototype.setPrivate = RSASetPrivate;\n    // Set the private key fields N, e, and d from hex strings\n    RSAKey.prototype.setPrivate = function (N, E, D) {\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\n            this.n = parseBigInt(N, 16);\n            this.e = parseInt(E, 16);\n            this.d = parseBigInt(D, 16);\n        }\n        else {\n            console.error(\"Invalid RSA private key\");\n        }\n    };\n    // RSAKey.prototype.setPrivateEx = RSASetPrivateEx;\n    // Set the private key fields N, e, d and CRT params from hex strings\n    RSAKey.prototype.setPrivateEx = function (N, E, D, P, Q, DP, DQ, C) {\n        if (N != null && E != null && N.length > 0 && E.length > 0) {\n            this.n = parseBigInt(N, 16);\n            this.e = parseInt(E, 16);\n            this.d = parseBigInt(D, 16);\n            this.p = parseBigInt(P, 16);\n            this.q = parseBigInt(Q, 16);\n            this.dmp1 = parseBigInt(DP, 16);\n            this.dmq1 = parseBigInt(DQ, 16);\n            this.coeff = parseBigInt(C, 16);\n        }\n        else {\n            console.error(\"Invalid RSA private key\");\n        }\n    };\n    // RSAKey.prototype.generate = RSAGenerate;\n    // Generate a new random private key B bits long, using public expt E\n    RSAKey.prototype.generate = function (B, E) {\n        var rng = new SecureRandom();\n        var qs = B >> 1;\n        this.e = parseInt(E, 16);\n        var ee = new BigInteger(E, 16);\n        for (;;) {\n            for (;;) {\n                this.p = new BigInteger(B - qs, 1, rng);\n                if (this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) {\n                    break;\n                }\n            }\n            for (;;) {\n                this.q = new BigInteger(qs, 1, rng);\n                if (this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) {\n                    break;\n                }\n            }\n            if (this.p.compareTo(this.q) <= 0) {\n                var t = this.p;\n                this.p = this.q;\n                this.q = t;\n            }\n            var p1 = this.p.subtract(BigInteger.ONE);\n            var q1 = this.q.subtract(BigInteger.ONE);\n            var phi = p1.multiply(q1);\n            if (phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {\n                this.n = this.p.multiply(this.q);\n                this.d = ee.modInverse(phi);\n                this.dmp1 = this.d.mod(p1);\n                this.dmq1 = this.d.mod(q1);\n                this.coeff = this.q.modInverse(this.p);\n                break;\n            }\n        }\n    };\n    // RSAKey.prototype.decrypt = RSADecrypt;\n    // Return the PKCS#1 RSA decryption of \"ctext\".\n    // \"ctext\" is an even-length hex string and the output is a plain string.\n    RSAKey.prototype.decrypt = function (ctext) {\n        var c = parseBigInt(ctext, 16);\n        var m = this.doPrivate(c);\n        if (m == null) {\n            return null;\n        }\n        return pkcs1unpad2(m, (this.n.bitLength() + 7) >> 3);\n    };\n    // Generate a new random private key B bits long, using public expt E\n    RSAKey.prototype.generateAsync = function (B, E, callback) {\n        var rng = new SecureRandom();\n        var qs = B >> 1;\n        this.e = parseInt(E, 16);\n        var ee = new BigInteger(E, 16);\n        var rsa = this;\n        // These functions have non-descript names because they were originally for(;;) loops.\n        // I don't know about cryptography to give them better names than loop1-4.\n        var loop1 = function () {\n            var loop4 = function () {\n                if (rsa.p.compareTo(rsa.q) <= 0) {\n                    var t = rsa.p;\n                    rsa.p = rsa.q;\n                    rsa.q = t;\n                }\n                var p1 = rsa.p.subtract(BigInteger.ONE);\n                var q1 = rsa.q.subtract(BigInteger.ONE);\n                var phi = p1.multiply(q1);\n                if (phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {\n                    rsa.n = rsa.p.multiply(rsa.q);\n                    rsa.d = ee.modInverse(phi);\n                    rsa.dmp1 = rsa.d.mod(p1);\n                    rsa.dmq1 = rsa.d.mod(q1);\n                    rsa.coeff = rsa.q.modInverse(rsa.p);\n                    setTimeout(function () { callback(); }, 0); // escape\n                }\n                else {\n                    setTimeout(loop1, 0);\n                }\n            };\n            var loop3 = function () {\n                rsa.q = nbi();\n                rsa.q.fromNumberAsync(qs, 1, rng, function () {\n                    rsa.q.subtract(BigInteger.ONE).gcda(ee, function (r) {\n                        if (r.compareTo(BigInteger.ONE) == 0 && rsa.q.isProbablePrime(10)) {\n                            setTimeout(loop4, 0);\n                        }\n                        else {\n                            setTimeout(loop3, 0);\n                        }\n                    });\n                });\n            };\n            var loop2 = function () {\n                rsa.p = nbi();\n                rsa.p.fromNumberAsync(B - qs, 1, rng, function () {\n                    rsa.p.subtract(BigInteger.ONE).gcda(ee, function (r) {\n                        if (r.compareTo(BigInteger.ONE) == 0 && rsa.p.isProbablePrime(10)) {\n                            setTimeout(loop3, 0);\n                        }\n                        else {\n                            setTimeout(loop2, 0);\n                        }\n                    });\n                });\n            };\n            setTimeout(loop2, 0);\n        };\n        setTimeout(loop1, 0);\n    };\n    RSAKey.prototype.sign = function (text, digestMethod, digestName) {\n        var header = getDigestHeader(digestName);\n        var digest = header + digestMethod(text).toString();\n        var maxLength = this.n.bitLength() / 4;\n        var m = pkcs1pad1(digest, maxLength);\n        if (m == null) {\n            return null;\n        }\n        var c = this.doPrivate(m);\n        if (c == null) {\n            return null;\n        }\n        var h = c.toString(16);\n        var length = h.length;\n        // fix zero before result\n        for (var i = 0; i < maxLength - length; i++) {\n            h = \"0\" + h;\n        }\n        return h;\n    };\n    RSAKey.prototype.verify = function (text, signature, digestMethod) {\n        var c = parseBigInt(signature, 16);\n        var m = this.doPublic(c);\n        if (m == null) {\n            return null;\n        }\n        var unpadded = m.toString(16).replace(/^1f+00/, \"\");\n        var digest = removeDigestHeader(unpadded);\n        return digest == digestMethod(text).toString();\n    };\n    return RSAKey;\n}());\nexport { RSAKey };\n// Undo PKCS#1 (type 2, random) padding and, if valid, return the plaintext\nfunction pkcs1unpad2(d, n) {\n    var b = d.toByteArray();\n    var i = 0;\n    while (i < b.length && b[i] == 0) {\n        ++i;\n    }\n    if (b.length - i != n - 1 || b[i] != 2) {\n        return null;\n    }\n    ++i;\n    while (b[i] != 0) {\n        if (++i >= b.length) {\n            return null;\n        }\n    }\n    var ret = \"\";\n    while (++i < b.length) {\n        var c = b[i] & 255;\n        if (c < 128) { // utf-8 decode\n            ret += String.fromCharCode(c);\n        }\n        else if ((c > 191) && (c < 224)) {\n            ret += String.fromCharCode(((c & 31) << 6) | (b[i + 1] & 63));\n            ++i;\n        }\n        else {\n            ret += String.fromCharCode(((c & 15) << 12) | ((b[i + 1] & 63) << 6) | (b[i + 2] & 63));\n            i += 2;\n        }\n    }\n    return ret;\n}\n// https://tools.ietf.org/html/rfc3447#page-43\nvar DIGEST_HEADERS = {\n    md2: \"3020300c06082a864886f70d020205000410\",\n    md5: \"3020300c06082a864886f70d020505000410\",\n    sha1: \"3021300906052b0e03021a05000414\",\n    sha224: \"302d300d06096086480165030402040500041c\",\n    sha256: \"3031300d060960864801650304020105000420\",\n    sha384: \"3041300d060960864801650304020205000430\",\n    sha512: \"3051300d060960864801650304020305000440\",\n    ripemd160: \"3021300906052b2403020105000414\"\n};\nfunction getDigestHeader(name) {\n    return DIGEST_HEADERS[name] || \"\";\n}\nfunction removeDigestHeader(str) {\n    for (var name_1 in DIGEST_HEADERS) {\n        if (DIGEST_HEADERS.hasOwnProperty(name_1)) {\n            var header = DIGEST_HEADERS[name_1];\n            var len = header.length;\n            if (str.substring(0, len) == header) {\n                return str.substring(len);\n            }\n        }\n    }\n    return str;\n}\n// Return the PKCS#1 RSA encryption of \"text\" as a Base64-encoded string\n// function RSAEncryptB64(text) {\n//  var h = this.encrypt(text);\n//  if(h) return hex2b64(h); else return null;\n// }\n// public\n// RSAKey.prototype.encrypt_b64 = RSAEncryptB64;\n"],"names":["RSAKey"],"mappings":";;;AAqBA,SAAS,UAAU,GAAG,GAAG;AACrB,MAAI,IAAI,EAAE,SAAS,IAAI;AACnB,YAAQ,MAAM,0BAA0B;AACxC,WAAO;AAAA,EACX;AACA,MAAI,MAAM,IAAI,EAAE,SAAS;AACzB,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC7B,cAAU;AAAA,EACd;AACA,MAAI,IAAI,SAAS,SAAS,OAAO;AACjC,SAAO,YAAY,GAAG,EAAE;AAC5B;AAEA,SAAS,UAAU,GAAG,GAAG;AACrB,MAAI,IAAI,EAAE,SAAS,IAAI;AACnB,YAAQ,MAAM,0BAA0B;AACxC,WAAO;AAAA,EACX;AACA,MAAI,KAAK,CAAA;AACT,MAAI,IAAI,EAAE,SAAS;AACnB,SAAO,KAAK,KAAK,IAAI,GAAG;AACpB,QAAI,IAAI,EAAE,WAAW,GAAG;AACxB,QAAI,IAAI,KAAK;AACT,SAAG,EAAE,CAAC,IAAI;AAAA,IACd,WACU,IAAI,OAAS,IAAI,MAAO;AAC9B,SAAG,EAAE,CAAC,IAAK,IAAI,KAAM;AACrB,SAAG,EAAE,CAAC,IAAK,KAAK,IAAK;AAAA,IACzB,OACK;AACD,SAAG,EAAE,CAAC,IAAK,IAAI,KAAM;AACrB,SAAG,EAAE,CAAC,IAAM,KAAK,IAAK,KAAM;AAC5B,SAAG,EAAE,CAAC,IAAK,KAAK,KAAM;AAAA,IAC1B;AAAA,EACJ;AACA,KAAG,EAAE,CAAC,IAAI;AACV,MAAI,MAAM,IAAI,aAAY;AAC1B,MAAI,IAAI,CAAA;AACR,SAAO,IAAI,GAAG;AACV,MAAE,CAAC,IAAI;AACP,WAAO,EAAE,CAAC,KAAK,GAAG;AACd,UAAI,UAAU,CAAC;AAAA,IACnB;AACA,OAAG,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EACjB;AACA,KAAG,EAAE,CAAC,IAAI;AACV,KAAG,EAAE,CAAC,IAAI;AACV,SAAO,IAAI,WAAW,EAAE;AAC5B;AAEA,SAAS,cAAc,MAAM,KAAK,UAAU;AACxC,MAAI,OAAO,IAAI,IAAI;AACnB,SAAO,KAAK,SAAS,KAAK;AACtB,YAAQ,SAAS,OAAO,aAAa,MAAM,QAAQ,KAAK,OAAO;AAAA,OAC1D,IAAI,eAAe;AAAA,OACnB,IAAI,aAAe;AAAA,OACnB,IAAI,UAAe;AAAA,MACpB,IAAI;AAAA,IAChB,CAAS,CAAC,CAAC;AACH,SAAK;AAAA,EACT;AACA,SAAO;AACX;AACA,IAAI,cAAc;AAEX,SAAS,SAAS,GAAG,GAAG;AAC3B,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,EAAE,SAAS,IAAI,UAAU,IAAI,GAAG;AAChC,UAAM;AAAA,EACV;AACA,MAAI,KAAK,IAAI;AACb,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,SAAS,IAAI,UAAU,GAAG,KAAK,GAAG;AACpD,UAAM;AAAA,EACV;AACA,MAAI,KAAK,SAAS,EAAE,IAAI,KAAK,MAAS,GAAG,OAAO,IAAI,MAAM,OAAO;AACjE,MAAI,aAAY,EAAG,UAAU,IAAI;AACjC,MAAI,SAAS,cAAc,MAAM,GAAG,QAAQ,QAAQ,GAAG,WAAW,CAAA;AAClE,OAAK,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,GAAG;AAC/B,aAAS,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,OAAO,WAAW,CAAC;AAAA,EACxD;AACA,MAAI,WAAW,cAAc,UAAU,KAAK,QAAQ,QAAQ,GAAG,aAAa,CAAC,CAAC;AAC9E,OAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACjC,eAAW,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,SAAS,WAAW,CAAC;AAAA,EACvD;AACA,SAAO,IAAI,WAAW,WAAW,OAAO,QAAQ,CAAC;AACrD;AAEG,IAAC;AAAA;AAAA,GAAwB,WAAY;AACpC,aAASA,UAAS;AACd,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,QAAQ;AAAA,IACjB;AAKA,IAAAA,QAAO,UAAU,WAAW,SAAU,GAAG;AACrC,aAAO,EAAE,UAAU,KAAK,GAAG,KAAK,CAAC;AAAA,IACrC;AAGA,IAAAA,QAAO,UAAU,YAAY,SAAU,GAAG;AACtC,UAAI,KAAK,KAAK,QAAQ,KAAK,KAAK,MAAM;AAClC,eAAO,EAAE,OAAO,KAAK,GAAG,KAAK,CAAC;AAAA,MAClC;AAEA,UAAI,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,OAAO,KAAK,MAAM,KAAK,CAAC;AAC/C,UAAI,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,OAAO,KAAK,MAAM,KAAK,CAAC;AAC/C,aAAO,GAAG,UAAU,EAAE,IAAI,GAAG;AACzB,aAAK,GAAG,IAAI,KAAK,CAAC;AAAA,MACtB;AACA,aAAO,GAAG,SAAS,EAAE,EAAE,SAAS,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,IAAI,EAAE;AAAA,IACnF;AAKA,IAAAA,QAAO,UAAU,YAAY,SAAU,GAAG,GAAG;AACzC,UAAI,KAAK,QAAQ,KAAK,QAAQ,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG;AACxD,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,SAAS,GAAG,EAAE;AAAA,MAC3B,OACK;AACD,gBAAQ,MAAM,wBAAwB;AAAA,MAC1C;AAAA,IACJ;AAGA,IAAAA,QAAO,UAAU,UAAU,SAAU,MAAM,iBAAiB;AACxD,UAAI,OAAO,oBAAoB,aAAa;AACxC,0BAAkB;AAAA,MACtB;AACA,UAAI,YAAa,KAAK,EAAE,UAAS,IAAK,KAAM;AAC5C,UAAI,IAAI,gBAAgB,MAAM,SAAS;AACvC,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,IAAI,KAAK,SAAS,CAAC;AACvB,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,IAAI,EAAE,SAAS,EAAE;AACrB,UAAI,SAAS,EAAE;AAEf,eAAS,IAAI,GAAG,IAAI,YAAY,IAAI,QAAQ,KAAK;AAC7C,YAAI,MAAM;AAAA,MACd;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,QAAO,UAAU,aAAa,SAAU,GAAG,GAAG,GAAG;AAC7C,UAAI,KAAK,QAAQ,KAAK,QAAQ,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG;AACxD,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,SAAS,GAAG,EAAE;AACvB,aAAK,IAAI,YAAY,GAAG,EAAE;AAAA,MAC9B,OACK;AACD,gBAAQ,MAAM,yBAAyB;AAAA,MAC3C;AAAA,IACJ;AAGA,IAAAA,QAAO,UAAU,eAAe,SAAU,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG;AAChE,UAAI,KAAK,QAAQ,KAAK,QAAQ,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG;AACxD,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,SAAS,GAAG,EAAE;AACvB,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,OAAO,YAAY,IAAI,EAAE;AAC9B,aAAK,OAAO,YAAY,IAAI,EAAE;AAC9B,aAAK,QAAQ,YAAY,GAAG,EAAE;AAAA,MAClC,OACK;AACD,gBAAQ,MAAM,yBAAyB;AAAA,MAC3C;AAAA,IACJ;AAGA,IAAAA,QAAO,UAAU,WAAW,SAAU,GAAG,GAAG;AACxC,UAAI,MAAM,IAAI,aAAY;AAC1B,UAAI,KAAK,KAAK;AACd,WAAK,IAAI,SAAS,GAAG,EAAE;AACvB,UAAI,KAAK,IAAI,WAAW,GAAG,EAAE;AAC7B,iBAAS;AACL,mBAAS;AACL,eAAK,IAAI,IAAI,WAAW,IAAI,IAAI,GAAG,GAAG;AACtC,cAAI,KAAK,EAAE,SAAS,WAAW,GAAG,EAAE,IAAI,EAAE,EAAE,UAAU,WAAW,GAAG,KAAK,KAAK,KAAK,EAAE,gBAAgB,EAAE,GAAG;AACtG;AAAA,UACJ;AAAA,QACJ;AACA,mBAAS;AACL,eAAK,IAAI,IAAI,WAAW,IAAI,GAAG,GAAG;AAClC,cAAI,KAAK,EAAE,SAAS,WAAW,GAAG,EAAE,IAAI,EAAE,EAAE,UAAU,WAAW,GAAG,KAAK,KAAK,KAAK,EAAE,gBAAgB,EAAE,GAAG;AACtG;AAAA,UACJ;AAAA,QACJ;AACA,YAAI,KAAK,EAAE,UAAU,KAAK,CAAC,KAAK,GAAG;AAC/B,cAAI,IAAI,KAAK;AACb,eAAK,IAAI,KAAK;AACd,eAAK,IAAI;AAAA,QACb;AACA,YAAI,KAAK,KAAK,EAAE,SAAS,WAAW,GAAG;AACvC,YAAI,KAAK,KAAK,EAAE,SAAS,WAAW,GAAG;AACvC,YAAI,MAAM,GAAG,SAAS,EAAE;AACxB,YAAI,IAAI,IAAI,EAAE,EAAE,UAAU,WAAW,GAAG,KAAK,GAAG;AAC5C,eAAK,IAAI,KAAK,EAAE,SAAS,KAAK,CAAC;AAC/B,eAAK,IAAI,GAAG,WAAW,GAAG;AAC1B,eAAK,OAAO,KAAK,EAAE,IAAI,EAAE;AACzB,eAAK,OAAO,KAAK,EAAE,IAAI,EAAE;AACzB,eAAK,QAAQ,KAAK,EAAE,WAAW,KAAK,CAAC;AACrC;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAIA,IAAAA,QAAO,UAAU,UAAU,SAAU,OAAO;AACxC,UAAI,IAAI,YAAY,OAAO,EAAE;AAC7B,UAAI,IAAI,KAAK,UAAU,CAAC;AACxB,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,aAAO,YAAY,GAAI,KAAK,EAAE,UAAS,IAAK,KAAM,CAAC;AAAA,IACvD;AAEA,IAAAA,QAAO,UAAU,gBAAgB,SAAU,GAAG,GAAG,UAAU;AACvD,UAAI,MAAM,IAAI,aAAY;AAC1B,UAAI,KAAK,KAAK;AACd,WAAK,IAAI,SAAS,GAAG,EAAE;AACvB,UAAI,KAAK,IAAI,WAAW,GAAG,EAAE;AAC7B,UAAI,MAAM;AAGV,UAAI,QAAQ,WAAY;AACpB,YAAI,QAAQ,WAAY;AACpB,cAAI,IAAI,EAAE,UAAU,IAAI,CAAC,KAAK,GAAG;AAC7B,gBAAI,IAAI,IAAI;AACZ,gBAAI,IAAI,IAAI;AACZ,gBAAI,IAAI;AAAA,UACZ;AACA,cAAI,KAAK,IAAI,EAAE,SAAS,WAAW,GAAG;AACtC,cAAI,KAAK,IAAI,EAAE,SAAS,WAAW,GAAG;AACtC,cAAI,MAAM,GAAG,SAAS,EAAE;AACxB,cAAI,IAAI,IAAI,EAAE,EAAE,UAAU,WAAW,GAAG,KAAK,GAAG;AAC5C,gBAAI,IAAI,IAAI,EAAE,SAAS,IAAI,CAAC;AAC5B,gBAAI,IAAI,GAAG,WAAW,GAAG;AACzB,gBAAI,OAAO,IAAI,EAAE,IAAI,EAAE;AACvB,gBAAI,OAAO,IAAI,EAAE,IAAI,EAAE;AACvB,gBAAI,QAAQ,IAAI,EAAE,WAAW,IAAI,CAAC;AAClC,uBAAW,WAAY;AAAE,uBAAQ;AAAA,YAAI,GAAG,CAAC;AAAA,UAC7C,OACK;AACD,uBAAW,OAAO,CAAC;AAAA,UACvB;AAAA,QACJ;AACA,YAAI,QAAQ,WAAY;AACpB,cAAI,IAAI,IAAG;AACX,cAAI,EAAE,gBAAgB,IAAI,GAAG,KAAK,WAAY;AAC1C,gBAAI,EAAE,SAAS,WAAW,GAAG,EAAE,KAAK,IAAI,SAAU,GAAG;AACjD,kBAAI,EAAE,UAAU,WAAW,GAAG,KAAK,KAAK,IAAI,EAAE,gBAAgB,EAAE,GAAG;AAC/D,2BAAW,OAAO,CAAC;AAAA,cACvB,OACK;AACD,2BAAW,OAAO,CAAC;AAAA,cACvB;AAAA,YACJ,CAAC;AAAA,UACL,CAAC;AAAA,QACL;AACA,YAAI,QAAQ,WAAY;AACpB,cAAI,IAAI,IAAG;AACX,cAAI,EAAE,gBAAgB,IAAI,IAAI,GAAG,KAAK,WAAY;AAC9C,gBAAI,EAAE,SAAS,WAAW,GAAG,EAAE,KAAK,IAAI,SAAU,GAAG;AACjD,kBAAI,EAAE,UAAU,WAAW,GAAG,KAAK,KAAK,IAAI,EAAE,gBAAgB,EAAE,GAAG;AAC/D,2BAAW,OAAO,CAAC;AAAA,cACvB,OACK;AACD,2BAAW,OAAO,CAAC;AAAA,cACvB;AAAA,YACJ,CAAC;AAAA,UACL,CAAC;AAAA,QACL;AACA,mBAAW,OAAO,CAAC;AAAA,MACvB;AACA,iBAAW,OAAO,CAAC;AAAA,IACvB;AACA,IAAAA,QAAO,UAAU,OAAO,SAAU,MAAM,cAAc,YAAY;AAC9D,UAAI,SAAS,gBAAgB,UAAU;AACvC,UAAI,SAAS,SAAS,aAAa,IAAI,EAAE,SAAQ;AACjD,UAAI,YAAY,KAAK,EAAE,UAAS,IAAK;AACrC,UAAI,IAAI,UAAU,QAAQ,SAAS;AACnC,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,IAAI,KAAK,UAAU,CAAC;AACxB,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,IAAI,EAAE,SAAS,EAAE;AACrB,UAAI,SAAS,EAAE;AAEf,eAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AACzC,YAAI,MAAM;AAAA,MACd;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,SAAS,SAAU,MAAM,WAAW,cAAc;AAC/D,UAAI,IAAI,YAAY,WAAW,EAAE;AACjC,UAAI,IAAI,KAAK,SAAS,CAAC;AACvB,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,WAAW,EAAE,SAAS,EAAE,EAAE,QAAQ,UAAU,EAAE;AAClD,UAAI,SAAS,mBAAmB,QAAQ;AACxC,aAAO,UAAU,aAAa,IAAI,EAAE,SAAQ;AAAA,IAChD;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;AAGD,SAAS,YAAY,GAAG,GAAG;AACvB,MAAI,IAAI,EAAE,YAAW;AACrB,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,UAAU,EAAE,CAAC,KAAK,GAAG;AAC9B,MAAE;AAAA,EACN;AACA,MAAI,EAAE,SAAS,KAAK,IAAI,KAAK,EAAE,CAAC,KAAK,GAAG;AACpC,WAAO;AAAA,EACX;AACA,IAAE;AACF,SAAO,EAAE,CAAC,KAAK,GAAG;AACd,QAAI,EAAE,KAAK,EAAE,QAAQ;AACjB,aAAO;AAAA,IACX;AAAA,EACJ;AACA,MAAI,MAAM;AACV,SAAO,EAAE,IAAI,EAAE,QAAQ;AACnB,QAAI,IAAI,EAAE,CAAC,IAAI;AACf,QAAI,IAAI,KAAK;AACT,aAAO,OAAO,aAAa,CAAC;AAAA,IAChC,WACU,IAAI,OAAS,IAAI,KAAM;AAC7B,aAAO,OAAO,cAAe,IAAI,OAAO,IAAM,EAAE,IAAI,CAAC,IAAI,EAAG;AAC5D,QAAE;AAAA,IACN,OACK;AACD,aAAO,OAAO,cAAe,IAAI,OAAO,MAAQ,EAAE,IAAI,CAAC,IAAI,OAAO,IAAM,EAAE,IAAI,CAAC,IAAI,EAAG;AACtF,WAAK;AAAA,IACT;AAAA,EACJ;AACA,SAAO;AACX;AAEA,IAAI,iBAAiB;AAAA,EACjB,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,WAAW;AACf;AACA,SAAS,gBAAgB,MAAM;AAC3B,SAAO,eAAe,IAAI,KAAK;AACnC;AACA,SAAS,mBAAmB,KAAK;AAC7B,WAAS,UAAU,gBAAgB;AAC/B,QAAI,eAAe,eAAe,MAAM,GAAG;AACvC,UAAI,SAAS,eAAe,MAAM;AAClC,UAAI,MAAM,OAAO;AACjB,UAAI,IAAI,UAAU,GAAG,GAAG,KAAK,QAAQ;AACjC,eAAO,IAAI,UAAU,GAAG;AAAA,MAC5B;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/sha256.mjs

@@ -0,0 +1,104 @@
+function rstr_sha256(s) {
+  return binb2rstr(binb_sha256(rstr2binb(s), s.length * 8));
+}
+function rstr2hex(input) {
+  var hex_tab = "0123456789abcdef";
+  var output = "";
+  for (var i = 0; i < input.length; i++) {
+    var x = input.charCodeAt(i);
+    output += hex_tab.charAt(x >>> 4 & 15) + hex_tab.charAt(x & 15);
+  }
+  return output;
+}
+function rstr2binb(input) {
+  var output = Array(input.length >> 2);
+  for (var i = 0; i < output.length; i++)
+    output[i] = 0;
+  for (var i = 0; i < input.length * 8; i += 8)
+    output[i >> 5] |= (input.charCodeAt(i / 8) & 255) << 24 - i % 32;
+  return output;
+}
+function binb2rstr(input) {
+  var output = "";
+  for (var i = 0; i < input.length * 32; i += 8)
+    output += String.fromCharCode(input[i >> 5] >>> 24 - i % 32 & 255);
+  return output;
+}
+function sha256_S(X, n) {
+  return X >>> n | X << 32 - n;
+}
+function sha256_R(X, n) {
+  return X >>> n;
+}
+function sha256_Ch(x, y, z) {
+  return x & y ^ ~x & z;
+}
+function sha256_Maj(x, y, z) {
+  return x & y ^ x & z ^ y & z;
+}
+function sha256_Sigma0256(x) {
+  return sha256_S(x, 2) ^ sha256_S(x, 13) ^ sha256_S(x, 22);
+}
+function sha256_Sigma1256(x) {
+  return sha256_S(x, 6) ^ sha256_S(x, 11) ^ sha256_S(x, 25);
+}
+function sha256_Gamma0256(x) {
+  return sha256_S(x, 7) ^ sha256_S(x, 18) ^ sha256_R(x, 3);
+}
+function sha256_Gamma1256(x) {
+  return sha256_S(x, 17) ^ sha256_S(x, 19) ^ sha256_R(x, 10);
+}
+var sha256_K = new Array(1116352408, 1899447441, -1245643825, -373957723, 961987163, 1508970993, -1841331548, -1424204075, -670586216, 310598401, 607225278, 1426881987, 1925078388, -2132889090, -1680079193, -1046744716, -459576895, -272742522, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, -1740746414, -1473132947, -1341970488, -1084653625, -958395405, -710438585, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, -2117940946, -1838011259, -1564481375, -1474664885, -1035236496, -949202525, -778901479, -694614492, -200395387, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222, 2024104815, -2067236844, -1933114872, -1866530822, -1538233109, -1090935817, -965641998);
+function binb_sha256(m, l) {
+  var HASH = new Array(1779033703, -1150833019, 1013904242, -1521486534, 1359893119, -1694144372, 528734635, 1541459225);
+  var W = new Array(64);
+  var a, b, c, d, e, f, g, h;
+  var i, j, T1, T2;
+  m[l >> 5] |= 128 << 24 - l % 32;
+  m[(l + 64 >> 9 << 4) + 15] = l;
+  for (i = 0; i < m.length; i += 16) {
+    a = HASH[0];
+    b = HASH[1];
+    c = HASH[2];
+    d = HASH[3];
+    e = HASH[4];
+    f = HASH[5];
+    g = HASH[6];
+    h = HASH[7];
+    for (j = 0; j < 64; j++) {
+      if (j < 16)
+        W[j] = m[j + i];
+      else
+        W[j] = safe_add(safe_add(safe_add(sha256_Gamma1256(W[j - 2]), W[j - 7]), sha256_Gamma0256(W[j - 15])), W[j - 16]);
+      T1 = safe_add(safe_add(safe_add(safe_add(h, sha256_Sigma1256(e)), sha256_Ch(e, f, g)), sha256_K[j]), W[j]);
+      T2 = safe_add(sha256_Sigma0256(a), sha256_Maj(a, b, c));
+      h = g;
+      g = f;
+      f = e;
+      e = safe_add(d, T1);
+      d = c;
+      c = b;
+      b = a;
+      a = safe_add(T1, T2);
+    }
+    HASH[0] = safe_add(a, HASH[0]);
+    HASH[1] = safe_add(b, HASH[1]);
+    HASH[2] = safe_add(c, HASH[2]);
+    HASH[3] = safe_add(d, HASH[3]);
+    HASH[4] = safe_add(e, HASH[4]);
+    HASH[5] = safe_add(f, HASH[5]);
+    HASH[6] = safe_add(g, HASH[6]);
+    HASH[7] = safe_add(h, HASH[7]);
+  }
+  return HASH;
+}
+function safe_add(x, y) {
+  var lsw = (x & 65535) + (y & 65535);
+  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+  return msw << 16 | lsw & 65535;
+}
+export {
+  rstr2hex,
+  rstr_sha256
+};
+//# sourceMappingURL=sha256.mjs.map

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/sha256.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sha256.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/sha256.js"],"sourcesContent":["/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2 Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n * Also http://anmar.eu.org/projects/jssha2/\n */\n// /*\n//  * Configurable variables. You may need to tweak these to be compatible with\n//  * the server-side, but the defaults work in most cases.\n//  */\n// var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase        */\n// var b64pad = \"\"; /* base-64 pad character. \"=\" for strict RFC compliance   */\n// /*\n//  * These are the functions you'll usually want to call\n//  * They take string arguments and return either hex or base-64 encoded strings\n//  */\n// function hex_sha256(s: string) {\n//     return rstr2hex(rstr_sha256(str2rstr_utf8(s)));\n// }\n// function b64_sha256(s: string) {\n//     return rstr2b64(rstr_sha256(str2rstr_utf8(s)));\n// }\n// function any_sha256(s: string, e: any) {\n//     return rstr2any(rstr_sha256(str2rstr_utf8(s)), e);\n// }\n// function hex_hmac_sha256(k: string, d: any) {\n//     return rstr2hex(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)));\n// }\n// function b64_hmac_sha256(k: string, d: any) {\n//     return rstr2b64(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)));\n// }\n// function any_hmac_sha256(k: string, d: string, e: any) {\n//     return rstr2any(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)), e);\n// }\n// /*\n//  * Perform a simple self-test to see if the VM is working\n//  */\n// function sha256_vm_test() {\n//     return (\n//         hex_sha256(\"abc\").toLowerCase() ==\n//         \"ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad\"\n//     );\n// }\n/*\n * Calculate the sha256 of a raw string\n */\nexport function rstr_sha256(s) {\n    return binb2rstr(binb_sha256(rstr2binb(s), s.length * 8));\n}\n// /*\n//  * Calculate the HMAC-sha256 of a key and some data (raw strings)\n//  */\n// function rstr_hmac_sha256(key: string, data: any) {\n//     var bkey = rstr2binb(key);\n//     if (bkey.length > 16) bkey = binb_sha256(bkey, key.length * 8);\n//     var ipad = Array(16),\n//         opad = Array(16);\n//     for (var i = 0; i < 16; i++) {\n//         ipad[i] = bkey[i] ^ 0x36363636;\n//         opad[i] = bkey[i] ^ 0x5c5c5c5c;\n//     }\n//     var hash = binb_sha256(ipad.concat(rstr2binb(data)), 512 + data.length * 8);\n//     return binb2rstr(binb_sha256(opad.concat(hash), 512 + 256));\n// }\n// /*\n//  * Convert a raw string to a hex string\n//  */\nexport function rstr2hex(input) {\n    var hex_tab = \"0123456789abcdef\";\n    var output = \"\";\n    for (var i = 0; i < input.length; i++) {\n        var x = input.charCodeAt(i);\n        output += hex_tab.charAt((x >>> 4) & 0x0f) + hex_tab.charAt(x & 0x0f);\n    }\n    return output;\n}\n// /*\n//  * Convert a raw string to a base-64 string\n//  */\n// function rstr2b64(input: string) {\n//     try {\n//         b64pad;\n//     } catch (e) {\n//         b64pad = \"\";\n//     }\n//     var tab = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n//     var output = \"\";\n//     var len = input.length;\n//     for (var i = 0; i < len; i += 3) {\n//         var triplet =\n//             (input.charCodeAt(i) << 16) |\n//             (i + 1 < len ? input.charCodeAt(i + 1) << 8 : 0) |\n//             (i + 2 < len ? input.charCodeAt(i + 2) : 0);\n//         for (var j = 0; j < 4; j++) {\n//             if (i * 8 + j * 6 > input.length * 8) output += b64pad;\n//             else output += tab.charAt((triplet >>> (6 * (3 - j))) & 0x3f);\n//         }\n//     }\n//     return output;\n// }\n// /*\n//  * Convert a raw string to an arbitrary string encoding\n//  */\n// function rstr2any(input: string, encoding: string) {\n//     var divisor = encoding.length;\n//     var remainders = Array();\n//     var i, q, x, quotient;\n//     /* Convert to an array of 16-bit big-endian values, forming the dividend */\n//     var dividend = Array(Math.ceil(input.length / 2));\n//     for (i = 0; i < dividend.length; i++) {\n//         dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);\n//     }\n//     /*\n//      * Repeatedly perform a long division. The binary array forms the dividend,\n//      * the length of the encoding is the divisor. Once computed, the quotient\n//      * forms the dividend for the next step. We stop when the dividend is zero.\n//      * All remainders are stored for later use.\n//      */\n//     while (dividend.length > 0) {\n//         quotient = Array();\n//         x = 0;\n//         for (i = 0; i < dividend.length; i++) {\n//             x = (x << 16) + dividend[i];\n//             q = Math.floor(x / divisor);\n//             x -= q * divisor;\n//             if (quotient.length > 0 || q > 0) quotient[quotient.length] = q;\n//         }\n//         remainders[remainders.length] = x;\n//         dividend = quotient;\n//     }\n//     /* Convert the remainders to the output string */\n//     var output = \"\";\n//     for (i = remainders.length - 1; i >= 0; i--) output += encoding.charAt(remainders[i]);\n//     /* Append leading zero equivalents */\n//     var full_length = Math.ceil(\n//         (input.length * 8) / (Math.log(encoding.length) / Math.log(2)),\n//     );\n//     for (i = output.length; i < full_length; i++) output = encoding[0] + output;\n//     return output;\n// }\n// /*\n//  * Encode a string as utf-8.\n//  * For efficiency, this assumes the input is valid utf-16.\n//  */\n// function str2rstr_utf8(input: string) {\n//     var output = \"\";\n//     var i = -1;\n//     var x, y;\n//     while (++i < input.length) {\n//         /* Decode utf-16 surrogate pairs */\n//         x = input.charCodeAt(i);\n//         y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;\n//         if (0xd800 <= x && x <= 0xdbff && 0xdc00 <= y && y <= 0xdfff) {\n//             x = 0x10000 + ((x & 0x03ff) << 10) + (y & 0x03ff);\n//             i++;\n//         }\n//         /* Encode output as utf-8 */\n//         if (x <= 0x7f) output += String.fromCharCode(x);\n//         else if (x <= 0x7ff)\n//             output += String.fromCharCode(0xc0 | ((x >>> 6) & 0x1f), 0x80 | (x & 0x3f));\n//         else if (x <= 0xffff)\n//             output += String.fromCharCode(\n//                 0xe0 | ((x >>> 12) & 0x0f),\n//                 0x80 | ((x >>> 6) & 0x3f),\n//                 0x80 | (x & 0x3f),\n//             );\n//         else if (x <= 0x1fffff)\n//             output += String.fromCharCode(\n//                 0xf0 | ((x >>> 18) & 0x07),\n//                 0x80 | ((x >>> 12) & 0x3f),\n//                 0x80 | ((x >>> 6) & 0x3f),\n//                 0x80 | (x & 0x3f),\n//             );\n//     }\n//     return output;\n// }\n// /*\n//  * Encode a string as utf-16\n//  */\n// function str2rstr_utf16le(input: string) {\n//     var output = \"\";\n//     for (var i = 0; i < input.length; i++)\n//         output += String.fromCharCode(\n//             input.charCodeAt(i) & 0xff,\n//             (input.charCodeAt(i) >>> 8) & 0xff,\n//         );\n//     return output;\n// }\n// function str2rstr_utf16be(input: string) {\n//     var output = \"\";\n//     for (var i = 0; i < input.length; i++)\n//         output += String.fromCharCode(\n//             (input.charCodeAt(i) >>> 8) & 0xff,\n//             input.charCodeAt(i) & 0xff,\n//         );\n//     return output;\n// }\n/*\n * Convert a raw string to an array of big-endian words\n * Characters >255 have their high-byte silently ignored.\n */\nfunction rstr2binb(input) {\n    var output = Array(input.length >> 2);\n    for (var i = 0; i < output.length; i++)\n        output[i] = 0;\n    for (var i = 0; i < input.length * 8; i += 8)\n        output[i >> 5] |= (input.charCodeAt(i / 8) & 0xff) << (24 - (i % 32));\n    return output;\n}\n/*\n * Convert an array of big-endian words to a string\n */\nfunction binb2rstr(input) {\n    var output = \"\";\n    for (var i = 0; i < input.length * 32; i += 8)\n        output += String.fromCharCode((input[i >> 5] >>> (24 - (i % 32))) & 0xff);\n    return output;\n}\n/*\n * Main sha256 function, with its support functions\n */\nfunction sha256_S(X, n) {\n    return (X >>> n) | (X << (32 - n));\n}\nfunction sha256_R(X, n) {\n    return X >>> n;\n}\nfunction sha256_Ch(x, y, z) {\n    return (x & y) ^ (~x & z);\n}\nfunction sha256_Maj(x, y, z) {\n    return (x & y) ^ (x & z) ^ (y & z);\n}\nfunction sha256_Sigma0256(x) {\n    return sha256_S(x, 2) ^ sha256_S(x, 13) ^ sha256_S(x, 22);\n}\nfunction sha256_Sigma1256(x) {\n    return sha256_S(x, 6) ^ sha256_S(x, 11) ^ sha256_S(x, 25);\n}\nfunction sha256_Gamma0256(x) {\n    return sha256_S(x, 7) ^ sha256_S(x, 18) ^ sha256_R(x, 3);\n}\nfunction sha256_Gamma1256(x) {\n    return sha256_S(x, 17) ^ sha256_S(x, 19) ^ sha256_R(x, 10);\n}\n// function sha256_Sigma0512(x: number) {\n//     return sha256_S(x, 28) ^ sha256_S(x, 34) ^ sha256_S(x, 39);\n// }\n// function sha256_Sigma1512(x: number) {\n//     return sha256_S(x, 14) ^ sha256_S(x, 18) ^ sha256_S(x, 41);\n// }\n// function sha256_Gamma0512(x: number) {\n//     return sha256_S(x, 1) ^ sha256_S(x, 8) ^ sha256_R(x, 7);\n// }\n// function sha256_Gamma1512(x: number) {\n//     return sha256_S(x, 19) ^ sha256_S(x, 61) ^ sha256_R(x, 6);\n// }\nvar sha256_K = new Array(1116352408, 1899447441, -1245643825, -373957723, 961987163, 1508970993, -1841331548, -1424204075, -670586216, 310598401, 607225278, 1426881987, 1925078388, -2132889090, -1680079193, -1046744716, -459576895, -272742522, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, -1740746414, -1473132947, -1341970488, -1084653625, -958395405, -710438585, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, -2117940946, -1838011259, -1564481375, -1474664885, -1035236496, -949202525, -778901479, -694614492, -200395387, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222, 2024104815, -2067236844, -1933114872, -1866530822, -1538233109, -1090935817, -965641998);\nfunction binb_sha256(m, l) {\n    var HASH = new Array(1779033703, -1150833019, 1013904242, -1521486534, 1359893119, -1694144372, 528734635, 1541459225);\n    var W = new Array(64);\n    var a, b, c, d, e, f, g, h;\n    var i, j, T1, T2;\n    /* append padding */\n    m[l >> 5] |= 0x80 << (24 - (l % 32));\n    m[(((l + 64) >> 9) << 4) + 15] = l;\n    for (i = 0; i < m.length; i += 16) {\n        a = HASH[0];\n        b = HASH[1];\n        c = HASH[2];\n        d = HASH[3];\n        e = HASH[4];\n        f = HASH[5];\n        g = HASH[6];\n        h = HASH[7];\n        for (j = 0; j < 64; j++) {\n            if (j < 16)\n                W[j] = m[j + i];\n            else\n                W[j] = safe_add(safe_add(safe_add(sha256_Gamma1256(W[j - 2]), W[j - 7]), sha256_Gamma0256(W[j - 15])), W[j - 16]);\n            T1 = safe_add(safe_add(safe_add(safe_add(h, sha256_Sigma1256(e)), sha256_Ch(e, f, g)), sha256_K[j]), W[j]);\n            T2 = safe_add(sha256_Sigma0256(a), sha256_Maj(a, b, c));\n            h = g;\n            g = f;\n            f = e;\n            e = safe_add(d, T1);\n            d = c;\n            c = b;\n            b = a;\n            a = safe_add(T1, T2);\n        }\n        HASH[0] = safe_add(a, HASH[0]);\n        HASH[1] = safe_add(b, HASH[1]);\n        HASH[2] = safe_add(c, HASH[2]);\n        HASH[3] = safe_add(d, HASH[3]);\n        HASH[4] = safe_add(e, HASH[4]);\n        HASH[5] = safe_add(f, HASH[5]);\n        HASH[6] = safe_add(g, HASH[6]);\n        HASH[7] = safe_add(h, HASH[7]);\n    }\n    return HASH;\n}\nfunction safe_add(x, y) {\n    var lsw = (x & 0xffff) + (y & 0xffff);\n    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n    return (msw << 16) | (lsw & 0xffff);\n}\n"],"names":[],"mappings":"AAiDO,SAAS,YAAY,GAAG;AAC3B,SAAO,UAAU,YAAY,UAAU,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;AAC5D;AAmBO,SAAS,SAAS,OAAO;AAC5B,MAAI,UAAU;AACd,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,QAAI,IAAI,MAAM,WAAW,CAAC;AAC1B,cAAU,QAAQ,OAAQ,MAAM,IAAK,EAAI,IAAI,QAAQ,OAAO,IAAI,EAAI;AAAA,EACxE;AACA,SAAO;AACX;AA8HA,SAAS,UAAU,OAAO;AACtB,MAAI,SAAS,MAAM,MAAM,UAAU,CAAC;AACpC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ;AAC/B,WAAO,CAAC,IAAI;AAChB,WAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;AACvC,WAAO,KAAK,CAAC,MAAM,MAAM,WAAW,IAAI,CAAC,IAAI,QAAU,KAAM,IAAI;AACrE,SAAO;AACX;AAIA,SAAS,UAAU,OAAO;AACtB,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,SAAS,IAAI,KAAK;AACxC,cAAU,OAAO,aAAc,MAAM,KAAK,CAAC,MAAO,KAAM,IAAI,KAAQ,GAAI;AAC5E,SAAO;AACX;AAIA,SAAS,SAAS,GAAG,GAAG;AACpB,SAAQ,MAAM,IAAM,KAAM,KAAK;AACnC;AACA,SAAS,SAAS,GAAG,GAAG;AACpB,SAAO,MAAM;AACjB;AACA,SAAS,UAAU,GAAG,GAAG,GAAG;AACxB,SAAQ,IAAI,IAAM,CAAC,IAAI;AAC3B;AACA,SAAS,WAAW,GAAG,GAAG,GAAG;AACzB,SAAQ,IAAI,IAAM,IAAI,IAAM,IAAI;AACpC;AACA,SAAS,iBAAiB,GAAG;AACzB,SAAO,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,EAAE,IAAI,SAAS,GAAG,EAAE;AAC5D;AACA,SAAS,iBAAiB,GAAG;AACzB,SAAO,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,EAAE,IAAI,SAAS,GAAG,EAAE;AAC5D;AACA,SAAS,iBAAiB,GAAG;AACzB,SAAO,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,EAAE,IAAI,SAAS,GAAG,CAAC;AAC3D;AACA,SAAS,iBAAiB,GAAG;AACzB,SAAO,SAAS,GAAG,EAAE,IAAI,SAAS,GAAG,EAAE,IAAI,SAAS,GAAG,EAAE;AAC7D;AAaA,IAAI,WAAW,IAAI,MAAM,YAAY,YAAY,aAAa,YAAY,WAAW,YAAY,aAAa,aAAa,YAAY,WAAW,WAAW,YAAY,YAAY,aAAa,aAAa,aAAa,YAAY,YAAY,WAAW,WAAW,WAAW,YAAY,YAAY,YAAY,aAAa,aAAa,aAAa,aAAa,YAAY,YAAY,WAAW,WAAW,WAAW,WAAW,YAAY,YAAY,YAAY,YAAY,aAAa,aAAa,aAAa,aAAa,aAAa,YAAY,YAAY,YAAY,YAAY,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,YAAY,YAAY,YAAY,YAAY,YAAY,aAAa,aAAa,aAAa,aAAa,aAAa,UAAU;AAC3xB,SAAS,YAAY,GAAG,GAAG;AACvB,MAAI,OAAO,IAAI,MAAM,YAAY,aAAa,YAAY,aAAa,YAAY,aAAa,WAAW,UAAU;AACrH,MAAI,IAAI,IAAI,MAAM,EAAE;AACpB,MAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACzB,MAAI,GAAG,GAAG,IAAI;AAEd,IAAE,KAAK,CAAC,KAAK,OAAS,KAAM,IAAI;AAChC,KAAK,IAAI,MAAO,KAAM,KAAK,EAAE,IAAI;AACjC,OAAK,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,IAAI;AAC/B,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,QAAI,KAAK,CAAC;AACV,SAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,UAAI,IAAI;AACJ,UAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAAA;AAEd,UAAE,CAAC,IAAI,SAAS,SAAS,SAAS,iBAAiB,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;AACpH,WAAK,SAAS,SAAS,SAAS,SAAS,GAAG,iBAAiB,CAAC,CAAC,GAAG,UAAU,GAAG,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AACzG,WAAK,SAAS,iBAAiB,CAAC,GAAG,WAAW,GAAG,GAAG,CAAC,CAAC;AACtD,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,SAAS,GAAG,EAAE;AAClB,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,SAAS,IAAI,EAAE;AAAA,IACvB;AACA,SAAK,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC;AAC7B,SAAK,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC;AAC7B,SAAK,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC;AAC7B,SAAK,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC;AAC7B,SAAK,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC;AAC7B,SAAK,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC;AAC7B,SAAK,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC;AAC7B,SAAK,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC;AAAA,EACjC;AACA,SAAO;AACX;AACA,SAAS,SAAS,GAAG,GAAG;AACpB,MAAI,OAAO,IAAI,UAAW,IAAI;AAC9B,MAAI,OAAO,KAAK,OAAO,KAAK,OAAO,OAAO;AAC1C,SAAQ,OAAO,KAAO,MAAM;AAChC;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/util.mjs

@@ -0,0 +1,60 @@
+var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
+function int2char(n) {
+  return BI_RM.charAt(n);
+}
+function op_and(x, y) {
+  return x & y;
+}
+function op_or(x, y) {
+  return x | y;
+}
+function op_xor(x, y) {
+  return x ^ y;
+}
+function op_andnot(x, y) {
+  return x & ~y;
+}
+function lbit(x) {
+  if (x == 0) {
+    return -1;
+  }
+  var r = 0;
+  if ((x & 65535) == 0) {
+    x >>= 16;
+    r += 16;
+  }
+  if ((x & 255) == 0) {
+    x >>= 8;
+    r += 8;
+  }
+  if ((x & 15) == 0) {
+    x >>= 4;
+    r += 4;
+  }
+  if ((x & 3) == 0) {
+    x >>= 2;
+    r += 2;
+  }
+  if ((x & 1) == 0) {
+    ++r;
+  }
+  return r;
+}
+function cbit(x) {
+  var r = 0;
+  while (x != 0) {
+    x &= x - 1;
+    ++r;
+  }
+  return r;
+}
+export {
+  cbit,
+  int2char,
+  lbit,
+  op_and,
+  op_andnot,
+  op_or,
+  op_xor
+};
+//# sourceMappingURL=util.mjs.map

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/util.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/util.js"],"sourcesContent":["var BI_RM = \"0123456789abcdefghijklmnopqrstuvwxyz\";\nexport function int2char(n) {\n    return BI_RM.charAt(n);\n}\n//#region BIT_OPERATIONS\n// (public) this & a\nexport function op_and(x, y) {\n    return x & y;\n}\n// (public) this | a\nexport function op_or(x, y) {\n    return x | y;\n}\n// (public) this ^ a\nexport function op_xor(x, y) {\n    return x ^ y;\n}\n// (public) this & ~a\nexport function op_andnot(x, y) {\n    return x & ~y;\n}\n// return index of lowest 1-bit in x, x < 2^31\nexport function lbit(x) {\n    if (x == 0) {\n        return -1;\n    }\n    var r = 0;\n    if ((x & 0xffff) == 0) {\n        x >>= 16;\n        r += 16;\n    }\n    if ((x & 0xff) == 0) {\n        x >>= 8;\n        r += 8;\n    }\n    if ((x & 0xf) == 0) {\n        x >>= 4;\n        r += 4;\n    }\n    if ((x & 3) == 0) {\n        x >>= 2;\n        r += 2;\n    }\n    if ((x & 1) == 0) {\n        ++r;\n    }\n    return r;\n}\n// return number of 1 bits in x\nexport function cbit(x) {\n    var r = 0;\n    while (x != 0) {\n        x &= x - 1;\n        ++r;\n    }\n    return r;\n}\n//#endregion BIT_OPERATIONS\n"],"names":[],"mappings":"AAAA,IAAI,QAAQ;AACL,SAAS,SAAS,GAAG;AACxB,SAAO,MAAM,OAAO,CAAC;AACzB;AAGO,SAAS,OAAO,GAAG,GAAG;AACzB,SAAO,IAAI;AACf;AAEO,SAAS,MAAM,GAAG,GAAG;AACxB,SAAO,IAAI;AACf;AAEO,SAAS,OAAO,GAAG,GAAG;AACzB,SAAO,IAAI;AACf;AAEO,SAAS,UAAU,GAAG,GAAG;AAC5B,SAAO,IAAI,CAAC;AAChB;AAEO,SAAS,KAAK,GAAG;AACpB,MAAI,KAAK,GAAG;AACR,WAAO;AAAA,EACX;AACA,MAAI,IAAI;AACR,OAAK,IAAI,UAAW,GAAG;AACnB,UAAM;AACN,SAAK;AAAA,EACT;AACA,OAAK,IAAI,QAAS,GAAG;AACjB,UAAM;AACN,SAAK;AAAA,EACT;AACA,OAAK,IAAI,OAAQ,GAAG;AAChB,UAAM;AACN,SAAK;AAAA,EACT;AACA,OAAK,IAAI,MAAM,GAAG;AACd,UAAM;AACN,SAAK;AAAA,EACT;AACA,OAAK,IAAI,MAAM,GAAG;AACd,MAAE;AAAA,EACN;AACA,SAAO;AACX;AAEO,SAAS,KAAK,GAAG;AACpB,MAAI,IAAI;AACR,SAAO,KAAK,GAAG;AACX,SAAK,IAAI;AACT,MAAE;AAAA,EACN;AACA,SAAO;AACX;","x_google_ignoreList":[0]}