@ray-js/wechat-rsa 0.0.1-beta-1

package/index..js

@@ -0,0 +1,3709 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+const BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
+function int2char(n) {
+  return BI_RM.charAt(n);
+} //#region BIT_OPERATIONS
+// (public) this & a
+
+function op_and(x, y) {
+  return x & y;
+} // (public) this | a
+
+function op_or(x, y) {
+  return x | y;
+} // (public) this ^ a
+
+function op_xor(x, y) {
+  return x ^ y;
+} // (public) this & ~a
+
+function op_andnot(x, y) {
+  return x & ~y;
+} // return index of lowest 1-bit in x, x < 2^31
+
+function lbit(x) {
+  if (x == 0) {
+    return -1;
+  }
+
+  let r = 0;
+
+  if ((x & 0xffff) == 0) {
+    x >>= 16;
+    r += 16;
+  }
+
+  if ((x & 0xff) == 0) {
+    x >>= 8;
+    r += 8;
+  }
+
+  if ((x & 0xf) == 0) {
+    x >>= 4;
+    r += 4;
+  }
+
+  if ((x & 3) == 0) {
+    x >>= 2;
+    r += 2;
+  }
+
+  if ((x & 1) == 0) {
+    ++r;
+  }
+
+  return r;
+} // return number of 1 bits in x
+
+function cbit(x) {
+  let r = 0;
+
+  while (x != 0) {
+    x &= x - 1;
+    ++r;
+  }
+
+  return r;
+} //#endregion BIT_OPERATIONS
+
+const b64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+const b64pad = "=";
+function hex2b64(h) {
+  let i;
+  let c;
+  let ret = "";
+
+  for (i = 0; i + 3 <= h.length; i += 3) {
+    c = parseInt(h.substring(i, i + 3), 16);
+    ret += b64map.charAt(c >> 6) + b64map.charAt(c & 63);
+  }
+
+  if (i + 1 == h.length) {
+    c = parseInt(h.substring(i, i + 1), 16);
+    ret += b64map.charAt(c << 2);
+  } else if (i + 2 == h.length) {
+    c = parseInt(h.substring(i, i + 2), 16);
+    ret += b64map.charAt(c >> 2) + b64map.charAt((c & 3) << 4);
+  }
+
+  while ((ret.length & 3) > 0) {
+    ret += b64pad;
+  }
+
+  return ret;
+} // convert a base64 string to hex
+
+// Hex JavaScript decoder
+// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>
+// Permission to use, copy, modify, and/or distribute this software for any
+// purpose with or without fee is hereby granted, provided that the above
+// copyright notice and this permission notice appear in all copies.
+//
+// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
+let decoder$1;
+const Hex = {
+  decode(a) {
+    let i;
+
+    if (decoder$1 === undefined) {
+      let hex = "0123456789ABCDEF";
+      const ignore = " \f\n\r\t\u00A0\u2028\u2029";
+      decoder$1 = {};
+
+      for (i = 0; i < 16; ++i) {
+        decoder$1[hex.charAt(i)] = i;
+      }
+
+      hex = hex.toLowerCase();
+
+      for (i = 10; i < 16; ++i) {
+        decoder$1[hex.charAt(i)] = i;
+      }
+
+      for (i = 0; i < ignore.length; ++i) {
+        decoder$1[ignore.charAt(i)] = -1;
+      }
+    }
+
+    const out = [];
+    let bits = 0;
+    let char_count = 0;
+
+    for (i = 0; i < a.length; ++i) {
+      let c = a.charAt(i);
+
+      if (c == "=") {
+        break;
+      }
+
+      c = decoder$1[c];
+
+      if (c == -1) {
+        continue;
+      }
+
+      if (c === undefined) {
+        throw new Error("Illegal character at offset " + i);
+      }
+
+      bits |= c;
+
+      if (++char_count >= 2) {
+        out[out.length] = bits;
+        bits = 0;
+        char_count = 0;
+      } else {
+        bits <<= 4;
+      }
+    }
+
+    if (char_count) {
+      throw new Error("Hex encoding incomplete: 4 bits missing");
+    }
+
+    return out;
+  }
+
+};
+
+// Base64 JavaScript decoder
+// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>
+// Permission to use, copy, modify, and/or distribute this software for any
+// purpose with or without fee is hereby granted, provided that the above
+// copyright notice and this permission notice appear in all copies.
+//
+// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
+let decoder;
+const Base64 = {
+  decode(a) {
+    let i;
+
+    if (decoder === undefined) {
+      const b64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+      const ignore = "= \f\n\r\t\u00A0\u2028\u2029";
+      decoder = Object.create(null);
+
+      for (i = 0; i < 64; ++i) {
+        decoder[b64.charAt(i)] = i;
+      }
+
+      decoder['-'] = 62; //+
+
+      decoder['_'] = 63; //-
+
+      for (i = 0; i < ignore.length; ++i) {
+        decoder[ignore.charAt(i)] = -1;
+      }
+    }
+
+    const out = [];
+    let bits = 0;
+    let char_count = 0;
+
+    for (i = 0; i < a.length; ++i) {
+      let c = a.charAt(i);
+
+      if (c == "=") {
+        break;
+      }
+
+      c = decoder[c];
+
+      if (c == -1) {
+        continue;
+      }
+
+      if (c === undefined) {
+        throw new Error("Illegal character at offset " + i);
+      }
+
+      bits |= c;
+
+      if (++char_count >= 4) {
+        out[out.length] = bits >> 16;
+        out[out.length] = bits >> 8 & 0xFF;
+        out[out.length] = bits & 0xFF;
+        bits = 0;
+        char_count = 0;
+      } else {
+        bits <<= 6;
+      }
+    }
+
+    switch (char_count) {
+      case 1:
+        throw new Error("Base64 encoding incomplete: at least 2 bits missing");
+
+      case 2:
+        out[out.length] = bits >> 10;
+        break;
+
+      case 3:
+        out[out.length] = bits >> 16;
+        out[out.length] = bits >> 8 & 0xFF;
+        break;
+    }
+
+    return out;
+  },
+
+  // eslint-disable-next-line no-useless-escape
+  re: /-----BEGIN [^-]+-----([A-Za-z0-9+\/=\s]+)-----END [^-]+-----|begin-base64[^\n]+\n([A-Za-z0-9+\/=\s]+)====/,
+
+  unarmor(a) {
+    const m = Base64.re.exec(a);
+
+    if (m) {
+      if (m[1]) {
+        a = m[1];
+      } else if (m[2]) {
+        a = m[2];
+      } else {
+        throw new Error("RegExp out of sync");
+      }
+    }
+
+    return Base64.decode(a);
+  }
+
+};
+
+// Big integer base-10 printing library
+// Copyright (c) 2014 Lapo Luchini <lapo@lapo.it>
+// Permission to use, copy, modify, and/or distribute this software for any
+// purpose with or without fee is hereby granted, provided that the above
+// copyright notice and this permission notice appear in all copies.
+//
+// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
+const max = 10000000000000; // biggest integer that can still fit 2^53 when multiplied by 256
+
+class Int10 {
+  constructor(value) {
+    this.buf = [value ? +value : 0];
+  }
+
+  mulAdd(m, c) {
+    // assert(m <= 256)
+    const b = this.buf;
+    const l = b.length;
+    let i;
+    let t;
+
+    for (i = 0; i < l; ++i) {
+      t = b[i] * m + c;
+
+      if (t < max) {
+        c = 0;
+      } else {
+        c = 0 | t / max;
+        t -= c * max;
+      }
+
+      b[i] = t;
+    }
+
+    if (c > 0) {
+      b[i] = c;
+    }
+  }
+
+  sub(c) {
+    // assert(m <= 256)
+    const b = this.buf;
+    const l = b.length;
+    let i;
+    let t;
+
+    for (i = 0; i < l; ++i) {
+      t = b[i] - c;
+
+      if (t < 0) {
+        t += max;
+        c = 1;
+      } else {
+        c = 0;
+      }
+
+      b[i] = t;
+    }
+
+    while (b[b.length - 1] === 0) {
+      b.pop();
+    }
+  }
+
+  toString(base) {
+    if ((base || 10) != 10) {
+      throw new Error('only base 10 is supported');
+    }
+
+    const b = this.buf;
+    let s = b[b.length - 1].toString();
+
+    for (let i = b.length - 2; i >= 0; --i) {
+      s += (max + b[i]).toString().substring(1);
+    }
+
+    return s;
+  }
+
+  valueOf() {
+    const b = this.buf;
+    let v = 0;
+
+    for (let i = b.length - 1; i >= 0; --i) {
+      v = v * max + b[i];
+    }
+
+    return v;
+  }
+
+  simplify() {
+    const b = this.buf;
+    return b.length == 1 ? b[0] : this;
+  }
+
+}
+
+// ASN.1 JavaScript decoder
+const ellipsis = '\u2026';
+const reTimeS = /^(\d\d)(0[1-9]|1[0-2])(0[1-9]|[12]\d|3[01])([01]\d|2[0-3])(?:([0-5]\d)(?:([0-5]\d)(?:[.,](\d{1,3}))?)?)?(Z|[-+](?:[0]\d|1[0-2])([0-5]\d)?)?$/;
+const reTimeL = /^(\d\d\d\d)(0[1-9]|1[0-2])(0[1-9]|[12]\d|3[01])([01]\d|2[0-3])(?:([0-5]\d)(?:([0-5]\d)(?:[.,](\d{1,3}))?)?)?(Z|[-+](?:[0]\d|1[0-2])([0-5]\d)?)?$/;
+
+function stringCut(str, len) {
+  if (str.length > len) {
+    str = str.substring(0, len) + ellipsis;
+  }
+
+  return str;
+}
+
+class Stream {
+  constructor(enc, pos) {
+    this.hexDigits = '0123456789ABCDEF';
+
+    if (enc instanceof Stream) {
+      this.enc = enc.enc;
+      this.pos = enc.pos;
+    } else {
+      // enc should be an array or a binary string
+      this.enc = enc;
+      this.pos = pos || 0;
+    }
+  }
+
+  get(pos) {
+    if (pos === undefined) {
+      pos = this.pos++;
+    }
+
+    if (pos >= this.enc.length) {
+      throw new Error(`Requesting byte offset ${pos} on a stream of length ${this.enc.length}`);
+    }
+
+    return 'string' === typeof this.enc ? this.enc.charCodeAt(pos) : this.enc[pos];
+  }
+
+  hexByte(b) {
+    return this.hexDigits.charAt(b >> 4 & 0xf) + this.hexDigits.charAt(b & 0xf);
+  }
+
+  hexDump(start, end, raw) {
+    let s = '';
+
+    for (let i = start; i < end; ++i) {
+      s += this.hexByte(this.get(i));
+
+      if (raw !== true) {
+        switch (i & 0xf) {
+          case 0x7:
+            s += '  ';
+            break;
+
+          case 0xf:
+            s += '\n';
+            break;
+
+          default:
+            s += ' ';
+        }
+      }
+    }
+
+    return s;
+  }
+
+  isASCII(start, end) {
+    for (let i = start; i < end; ++i) {
+      const c = this.get(i);
+
+      if (c < 32 || c > 176) {
+        return false;
+      }
+    }
+
+    return true;
+  }
+
+  parseStringISO(start, end) {
+    let s = '';
+
+    for (let i = start; i < end; ++i) {
+      s += String.fromCharCode(this.get(i));
+    }
+
+    return s;
+  }
+
+  parseStringUTF(start, end) {
+    let s = '';
+
+    for (let i = start; i < end;) {
+      const c = this.get(i++);
+
+      if (c < 128) {
+        s += String.fromCharCode(c);
+      } else if (c > 191 && c < 224) {
+        s += String.fromCharCode((c & 0x1f) << 6 | this.get(i++) & 0x3f);
+      } else {
+        s += String.fromCharCode((c & 0x0f) << 12 | (this.get(i++) & 0x3f) << 6 | this.get(i++) & 0x3f);
+      }
+    }
+
+    return s;
+  }
+
+  parseStringBMP(start, end) {
+    let str = '';
+    let hi;
+    let lo;
+
+    for (let i = start; i < end;) {
+      hi = this.get(i++);
+      lo = this.get(i++);
+      str += String.fromCharCode(hi << 8 | lo);
+    }
+
+    return str;
+  }
+
+  parseTime(start, end, shortYear) {
+    let s = this.parseStringISO(start, end);
+    const m = (shortYear ? reTimeS : reTimeL).exec(s);
+
+    if (!m) {
+      return 'Unrecognized time: ' + s;
+    }
+
+    if (shortYear) {
+      // to avoid querying the timer, use the fixed range [1970, 2069]
+      // it will conform with ITU X.400 [-10, +40] sliding window until 2030
+      m[1] = +m[1];
+      m[1] += +m[1] < 70 ? 2000 : 1900;
+    }
+
+    s = m[1] + '-' + m[2] + '-' + m[3] + ' ' + m[4];
+
+    if (m[5]) {
+      s += ':' + m[5];
+
+      if (m[6]) {
+        s += ':' + m[6];
+
+        if (m[7]) {
+          s += '.' + m[7];
+        }
+      }
+    }
+
+    if (m[8]) {
+      s += ' UTC';
+
+      if (m[8] != 'Z') {
+        s += m[8];
+
+        if (m[9]) {
+          s += ':' + m[9];
+        }
+      }
+    }
+
+    return s;
+  }
+
+  parseInteger(start, end) {
+    let v = this.get(start);
+    const neg = v > 127;
+    const pad = neg ? 255 : 0;
+    let len;
+    let s = ''; // skip unuseful bits (not allowed in DER)
+
+    while (v == pad && ++start < end) {
+      v = this.get(start);
+    }
+
+    len = end - start;
+
+    if (len === 0) {
+      return neg ? -1 : 0;
+    } // show bit length of huge integers
+
+
+    if (len > 4) {
+      s = v;
+      len <<= 3;
+
+      while (((+s ^ pad) & 0x80) == 0) {
+        s = +s << 1;
+        --len;
+      }
+
+      s = '(' + len + ' bit)\n';
+    } // decode the integer
+
+
+    if (neg) {
+      v = v - 256;
+    }
+
+    const n = new Int10(v);
+
+    for (let i = start + 1; i < end; ++i) {
+      n.mulAdd(256, this.get(i));
+    }
+
+    return s + n.toString();
+  }
+
+  parseBitString(start, end, maxLength) {
+    const unusedBit = this.get(start);
+    const lenBit = (end - start - 1 << 3) - unusedBit;
+    const intro = '(' + lenBit + ' bit)\n';
+    let s = '';
+
+    for (let i = start + 1; i < end; ++i) {
+      const b = this.get(i);
+      const skip = i == end - 1 ? unusedBit : 0;
+
+      for (let j = 7; j >= skip; --j) {
+        s += b >> j & 1 ? '1' : '0';
+      }
+
+      if (s.length > maxLength) {
+        return intro + stringCut(s, maxLength);
+      }
+    }
+
+    return intro + s;
+  }
+
+  parseOctetString(start, end, maxLength) {
+    if (this.isASCII(start, end)) {
+      return stringCut(this.parseStringISO(start, end), maxLength);
+    }
+
+    const len = end - start;
+    let s = '(' + len + ' byte)\n';
+    maxLength /= 2; // we work in bytes
+
+    if (len > maxLength) {
+      end = start + maxLength;
+    }
+
+    for (let i = start; i < end; ++i) {
+      s += this.hexByte(this.get(i));
+    }
+
+    if (len > maxLength) {
+      s += ellipsis;
+    }
+
+    return s;
+  }
+
+  parseOID(start, end, maxLength) {
+    let s = '';
+    let n = new Int10();
+    let bits = 0;
+
+    for (let i = start; i < end; ++i) {
+      const v = this.get(i);
+      n.mulAdd(128, v & 0x7f);
+      bits += 7;
+
+      if (!(v & 0x80)) {
+        // finished
+        if (s === '') {
+          n = n.simplify();
+
+          if (n instanceof Int10) {
+            n.sub(80);
+            s = '2.' + n.toString();
+          } else {
+            const m = n < 80 ? n < 40 ? 0 : 1 : 2;
+            s = m + '.' + (n - m * 40);
+          }
+        } else {
+          s += '.' + n.toString();
+        }
+
+        if (s.length > maxLength) {
+          return stringCut(s, maxLength);
+        }
+
+        n = new Int10();
+        bits = 0;
+      }
+    }
+
+    if (bits > 0) {
+      s += '.incomplete';
+    }
+
+    return s;
+  }
+
+}
+class ASN1 {
+  constructor(stream, header, length, tag, sub) {
+    if (!(tag instanceof ASN1Tag)) {
+      throw new Error('Invalid tag value.');
+    }
+
+    this.stream = stream;
+    this.header = header;
+    this.length = length;
+    this.tag = tag;
+    this.sub = sub;
+  }
+
+  typeName() {
+    switch (this.tag.tagClass) {
+      case 0:
+        // universal
+        switch (this.tag.tagNumber) {
+          case 0x00:
+            return 'EOC';
+
+          case 0x01:
+            return 'BOOLEAN';
+
+          case 0x02:
+            return 'INTEGER';
+
+          case 0x03:
+            return 'BIT_STRING';
+
+          case 0x04:
+            return 'OCTET_STRING';
+
+          case 0x05:
+            return 'NULL';
+
+          case 0x06:
+            return 'OBJECT_IDENTIFIER';
+
+          case 0x07:
+            return 'ObjectDescriptor';
+
+          case 0x08:
+            return 'EXTERNAL';
+
+          case 0x09:
+            return 'REAL';
+
+          case 0x0a:
+            return 'ENUMERATED';
+
+          case 0x0b:
+            return 'EMBEDDED_PDV';
+
+          case 0x0c:
+            return 'UTF8String';
+
+          case 0x10:
+            return 'SEQUENCE';
+
+          case 0x11:
+            return 'SET';
+
+          case 0x12:
+            return 'NumericString';
+
+          case 0x13:
+            return 'PrintableString';
+          // ASCII subset
+
+          case 0x14:
+            return 'TeletexString';
+          // aka T61String
+
+          case 0x15:
+            return 'VideotexString';
+
+          case 0x16:
+            return 'IA5String';
+          // ASCII
+
+          case 0x17:
+            return 'UTCTime';
+
+          case 0x18:
+            return 'GeneralizedTime';
+
+          case 0x19:
+            return 'GraphicString';
+
+          case 0x1a:
+            return 'VisibleString';
+          // ASCII subset
+
+          case 0x1b:
+            return 'GeneralString';
+
+          case 0x1c:
+            return 'UniversalString';
+
+          case 0x1e:
+            return 'BMPString';
+        }
+
+        return 'Universal_' + this.tag.tagNumber.toString();
+
+      case 1:
+        return 'Application_' + this.tag.tagNumber.toString();
+
+      case 2:
+        return '[' + this.tag.tagNumber.toString() + ']';
+      // Context
+
+      case 3:
+        return 'Private_' + this.tag.tagNumber.toString();
+
+      default:
+        return;
+    }
+  }
+
+  content(maxLength) {
+    // a preview of the content (intended for humans)
+    if (this.tag === undefined) {
+      return null;
+    }
+
+    if (maxLength === undefined) {
+      maxLength = Infinity;
+    }
+
+    const content = this.posContent();
+    const len = Math.abs(this.length);
+
+    if (!this.tag.isUniversal()) {
+      if (this.sub !== null) {
+        return '(' + this.sub.length + ' elem)';
+      }
+
+      return this.stream.parseOctetString(content, content + len, maxLength);
+    }
+
+    switch (this.tag.tagNumber) {
+      case 0x01:
+        // BOOLEAN
+        return this.stream.get(content) === 0 ? 'false' : 'true';
+
+      case 0x02:
+        // INTEGER
+        return this.stream.parseInteger(content, content + len);
+
+      case 0x03:
+        // BIT_STRING
+        return this.sub ? '(' + this.sub.length + ' elem)' : this.stream.parseBitString(content, content + len, maxLength);
+
+      case 0x04:
+        // OCTET_STRING
+        return this.sub ? '(' + this.sub.length + ' elem)' : this.stream.parseOctetString(content, content + len, maxLength);
+      // case 0x05: // NULL
+
+      case 0x06:
+        // OBJECT_IDENTIFIER
+        return this.stream.parseOID(content, content + len, maxLength);
+      // case 0x07: // ObjectDescriptor
+      // case 0x08: // EXTERNAL
+      // case 0x09: // REAL
+      // case 0x0A: // ENUMERATED
+      // case 0x0B: // EMBEDDED_PDV
+
+      case 0x10: // SEQUENCE
+
+      case 0x11:
+        // SET
+        if (this.sub !== null) {
+          return '(' + this.sub.length + ' elem)';
+        } else {
+          return '(no elem)';
+        }
+
+      case 0x0c:
+        // UTF8String
+        return stringCut(this.stream.parseStringUTF(content, content + len), maxLength);
+
+      case 0x12: // NumericString
+
+      case 0x13: // PrintableString
+
+      case 0x14: // TeletexString
+
+      case 0x15: // VideotexString
+
+      case 0x16: // IA5String
+      // case 0x19: // GraphicString
+      // eslint-disable-next-line no-fallthrough
+
+      case 0x1a:
+        // VisibleString
+        // case 0x1B: // GeneralString
+        // case 0x1C: // UniversalString
+        return stringCut(this.stream.parseStringISO(content, content + len), maxLength);
+
+      case 0x1e:
+        // BMPString
+        return stringCut(this.stream.parseStringBMP(content, content + len), maxLength);
+
+      case 0x17: // UTCTime
+
+      case 0x18:
+        // GeneralizedTime
+        return this.stream.parseTime(content, content + len, this.tag.tagNumber == 0x17);
+    }
+
+    return null;
+  }
+
+  toString() {
+    return this.typeName() + '@' + this.stream.pos + '[header:' + this.header + ',length:' + this.length + ',sub:' + (this.sub === null ? 'null' : this.sub.length) + ']';
+  }
+
+  toPrettyString(indent) {
+    if (indent === undefined) {
+      indent = '';
+    }
+
+    let s = indent + this.typeName() + ' @' + this.stream.pos;
+
+    if (this.length >= 0) {
+      s += '+';
+    }
+
+    s += this.length;
+
+    if (this.tag.tagConstructed) {
+      s += ' (constructed)';
+    } else if (this.tag.isUniversal() && (this.tag.tagNumber == 0x03 || this.tag.tagNumber == 0x04) && this.sub !== null) {
+      s += ' (encapsulates)';
+    }
+
+    s += '\n';
+
+    if (this.sub !== null) {
+      indent += '  ';
+
+      for (let i = 0, max = this.sub.length; i < max; ++i) {
+        s += this.sub[i].toPrettyString(indent);
+      }
+    }
+
+    return s;
+  }
+
+  posStart() {
+    return this.stream.pos;
+  }
+
+  posContent() {
+    return this.stream.pos + this.header;
+  }
+
+  posEnd() {
+    return this.stream.pos + this.header + Math.abs(this.length);
+  }
+
+  toHexString() {
+    return this.stream.hexDump(this.posStart(), this.posEnd(), true);
+  }
+
+  static decodeLength(stream) {
+    let buf = stream.get();
+    const len = buf & 0x7f;
+
+    if (len == buf) {
+      return len;
+    } // no reason to use Int10, as it would be a huge buffer anyways
+
+
+    if (len > 6) {
+      throw new Error('Length over 48 bits not supported at position ' + (stream.pos - 1));
+    }
+
+    if (len === 0) {
+      return null;
+    } // undefined
+
+
+    buf = 0;
+
+    for (let i = 0; i < len; ++i) {
+      buf = buf * 256 + stream.get();
+    }
+
+    return buf;
+  }
+  /**
+   * Retrieve the hexadecimal value (as a string) of the current ASN.1 element
+   * @returns {string}
+   * @public
+   */
+
+
+  getHexStringValue() {
+    const hexString = this.toHexString();
+    const offset = this.header * 2;
+    const length = this.length * 2;
+    return hexString.substr(offset, length);
+  }
+
+  static decode(str) {
+    let stream;
+
+    if (!(str instanceof Stream)) {
+      stream = new Stream(str, 0);
+    } else {
+      stream = str;
+    }
+
+    const streamStart = new Stream(stream);
+    const tag = new ASN1Tag(stream);
+    let len = ASN1.decodeLength(stream);
+    const start = stream.pos;
+    const header = start - streamStart.pos;
+    let sub = null;
+
+    const getSub = function getSub() {
+      const ret = [];
+
+      if (len !== null) {
+        // definite length
+        const end = start + len;
+
+        while (stream.pos < end) {
+          ret[ret.length] = ASN1.decode(stream);
+        }
+
+        if (stream.pos != end) {
+          throw new Error('Content size is not correct for container starting at offset ' + start);
+        }
+      } else {
+        // undefined length
+        try {
+          for (;;) {
+            const s = ASN1.decode(stream);
+
+            if (s.tag.isEOC()) {
+              break;
+            }
+
+            ret[ret.length] = s;
+          }
+
+          len = start - stream.pos; // undefined lengths are represented as negative values
+        } catch (e) {
+          throw new Error('Exception while decoding undefined length content: ' + e);
+        }
+      }
+
+      return ret;
+    };
+
+    if (tag.tagConstructed) {
+      // must have valid content
+      sub = getSub();
+    } else if (tag.isUniversal() && (tag.tagNumber == 0x03 || tag.tagNumber == 0x04)) {
+      // sometimes BitString and OctetString are used to encapsulate ASN.1
+      try {
+        if (tag.tagNumber == 0x03) {
+          if (stream.get() != 0) {
+            throw new Error('BIT STRINGs with unused bits cannot encapsulate.');
+          }
+        }
+
+        sub = getSub();
+
+        for (let i = 0; i < sub.length; ++i) {
+          if (sub[i].tag.isEOC()) {
+            throw new Error('EOC is not supposed to be actual content.');
+          }
+        }
+      } catch (e) {
+        // but silently ignore when they don't
+        sub = null;
+      }
+    }
+
+    if (len === null) {
+      throw new Error("We can't skip over an invalid tag with undefined length at offset " + start);
+    }
+
+    if (sub === null) {
+      if (len === null) {
+        throw new Error("We can't skip over an invalid tag with undefined length at offset " + start);
+      }
+
+      stream.pos = start + Math.abs(len);
+    }
+
+    return new ASN1(streamStart, header, len, tag, sub);
+  }
+
+}
+class ASN1Tag {
+  constructor(stream) {
+    let buf = stream.get();
+    this.tagClass = buf >> 6;
+    this.tagConstructed = (buf & 0x20) !== 0;
+    this.tagNumber = buf & 0x1f;
+
+    if (this.tagNumber == 0x1f) {
+      // long tag
+      const n = new Int10();
+
+      do {
+        buf = stream.get();
+        n.mulAdd(128, buf & 0x7f);
+      } while (buf & 0x80);
+
+      this.tagNumber = n.simplify();
+    }
+  }
+
+  isUniversal() {
+    return this.tagClass === 0x00;
+  }
+
+  isEOC() {
+    return this.tagClass === 0x00 && this.tagNumber === 0x00;
+  }
+
+}
+
+// Copyright (c) 2005  Tom Wu
+
+let dbits; // JavaScript engine analysis
+
+const canary = 0xdeadbeefcafe;
+const j_lm = (canary & 0xffffff) == 0xefcafe; // am: Compute w_j += (x*this_i), propagate carries,
+// c is initial carry, returns final carry.
+// c < 3*dvalue, x < 2*dvalue, this_i < dvalue
+// We need to select the fastest one that works in this environment.
+
+const inBrowser = typeof navigator !== 'undefined';
+const isIE = inBrowser && j_lm && navigator.appName === 'Microsoft Internet Explorer';
+const isNetscapeOrWx = (inBrowser && navigator.appName !== 'Netscape' || typeof wx !== 'undefined');
+
+if (isIE) {
+  dbits = 30;
+} else if (isNetscapeOrWx) {
+  dbits = 26;
+} else {
+  dbits = 28;
+}
+
+const BI_FP = 52; //#region
+
+const lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];
+const lplim = (1 << 26) / lowprimes[lowprimes.length - 1]; //#endregion
+// (public) Constructor
+
+class BigInteger {
+  constructor(a, b, c) {
+    this.DB = dbits;
+    this.DM = (1 << dbits) - 1;
+    this.DV = 1 << dbits;
+    this.FV = Math.pow(2, BI_FP);
+    this.F1 = BI_FP - dbits;
+    this.F2 = 2 * dbits - BI_FP;
+
+    if (a != null) {
+      if ('number' == typeof a) {
+        if (typeof b !== 'undefined') {
+          this.fromNumber(a, b, c);
+        }
+      } else if (b == null && 'string' != typeof a) {
+        this.fromString(a, 256);
+      } else {
+        this.fromString(a, b);
+      }
+    }
+  } //#region PUBLIC
+  // (public) return string representation in given radix
+
+
+  toString(b) {
+    if (this.s < 0) {
+      return '-' + this.negate().toString(b);
+    }
+
+    let k;
+
+    if (b == 16) {
+      k = 4;
+    } else if (b == 8) {
+      k = 3;
+    } else if (b == 2) {
+      k = 1;
+    } else if (b == 32) {
+      k = 5;
+    } else if (b == 4) {
+      k = 2;
+    } else {
+      return this.toRadix(b);
+    }
+
+    const km = (1 << k) - 1;
+    let d;
+    let m = false;
+    let r = '';
+    let i = this.t;
+    let p = this.DB - i * this.DB % k;
+
+    if (i-- > 0) {
+      if (p < this.DB && (d = this[i] >> p) > 0) {
+        m = true;
+        r = int2char(d);
+      }
+
+      while (i >= 0) {
+        if (p < k) {
+          d = (this[i] & (1 << p) - 1) << k - p;
+          d |= this[--i] >> (p += this.DB - k);
+        } else {
+          d = this[i] >> (p -= k) & km;
+
+          if (p <= 0) {
+            p += this.DB;
+            --i;
+          }
+        }
+
+        if (d > 0) {
+          m = true;
+        }
+
+        if (m) {
+          r += int2char(d);
+        }
+      }
+    }
+
+    return m ? r : '0';
+  } // (public) -this
+
+
+  negate() {
+    const r = nbi();
+    BigInteger.ZERO.subTo(this, r);
+    return r;
+  } // (public) |this|
+
+
+  abs() {
+    return this.s < 0 ? this.negate() : this;
+  } // (public) return + if this > a, - if this < a, 0 if equal
+
+
+  compareTo(a) {
+    let r = this.s - a.s;
+
+    if (r != 0) {
+      return r;
+    }
+
+    let i = this.t;
+    r = i - a.t;
+
+    if (r != 0) {
+      return this.s < 0 ? -r : r;
+    }
+
+    while (--i >= 0) {
+      if ((r = this[i] - a[i]) != 0) {
+        return r;
+      }
+    }
+
+    return 0;
+  } // (public) return the number of bits in "this"
+
+
+  bitLength() {
+    if (this.t <= 0) {
+      return 0;
+    }
+
+    return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);
+  } // (public) this mod a
+
+
+  mod(a) {
+    const r = nbi();
+    this.abs().divRemTo(a, null, r);
+
+    if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {
+      a.subTo(r, r);
+    }
+
+    return r;
+  } // (public) this^e % m, 0 <= e < 2^32
+
+
+  modPowInt(e, m) {
+    let z;
+
+    if (e < 256 || m.isEven()) {
+      z = new Classic(m);
+    } else {
+      z = new Montgomery(m);
+    }
+
+    return this.exp(e, z);
+  } // (public)
+
+
+  clone() {
+    const r = nbi();
+    this.copyTo(r);
+    return r;
+  } // (public) return value as integer
+
+
+  intValue() {
+    if (this.s < 0) {
+      if (this.t == 1) {
+        return this[0] - this.DV;
+      } else if (this.t == 0) {
+        return -1;
+      }
+    } else if (this.t == 1) {
+      return this[0];
+    } else if (this.t == 0) {
+      return 0;
+    } // assumes 16 < DB < 32
+
+
+    return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0];
+  } // (public) return value as byte
+
+
+  byteValue() {
+    return this.t == 0 ? this.s : this[0] << 24 >> 24;
+  } // (public) return value as short (assumes DB>=16)
+
+
+  shortValue() {
+    return this.t == 0 ? this.s : this[0] << 16 >> 16;
+  } // (public) 0 if this == 0, 1 if this > 0
+
+
+  signum() {
+    if (this.s < 0) {
+      return -1;
+    } else if (this.t <= 0 || this.t == 1 && this[0] <= 0) {
+      return 0;
+    } else {
+      return 1;
+    }
+  } // (public) convert to bigendian byte array
+
+
+  toByteArray() {
+    let i = this.t;
+    const r = [];
+    r[0] = this.s;
+    let p = this.DB - i * this.DB % 8;
+    let d;
+    let k = 0;
+
+    if (i-- > 0) {
+      if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p) {
+        r[k++] = d | this.s << this.DB - p;
+      }
+
+      while (i >= 0) {
+        if (p < 8) {
+          d = (this[i] & (1 << p) - 1) << 8 - p;
+          d |= this[--i] >> (p += this.DB - 8);
+        } else {
+          d = this[i] >> (p -= 8) & 0xff;
+
+          if (p <= 0) {
+            p += this.DB;
+            --i;
+          }
+        }
+
+        if ((d & 0x80) != 0) {
+          d |= -256;
+        }
+
+        if (k == 0 && (this.s & 0x80) != (d & 0x80)) {
+          ++k;
+        }
+
+        if (k > 0 || d != this.s) {
+          r[k++] = d;
+        }
+      }
+    }
+
+    return r;
+  }
+
+  equals(a) {
+    return this.compareTo(a) == 0;
+  }
+
+  min(a) {
+    return this.compareTo(a) < 0 ? this : a;
+  }
+
+  max(a) {
+    return this.compareTo(a) > 0 ? this : a;
+  }
+
+  and(a) {
+    const r = nbi();
+    this.bitwiseTo(a, op_and, r);
+    return r;
+  }
+
+  or(a) {
+    const r = nbi();
+    this.bitwiseTo(a, op_or, r);
+    return r;
+  }
+
+  xor(a) {
+    const r = nbi();
+    this.bitwiseTo(a, op_xor, r);
+    return r;
+  }
+
+  andNot(a) {
+    const r = nbi();
+    this.bitwiseTo(a, op_andnot, r);
+    return r;
+  } // (public) ~this
+
+
+  not() {
+    const r = nbi();
+
+    for (let i = 0; i < this.t; ++i) {
+      r[i] = this.DM & ~this[i];
+    }
+
+    r.t = this.t;
+    r.s = ~this.s;
+    return r;
+  } // (public) this << n
+
+
+  shiftLeft(n) {
+    const r = nbi();
+
+    if (n < 0) {
+      this.rShiftTo(-n, r);
+    } else {
+      this.lShiftTo(n, r);
+    }
+
+    return r;
+  } // (public) this >> n
+
+
+  shiftRight(n) {
+    const r = nbi();
+
+    if (n < 0) {
+      this.lShiftTo(-n, r);
+    } else {
+      this.rShiftTo(n, r);
+    }
+
+    return r;
+  } // (public) returns index of lowest 1-bit (or -1 if none)
+
+
+  getLowestSetBit() {
+    for (let i = 0; i < this.t; ++i) {
+      if (this[i] != 0) {
+        return i * this.DB + lbit(this[i]);
+      }
+    }
+
+    if (this.s < 0) {
+      return this.t * this.DB;
+    }
+
+    return -1;
+  } // (public) return number of set bits
+
+
+  bitCount() {
+    let r = 0;
+    const x = this.s & this.DM;
+
+    for (let i = 0; i < this.t; ++i) {
+      r += cbit(this[i] ^ x);
+    }
+
+    return r;
+  } // (public) true iff nth bit is set
+
+
+  testBit(n) {
+    const j = Math.floor(n / this.DB);
+
+    if (j >= this.t) {
+      return this.s != 0;
+    }
+
+    return (this[j] & 1 << n % this.DB) != 0;
+  } // (public) this | (1<<n)
+
+
+  setBit(n) {
+    return this.changeBit(n, op_or);
+  } // (public) this & ~(1<<n)
+
+
+  clearBit(n) {
+    return this.changeBit(n, op_andnot);
+  } // (public) this ^ (1<<n)
+
+
+  flipBit(n) {
+    return this.changeBit(n, op_xor);
+  } // (public) this + a
+
+
+  add(a) {
+    const r = nbi();
+    this.addTo(a, r);
+    return r;
+  } // (public) this - a
+
+
+  subtract(a) {
+    const r = nbi();
+    this.subTo(a, r);
+    return r;
+  } // (public) this * a
+
+
+  multiply(a) {
+    const r = nbi();
+    this.multiplyTo(a, r);
+    return r;
+  } // (public) this / a
+
+
+  divide(a) {
+    const r = nbi();
+    this.divRemTo(a, r, null);
+    return r;
+  } // (public) this % a
+
+
+  remainder(a) {
+    const r = nbi();
+    this.divRemTo(a, null, r);
+    return r;
+  } // (public) [this/a,this%a]
+
+
+  divideAndRemainder(a) {
+    const q = nbi();
+    const r = nbi();
+    this.divRemTo(a, q, r);
+    return [q, r];
+  } // (public) this^e % m (HAC 14.85)
+
+
+  modPow(e, m) {
+    let i = e.bitLength();
+    let k;
+    let r = nbv(1);
+    let z;
+
+    if (i <= 0) {
+      return r;
+    } else if (i < 18) {
+      k = 1;
+    } else if (i < 48) {
+      k = 3;
+    } else if (i < 144) {
+      k = 4;
+    } else if (i < 768) {
+      k = 5;
+    } else {
+      k = 6;
+    }
+
+    if (i < 8) {
+      z = new Classic(m);
+    } else if (m.isEven()) {
+      z = new Barrett(m);
+    } else {
+      z = new Montgomery(m);
+    } // precomputation
+
+
+    const g = [];
+    let n = 3;
+    const k1 = k - 1;
+    const km = (1 << k) - 1;
+    g[1] = z.convert(this);
+
+    if (k > 1) {
+      const g2 = nbi();
+      z.sqrTo(g[1], g2);
+
+      while (n <= km) {
+        g[n] = nbi();
+        z.mulTo(g2, g[n - 2], g[n]);
+        n += 2;
+      }
+    }
+
+    let j = e.t - 1;
+    let w;
+    let is1 = true;
+    let r2 = nbi();
+    let t;
+    i = nbits(e[j]) - 1;
+
+    while (j >= 0) {
+      if (i >= k1) {
+        w = e[j] >> i - k1 & km;
+      } else {
+        w = (e[j] & (1 << i + 1) - 1) << k1 - i;
+
+        if (j > 0) {
+          w |= e[j - 1] >> this.DB + i - k1;
+        }
+      }
+
+      n = k;
+
+      while ((w & 1) == 0) {
+        w >>= 1;
+        --n;
+      }
+
+      if ((i -= n) < 0) {
+        i += this.DB;
+        --j;
+      }
+
+      if (is1) {
+        // ret == 1, don't bother squaring or multiplying it
+        g[w].copyTo(r);
+        is1 = false;
+      } else {
+        while (n > 1) {
+          z.sqrTo(r, r2);
+          z.sqrTo(r2, r);
+          n -= 2;
+        }
+
+        if (n > 0) {
+          z.sqrTo(r, r2);
+        } else {
+          t = r;
+          r = r2;
+          r2 = t;
+        }
+
+        z.mulTo(r2, g[w], r);
+      }
+
+      while (j >= 0 && (e[j] & 1 << i) == 0) {
+        z.sqrTo(r, r2);
+        t = r;
+        r = r2;
+        r2 = t;
+
+        if (--i < 0) {
+          i = this.DB - 1;
+          --j;
+        }
+      }
+    }
+
+    return z.revert(r);
+  } // (public) 1/this % m (HAC 14.61)
+
+
+  modInverse(m) {
+    const ac = m.isEven();
+
+    if (this.isEven() && ac || m.signum() == 0) {
+      return BigInteger.ZERO;
+    }
+
+    const u = m.clone();
+    const v = this.clone();
+    const a = nbv(1);
+    const b = nbv(0);
+    const c = nbv(0);
+    const d = nbv(1);
+
+    while (u.signum() != 0) {
+      while (u.isEven()) {
+        u.rShiftTo(1, u);
+
+        if (ac) {
+          if (!a.isEven() || !b.isEven()) {
+            a.addTo(this, a);
+            b.subTo(m, b);
+          }
+
+          a.rShiftTo(1, a);
+        } else if (!b.isEven()) {
+          b.subTo(m, b);
+        }
+
+        b.rShiftTo(1, b);
+      }
+
+      while (v.isEven()) {
+        v.rShiftTo(1, v);
+
+        if (ac) {
+          if (!c.isEven() || !d.isEven()) {
+            c.addTo(this, c);
+            d.subTo(m, d);
+          }
+
+          c.rShiftTo(1, c);
+        } else if (!d.isEven()) {
+          d.subTo(m, d);
+        }
+
+        d.rShiftTo(1, d);
+      }
+
+      if (u.compareTo(v) >= 0) {
+        u.subTo(v, u);
+
+        if (ac) {
+          a.subTo(c, a);
+        }
+
+        b.subTo(d, b);
+      } else {
+        v.subTo(u, v);
+
+        if (ac) {
+          c.subTo(a, c);
+        }
+
+        d.subTo(b, d);
+      }
+    }
+
+    if (v.compareTo(BigInteger.ONE) != 0) {
+      return BigInteger.ZERO;
+    }
+
+    if (d.compareTo(m) >= 0) {
+      return d.subtract(m);
+    }
+
+    if (d.signum() < 0) {
+      d.addTo(m, d);
+    } else {
+      return d;
+    }
+
+    if (d.signum() < 0) {
+      return d.add(m);
+    } else {
+      return d;
+    }
+  } // (public) this^e
+
+
+  pow(e) {
+    return this.exp(e, new NullExp());
+  } // (public) gcd(this,a) (HAC 14.54)
+
+
+  gcd(a) {
+    let x = this.s < 0 ? this.negate() : this.clone();
+    let y = a.s < 0 ? a.negate() : a.clone();
+
+    if (x.compareTo(y) < 0) {
+      const t = x;
+      x = y;
+      y = t;
+    }
+
+    let i = x.getLowestSetBit();
+    let g = y.getLowestSetBit();
+
+    if (g < 0) {
+      return x;
+    }
+
+    if (i < g) {
+      g = i;
+    }
+
+    if (g > 0) {
+      x.rShiftTo(g, x);
+      y.rShiftTo(g, y);
+    }
+
+    while (x.signum() > 0) {
+      if ((i = x.getLowestSetBit()) > 0) {
+        x.rShiftTo(i, x);
+      }
+
+      if ((i = y.getLowestSetBit()) > 0) {
+        y.rShiftTo(i, y);
+      }
+
+      if (x.compareTo(y) >= 0) {
+        x.subTo(y, x);
+        x.rShiftTo(1, x);
+      } else {
+        y.subTo(x, y);
+        y.rShiftTo(1, y);
+      }
+    }
+
+    if (g > 0) {
+      y.lShiftTo(g, y);
+    }
+
+    return y;
+  } // (public) test primality with certainty >= 1-.5^t
+
+
+  isProbablePrime(t) {
+    let i;
+    const x = this.abs();
+
+    if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {
+      for (i = 0; i < lowprimes.length; ++i) {
+        if (x[0] == lowprimes[i]) {
+          return true;
+        }
+      }
+
+      return false;
+    }
+
+    if (x.isEven()) {
+      return false;
+    }
+
+    i = 1;
+
+    while (i < lowprimes.length) {
+      let m = lowprimes[i];
+      let j = i + 1;
+
+      while (j < lowprimes.length && m < lplim) {
+        m *= lowprimes[j++];
+      }
+
+      m = x.modInt(m);
+
+      while (i < j) {
+        if (m % lowprimes[i++] == 0) {
+          return false;
+        }
+      }
+    }
+
+    return x.millerRabin(t);
+  } //#endregion PUBLIC
+  //#region PROTECTED
+  // (protected) copy this to r
+
+
+  copyTo(r) {
+    for (let i = this.t - 1; i >= 0; --i) {
+      r[i] = this[i];
+    }
+
+    r.t = this.t;
+    r.s = this.s;
+  } // (protected) set from integer value x, -DV <= x < DV
+
+
+  fromInt(x) {
+    this.t = 1;
+    this.s = x < 0 ? -1 : 0;
+
+    if (x > 0) {
+      this[0] = x;
+    } else if (x < -1) {
+      this[0] = x + this.DV;
+    } else {
+      this.t = 0;
+    }
+  } // (protected) set from string and radix
+
+
+  fromString(s, b) {
+    let k;
+
+    if (b == 16) {
+      k = 4;
+    } else if (b == 8) {
+      k = 3;
+    } else if (b == 256) {
+      k = 8;
+      /* byte array */
+    } else if (b == 2) {
+      k = 1;
+    } else if (b == 32) {
+      k = 5;
+    } else if (b == 4) {
+      k = 2;
+    } else {
+      this.fromRadix(s, b);
+      return;
+    }
+
+    this.t = 0;
+    this.s = 0;
+    let i = s.length;
+    let mi = false;
+    let sh = 0;
+
+    while (--i >= 0) {
+      const x = k == 8 ? +s[i] & 0xff : intAt(s, i);
+
+      if (x < 0) {
+        if (s.charAt(i) == '-') {
+          mi = true;
+        }
+
+        continue;
+      }
+
+      mi = false;
+
+      if (sh == 0) {
+        this[this.t++] = x;
+      } else if (sh + k > this.DB) {
+        this[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh;
+        this[this.t++] = x >> this.DB - sh;
+      } else {
+        this[this.t - 1] |= x << sh;
+      }
+
+      sh += k;
+
+      if (sh >= this.DB) {
+        sh -= this.DB;
+      }
+    }
+
+    if (k == 8 && (+s[0] & 0x80) != 0) {
+      this.s = -1;
+
+      if (sh > 0) {
+        this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;
+      }
+    }
+
+    this.clamp();
+
+    if (mi) {
+      BigInteger.ZERO.subTo(this, this);
+    }
+  } // (protected) clamp off excess high words
+
+
+  clamp() {
+    const c = this.s & this.DM;
+
+    while (this.t > 0 && this[this.t - 1] == c) {
+      --this.t;
+    }
+  } // (protected) r = this << n*DB
+
+
+  dlShiftTo(n, r) {
+    let i;
+
+    for (i = this.t - 1; i >= 0; --i) {
+      r[i + n] = this[i];
+    }
+
+    for (i = n - 1; i >= 0; --i) {
+      r[i] = 0;
+    }
+
+    r.t = this.t + n;
+    r.s = this.s;
+  } // (protected) r = this >> n*DB
+
+
+  drShiftTo(n, r) {
+    for (let i = n; i < this.t; ++i) {
+      r[i - n] = this[i];
+    }
+
+    r.t = Math.max(this.t - n, 0);
+    r.s = this.s;
+  } // (protected) r = this << n
+
+
+  lShiftTo(n, r) {
+    const bs = n % this.DB;
+    const cbs = this.DB - bs;
+    const bm = (1 << cbs) - 1;
+    const ds = Math.floor(n / this.DB);
+    let c = this.s << bs & this.DM;
+
+    for (let i = this.t - 1; i >= 0; --i) {
+      r[i + ds + 1] = this[i] >> cbs | c;
+      c = (this[i] & bm) << bs;
+    }
+
+    for (let i = ds - 1; i >= 0; --i) {
+      r[i] = 0;
+    }
+
+    r[ds] = c;
+    r.t = this.t + ds + 1;
+    r.s = this.s;
+    r.clamp();
+  } // (protected) r = this >> n
+
+
+  rShiftTo(n, r) {
+    r.s = this.s;
+    const ds = Math.floor(n / this.DB);
+
+    if (ds >= this.t) {
+      r.t = 0;
+      return;
+    }
+
+    const bs = n % this.DB;
+    const cbs = this.DB - bs;
+    const bm = (1 << bs) - 1;
+    r[0] = this[ds] >> bs;
+
+    for (let i = ds + 1; i < this.t; ++i) {
+      r[i - ds - 1] |= (this[i] & bm) << cbs;
+      r[i - ds] = this[i] >> bs;
+    }
+
+    if (bs > 0) {
+      r[this.t - ds - 1] |= (this.s & bm) << cbs;
+    }
+
+    r.t = this.t - ds;
+    r.clamp();
+  } // (protected) r = this - a
+
+
+  subTo(a, r) {
+    let i = 0;
+    let c = 0;
+    const m = Math.min(a.t, this.t);
+
+    while (i < m) {
+      c += this[i] - a[i];
+      r[i++] = c & this.DM;
+      c >>= this.DB;
+    }
+
+    if (a.t < this.t) {
+      c -= a.s;
+
+      while (i < this.t) {
+        c += this[i];
+        r[i++] = c & this.DM;
+        c >>= this.DB;
+      }
+
+      c += this.s;
+    } else {
+      c += this.s;
+
+      while (i < a.t) {
+        c -= a[i];
+        r[i++] = c & this.DM;
+        c >>= this.DB;
+      }
+
+      c -= a.s;
+    }
+
+    r.s = c < 0 ? -1 : 0;
+
+    if (c < -1) {
+      r[i++] = this.DV + c;
+    } else if (c > 0) {
+      r[i++] = c;
+    }
+
+    r.t = i;
+    r.clamp();
+  } // (protected) r = this * a, r != this,a (HAC 14.12)
+  // "this" should be the larger one if appropriate.
+
+
+  multiplyTo(a, r) {
+    const x = this.abs();
+    const y = a.abs();
+    let i = x.t;
+    r.t = i + y.t;
+
+    while (--i >= 0) {
+      r[i] = 0;
+    }
+
+    for (i = 0; i < y.t; ++i) {
+      r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
+    }
+
+    r.s = 0;
+    r.clamp();
+
+    if (this.s != a.s) {
+      BigInteger.ZERO.subTo(r, r);
+    }
+  } // (protected) r = this^2, r != this (HAC 14.16)
+
+
+  squareTo(r) {
+    const x = this.abs();
+    let i = r.t = 2 * x.t;
+
+    while (--i >= 0) {
+      r[i] = 0;
+    }
+
+    for (i = 0; i < x.t - 1; ++i) {
+      const c = x.am(i, x[i], r, 2 * i, 0, 1);
+
+      if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
+        r[i + x.t] -= x.DV;
+        r[i + x.t + 1] = 1;
+      }
+    }
+
+    if (r.t > 0) {
+      r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
+    }
+
+    r.s = 0;
+    r.clamp();
+  } // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
+  // r != q, this != m.  q or r may be null.
+
+
+  divRemTo(m, q, r) {
+    const pm = m.abs();
+
+    if (pm.t <= 0) {
+      return;
+    }
+
+    const pt = this.abs();
+
+    if (pt.t < pm.t) {
+      if (q != null) {
+        q.fromInt(0);
+      }
+
+      if (r != null) {
+        this.copyTo(r);
+      }
+
+      return;
+    }
+
+    if (r == null) {
+      r = nbi();
+    }
+
+    const y = nbi();
+    const ts = this.s;
+    const ms = m.s;
+    const nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
+
+    if (nsh > 0) {
+      pm.lShiftTo(nsh, y);
+      pt.lShiftTo(nsh, r);
+    } else {
+      pm.copyTo(y);
+      pt.copyTo(r);
+    }
+
+    const ys = y.t;
+    const y0 = y[ys - 1];
+
+    if (y0 == 0) {
+      return;
+    }
+
+    const yt = y0 * (1 << this.F1) + (ys > 1 ? y[ys - 2] >> this.F2 : 0);
+    const d1 = this.FV / yt;
+    const d2 = (1 << this.F1) / yt;
+    const e = 1 << this.F2;
+    let i = r.t;
+    let j = i - ys;
+    const t = q == null ? nbi() : q;
+    y.dlShiftTo(j, t);
+
+    if (r.compareTo(t) >= 0) {
+      r[r.t++] = 1;
+      r.subTo(t, r);
+    }
+
+    BigInteger.ONE.dlShiftTo(ys, t);
+    t.subTo(y, y); // "negative" y so we can replace sub with am later
+
+    while (y.t < ys) {
+      y[y.t++] = 0;
+    }
+
+    while (--j >= 0) {
+      // Estimate quotient digit
+      let qd = r[--i] == y0 ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
+
+      if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) {
+        // Try it out
+        y.dlShiftTo(j, t);
+        r.subTo(t, r);
+
+        while (r[i] < --qd) {
+          r.subTo(t, r);
+        }
+      }
+    }
+
+    if (q != null) {
+      r.drShiftTo(ys, q);
+
+      if (ts != ms) {
+        BigInteger.ZERO.subTo(q, q);
+      }
+    }
+
+    r.t = ys;
+    r.clamp();
+
+    if (nsh > 0) {
+      r.rShiftTo(nsh, r);
+    } // Denormalize remainder
+
+
+    if (ts < 0) {
+      BigInteger.ZERO.subTo(r, r);
+    }
+  } // (protected) return "-1/this % 2^DB"; useful for Mont. reduction
+  // justification:
+  //         xy == 1 (mod m)
+  //         xy =  1+km
+  //   xy(2-xy) = (1+km)(1-km)
+  // x[y(2-xy)] = 1-k^2m^2
+  // x[y(2-xy)] == 1 (mod m^2)
+  // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
+  // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
+  // JS multiply "overflows" differently from C/C++, so care is needed here.
+
+
+  invDigit() {
+    if (this.t < 1) {
+      return 0;
+    }
+
+    const x = this[0];
+
+    if ((x & 1) == 0) {
+      return 0;
+    }
+
+    let y = x & 3; // y == 1/x mod 2^2
+
+    y = y * (2 - (x & 0xf) * y) & 0xf; // y == 1/x mod 2^4
+
+    y = y * (2 - (x & 0xff) * y) & 0xff; // y == 1/x mod 2^8
+
+    y = y * (2 - ((x & 0xffff) * y & 0xffff)) & 0xffff; // y == 1/x mod 2^16
+    // last step - calculate inverse mod DV directly;
+    // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
+
+    y = y * (2 - x * y % this.DV) % this.DV; // y == 1/x mod 2^dbits
+    // we really want the negative inverse, and -DV < y < DV
+
+    return y > 0 ? this.DV - y : -y;
+  } // (protected) true iff this is even
+
+
+  isEven() {
+    return (this.t > 0 ? this[0] & 1 : this.s) == 0;
+  } // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
+
+
+  exp(e, z) {
+    if (e > 0xffffffff || e < 1) {
+      return BigInteger.ONE;
+    }
+
+    let r = nbi();
+    let r2 = nbi();
+    const g = z.convert(this);
+    let i = nbits(e) - 1;
+    g.copyTo(r);
+
+    while (--i >= 0) {
+      z.sqrTo(r, r2);
+
+      if ((e & 1 << i) > 0) {
+        z.mulTo(r2, g, r);
+      } else {
+        const t = r;
+        r = r2;
+        r2 = t;
+      }
+    }
+
+    return z.revert(r);
+  } // (protected) return x s.t. r^x < DV
+
+
+  chunkSize(r) {
+    return Math.floor(Math.LN2 * this.DB / Math.log(r));
+  } // (protected) convert to radix string
+
+
+  toRadix(b) {
+    if (b == null) {
+      b = 10;
+    }
+
+    if (this.signum() == 0 || b < 2 || b > 36) {
+      return '0';
+    }
+
+    const cs = this.chunkSize(b);
+    const a = Math.pow(b, cs);
+    const d = nbv(a);
+    const y = nbi();
+    const z = nbi();
+    let r = '';
+    this.divRemTo(d, y, z);
+
+    while (y.signum() > 0) {
+      r = (a + z.intValue()).toString(b).substr(1) + r;
+      y.divRemTo(d, y, z);
+    }
+
+    return z.intValue().toString(b) + r;
+  } // (protected) convert from radix string
+
+
+  fromRadix(s, b) {
+    this.fromInt(0);
+
+    if (b == null) {
+      b = 10;
+    }
+
+    const cs = this.chunkSize(b);
+    const d = Math.pow(b, cs);
+    let mi = false;
+    let j = 0;
+    let w = 0;
+
+    for (let i = 0; i < s.length; ++i) {
+      const x = intAt(s, i);
+
+      if (x < 0) {
+        if (s.charAt(i) == '-' && this.signum() == 0) {
+          mi = true;
+        }
+
+        continue;
+      }
+
+      w = b * w + x;
+
+      if (++j >= cs) {
+        this.dMultiply(d);
+        this.dAddOffset(w, 0);
+        j = 0;
+        w = 0;
+      }
+    }
+
+    if (j > 0) {
+      this.dMultiply(Math.pow(b, j));
+      this.dAddOffset(w, 0);
+    }
+
+    if (mi) {
+      BigInteger.ZERO.subTo(this, this);
+    }
+  } // (protected) alternate constructor
+
+
+  fromNumber(a, b, c) {
+    if ('number' == typeof b) {
+      // new BigInteger(int,int,RNG)
+      if (a < 2) {
+        this.fromInt(1);
+      } else {
+        if (typeof c !== 'undefined') {
+          this.fromNumber(a, c);
+        }
+
+        if (!this.testBit(a - 1)) {
+          // force MSB set
+          this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
+        }
+
+        if (this.isEven()) {
+          this.dAddOffset(1, 0);
+        } // force odd
+
+
+        while (!this.isProbablePrime(b)) {
+          this.dAddOffset(2, 0);
+
+          if (this.bitLength() > a) {
+            this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
+          }
+        }
+      }
+    } else {
+      // new BigInteger(int,RNG)
+      const x = [];
+      const t = a & 7;
+      x.length = (a >> 3) + 1;
+      b.nextBytes(x);
+
+      if (t > 0) {
+        x[0] &= (1 << t) - 1;
+      } else {
+        x[0] = 0;
+      }
+
+      this.fromString(x, 256);
+    }
+  } // (protected) r = this op a (bitwise)
+
+
+  bitwiseTo(a, op, r) {
+    let i;
+    let f;
+    const m = Math.min(a.t, this.t);
+
+    for (i = 0; i < m; ++i) {
+      r[i] = op(this[i], a[i]);
+    }
+
+    if (a.t < this.t) {
+      f = a.s & this.DM;
+
+      for (i = m; i < this.t; ++i) {
+        r[i] = op(this[i], f);
+      }
+
+      r.t = this.t;
+    } else {
+      f = this.s & this.DM;
+
+      for (i = m; i < a.t; ++i) {
+        r[i] = op(f, a[i]);
+      }
+
+      r.t = a.t;
+    }
+
+    r.s = op(this.s, a.s);
+    r.clamp();
+  } // (protected) this op (1<<n)
+
+
+  changeBit(n, op) {
+    const r = BigInteger.ONE.shiftLeft(n);
+    this.bitwiseTo(r, op, r);
+    return r;
+  } // (protected) r = this + a
+
+
+  addTo(a, r) {
+    let i = 0;
+    let c = 0;
+    const m = Math.min(a.t, this.t);
+
+    while (i < m) {
+      c += this[i] + a[i];
+      r[i++] = c & this.DM;
+      c >>= this.DB;
+    }
+
+    if (a.t < this.t) {
+      c += a.s;
+
+      while (i < this.t) {
+        c += this[i];
+        r[i++] = c & this.DM;
+        c >>= this.DB;
+      }
+
+      c += this.s;
+    } else {
+      c += this.s;
+
+      while (i < a.t) {
+        c += a[i];
+        r[i++] = c & this.DM;
+        c >>= this.DB;
+      }
+
+      c += a.s;
+    }
+
+    r.s = c < 0 ? -1 : 0;
+
+    if (c > 0) {
+      r[i++] = c;
+    } else if (c < -1) {
+      r[i++] = this.DV + c;
+    }
+
+    r.t = i;
+    r.clamp();
+  } // (protected) this *= n, this >= 0, 1 < n < DV
+
+
+  dMultiply(n) {
+    this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);
+    ++this.t;
+    this.clamp();
+  } // (protected) this += n << w words, this >= 0
+
+
+  dAddOffset(n, w) {
+    if (n == 0) {
+      return;
+    }
+
+    while (this.t <= w) {
+      this[this.t++] = 0;
+    }
+
+    this[w] += n;
+
+    while (this[w] >= this.DV) {
+      this[w] -= this.DV;
+
+      if (++w >= this.t) {
+        this[this.t++] = 0;
+      }
+
+      ++this[w];
+    }
+  } // (protected) r = lower n words of "this * a", a.t <= n
+  // "this" should be the larger one if appropriate.
+
+
+  multiplyLowerTo(a, n, r) {
+    let i = Math.min(this.t + a.t, n);
+    r.s = 0; // assumes a,this >= 0
+
+    r.t = i;
+
+    while (i > 0) {
+      r[--i] = 0;
+    }
+
+    for (const j = r.t - this.t; i < j; ++i) {
+      r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
+    }
+
+    for (const j = Math.min(a.t, n); i < j; ++i) {
+      this.am(0, a[i], r, i, 0, n - i);
+    }
+
+    r.clamp();
+  } // (protected) r = "this * a" without lower n words, n > 0
+  // "this" should be the larger one if appropriate.
+
+
+  multiplyUpperTo(a, n, r) {
+    --n;
+    let i = r.t = this.t + a.t - n;
+    r.s = 0; // assumes a,this >= 0
+
+    while (--i >= 0) {
+      r[i] = 0;
+    }
+
+    for (i = Math.max(n - this.t, 0); i < a.t; ++i) {
+      r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
+    }
+
+    r.clamp();
+    r.drShiftTo(1, r);
+  } // (protected) this % n, n < 2^26
+
+
+  modInt(n) {
+    if (n <= 0) {
+      return 0;
+    }
+
+    const d = this.DV % n;
+    let r = this.s < 0 ? n - 1 : 0;
+
+    if (this.t > 0) {
+      if (d == 0) {
+        r = this[0] % n;
+      } else {
+        for (let i = this.t - 1; i >= 0; --i) {
+          r = (d * r + this[i]) % n;
+        }
+      }
+    }
+
+    return r;
+  } // (protected) true if probably prime (HAC 4.24, Miller-Rabin)
+
+
+  millerRabin(t) {
+    const n1 = this.subtract(BigInteger.ONE);
+    const k = n1.getLowestSetBit();
+
+    if (k <= 0) {
+      return false;
+    }
+
+    const r = n1.shiftRight(k);
+    t = t + 1 >> 1;
+
+    if (t > lowprimes.length) {
+      t = lowprimes.length;
+    }
+
+    const a = nbi();
+
+    for (let i = 0; i < t; ++i) {
+      // Pick bases at random, instead of starting at 2
+      a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
+      let y = a.modPow(r, this);
+
+      if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
+        let j = 1;
+
+        while (j++ < k && y.compareTo(n1) != 0) {
+          y = y.modPowInt(2, this);
+
+          if (y.compareTo(BigInteger.ONE) == 0) {
+            return false;
+          }
+        }
+
+        if (y.compareTo(n1) != 0) {
+          return false;
+        }
+      }
+    }
+
+    return true;
+  } // (public) this^2
+
+
+  square() {
+    const r = nbi();
+    this.squareTo(r);
+    return r;
+  } //#region ASYNC
+  // Public API method
+
+
+  gcda(a, callback) {
+    let x = this.s < 0 ? this.negate() : this.clone();
+    let y = a.s < 0 ? a.negate() : a.clone();
+
+    if (x.compareTo(y) < 0) {
+      const t = x;
+      x = y;
+      y = t;
+    }
+
+    let i = x.getLowestSetBit();
+    let g = y.getLowestSetBit();
+
+    if (g < 0) {
+      callback(x);
+      return;
+    }
+
+    if (i < g) {
+      g = i;
+    }
+
+    if (g > 0) {
+      x.rShiftTo(g, x);
+      y.rShiftTo(g, y);
+    } // Workhorse of the algorithm, gets called 200 - 800 times per 512 bit keygen.
+
+
+    const gcda1 = function gcda1() {
+      if ((i = x.getLowestSetBit()) > 0) {
+        x.rShiftTo(i, x);
+      }
+
+      if ((i = y.getLowestSetBit()) > 0) {
+        y.rShiftTo(i, y);
+      }
+
+      if (x.compareTo(y) >= 0) {
+        x.subTo(y, x);
+        x.rShiftTo(1, x);
+      } else {
+        y.subTo(x, y);
+        y.rShiftTo(1, y);
+      }
+
+      if (!(x.signum() > 0)) {
+        if (g > 0) {
+          y.lShiftTo(g, y);
+        }
+
+        setTimeout(function () {
+          callback(y);
+        }, 0); // escape
+      } else {
+        setTimeout(gcda1, 0);
+      }
+    };
+
+    setTimeout(gcda1, 10);
+  } // (protected) alternate constructor
+
+
+  fromNumberAsync(a, b, c, callback) {
+    if ('number' == typeof b) {
+      if (a < 2) {
+        this.fromInt(1);
+      } else {
+        this.fromNumber(a, c);
+
+        if (!this.testBit(a - 1)) {
+          this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
+        }
+
+        if (this.isEven()) {
+          this.dAddOffset(1, 0);
+        }
+
+        const bnpfn1 = () => {
+          this.dAddOffset(2, 0);
+
+          if (this.bitLength() > a) {
+            this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
+          }
+
+          if (this.isProbablePrime(b)) {
+            setTimeout(function () {
+              callback();
+            }, 0); // escape
+          } else {
+            setTimeout(bnpfn1, 0);
+          }
+        };
+
+        setTimeout(bnpfn1, 0);
+      }
+    } else {
+      const x = [];
+      const t = a & 7;
+      x.length = (a >> 3) + 1;
+      b.nextBytes(x);
+
+      if (t > 0) {
+        x[0] &= (1 << t) - 1;
+      } else {
+        x[0] = 0;
+      }
+
+      this.fromString(x, 256);
+    }
+  }
+
+  am(i, x, w, j, c, n) {
+    if (isIE) {
+      // am2 avoids a big mult-and-extract completely.
+      // Max digit bits should be <= 30 because we do bitwise ops
+      // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
+      const xl = x & 0x7fff;
+      const xh = x >> 15;
+
+      while (--n >= 0) {
+        let l = this[i] & 0x7fff;
+        const h = this[i++] >> 15;
+        const m = xh * l + h * xl;
+        l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);
+        c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);
+        w[j++] = l & 0x3fffffff;
+      }
+
+      return c;
+    } else if (isNetscapeOrWx) {
+      // am1: use a single mult and divide to get the high bits,
+      // max digit bits should be 26 because
+      // max internal value = 2*dvalue^2-2*dvalue (< 2^53)
+      while (--n >= 0) {
+        const v = x * this[i++] + w[j] + c;
+        c = Math.floor(v / 0x4000000);
+        w[j++] = v & 0x3ffffff;
+      }
+
+      return c;
+    } else {
+      // Mozilla/Netscape seems to prefer am3
+      // Alternately, set max digit bits to 28 since some
+      // browsers slow down when dealing with 32-bit numbers.
+      const xl = x & 0x3fff;
+      const xh = x >> 14;
+
+      while (--n >= 0) {
+        let l = this[i] & 0x3fff;
+        const h = this[i++] >> 14;
+        const m = xh * l + h * xl;
+        l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;
+        c = (l >> 28) + (m >> 14) + xh * h;
+        w[j++] = l & 0xfffffff;
+      }
+
+      return c;
+    }
+  }
+
+} //#region REDUCERS
+//#region NullExp
+
+class NullExp {
+  // NullExp.prototype.convert = nNop;
+  convert(x) {
+    return x;
+  } // NullExp.prototype.revert = nNop;
+
+
+  revert(x) {
+    return x;
+  } // NullExp.prototype.mulTo = nMulTo;
+
+
+  mulTo(x, y, r) {
+    x.multiplyTo(y, r);
+  } // NullExp.prototype.sqrTo = nSqrTo;
+
+
+  sqrTo(x, r) {
+    x.squareTo(r);
+  }
+
+} // Modular reduction using "classic" algorithm
+
+
+class Classic {
+  constructor(m) {
+    this.m = m;
+  } // Classic.prototype.convert = cConvert;
+
+
+  convert(x) {
+    if (x.s < 0 || x.compareTo(this.m) >= 0) {
+      return x.mod(this.m);
+    } else {
+      return x;
+    }
+  } // Classic.prototype.revert = cRevert;
+
+
+  revert(x) {
+    return x;
+  } // Classic.prototype.reduce = cReduce;
+
+
+  reduce(x) {
+    x.divRemTo(this.m, null, x);
+  } // Classic.prototype.mulTo = cMulTo;
+
+
+  mulTo(x, y, r) {
+    x.multiplyTo(y, r);
+    this.reduce(r);
+  } // Classic.prototype.sqrTo = cSqrTo;
+
+
+  sqrTo(x, r) {
+    x.squareTo(r);
+    this.reduce(r);
+  }
+
+} //#endregion
+//#region Montgomery
+// Montgomery reduction
+
+
+class Montgomery {
+  constructor(m) {
+    this.m = m;
+    this.mp = m.invDigit();
+    this.mpl = this.mp & 0x7fff;
+    this.mph = this.mp >> 15;
+    this.um = (1 << m.DB - 15) - 1;
+    this.mt2 = 2 * m.t;
+  } // Montgomery.prototype.convert = montConvert;
+  // xR mod m
+
+
+  convert(x) {
+    const r = nbi();
+    x.abs().dlShiftTo(this.m.t, r);
+    r.divRemTo(this.m, null, r);
+
+    if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {
+      this.m.subTo(r, r);
+    }
+
+    return r;
+  } // Montgomery.prototype.revert = montRevert;
+  // x/R mod m
+
+
+  revert(x) {
+    const r = nbi();
+    x.copyTo(r);
+    this.reduce(r);
+    return r;
+  } // Montgomery.prototype.reduce = montReduce;
+  // x = x/R mod m (HAC 14.32)
+
+
+  reduce(x) {
+    while (x.t <= this.mt2) {
+      // pad x so am has enough room later
+      x[x.t++] = 0;
+    }
+
+    for (let i = 0; i < this.m.t; ++i) {
+      // faster way of calculating u0 = x[i]*mp mod DV
+      let j = x[i] & 0x7fff;
+      const u0 = j * this.mpl + ((j * this.mph + (x[i] >> 15) * this.mpl & this.um) << 15) & x.DM; // use am to combine the multiply-shift-add into one call
+
+      j = i + this.m.t;
+      x[j] += this.m.am(0, u0, x, i, 0, this.m.t); // propagate carry
+
+      while (x[j] >= x.DV) {
+        x[j] -= x.DV;
+        x[++j]++;
+      }
+    }
+
+    x.clamp();
+    x.drShiftTo(this.m.t, x);
+
+    if (x.compareTo(this.m) >= 0) {
+      x.subTo(this.m, x);
+    }
+  } // Montgomery.prototype.mulTo = montMulTo;
+  // r = "xy/R mod m"; x,y != r
+
+
+  mulTo(x, y, r) {
+    x.multiplyTo(y, r);
+    this.reduce(r);
+  } // Montgomery.prototype.sqrTo = montSqrTo;
+  // r = "x^2/R mod m"; x != r
+
+
+  sqrTo(x, r) {
+    x.squareTo(r);
+    this.reduce(r);
+  }
+
+} //#endregion Montgomery
+//#region Barrett
+// Barrett modular reduction
+
+
+class Barrett {
+  constructor(m) {
+    this.m = m; // setup Barrett
+
+    this.r2 = nbi();
+    this.q3 = nbi();
+    BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);
+    this.mu = this.r2.divide(m);
+  } // Barrett.prototype.convert = barrettConvert;
+
+
+  convert(x) {
+    if (x.s < 0 || x.t > 2 * this.m.t) {
+      return x.mod(this.m);
+    } else if (x.compareTo(this.m) < 0) {
+      return x;
+    } else {
+      const r = nbi();
+      x.copyTo(r);
+      this.reduce(r);
+      return r;
+    }
+  } // Barrett.prototype.revert = barrettRevert;
+
+
+  revert(x) {
+    return x;
+  } // Barrett.prototype.reduce = barrettReduce;
+  // x = x mod m (HAC 14.42)
+
+
+  reduce(x) {
+    x.drShiftTo(this.m.t - 1, this.r2);
+
+    if (x.t > this.m.t + 1) {
+      x.t = this.m.t + 1;
+      x.clamp();
+    }
+
+    this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
+    this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
+
+    while (x.compareTo(this.r2) < 0) {
+      x.dAddOffset(1, this.m.t + 1);
+    }
+
+    x.subTo(this.r2, x);
+
+    while (x.compareTo(this.m) >= 0) {
+      x.subTo(this.m, x);
+    }
+  } // Barrett.prototype.mulTo = barrettMulTo;
+  // r = x*y mod m; x,y != r
+
+
+  mulTo(x, y, r) {
+    x.multiplyTo(y, r);
+    this.reduce(r);
+  } // Barrett.prototype.sqrTo = barrettSqrTo;
+  // r = x^2 mod m; x != r
+
+
+  sqrTo(x, r) {
+    x.squareTo(r);
+    this.reduce(r);
+  }
+
+} //#endregion
+//#endregion REDUCERS
+// return new, unset BigInteger
+
+
+function nbi() {
+  return new BigInteger(null);
+}
+function parseBigInt(str, r) {
+  return new BigInteger(str, r);
+} // Digit conversions
+
+const BI_RC = [];
+let rr;
+let vv;
+rr = '0'.charCodeAt(0);
+
+for (vv = 0; vv <= 9; ++vv) {
+  BI_RC[rr++] = vv;
+}
+
+rr = 'a'.charCodeAt(0);
+
+for (vv = 10; vv < 36; ++vv) {
+  BI_RC[rr++] = vv;
+}
+
+rr = 'A'.charCodeAt(0);
+
+for (vv = 10; vv < 36; ++vv) {
+  BI_RC[rr++] = vv;
+}
+
+function intAt(s, i) {
+  const c = BI_RC[s.charCodeAt(i)];
+  return c == null ? -1 : c;
+} // return bigint initialized to value
+
+function nbv(i) {
+  const r = nbi();
+  r.fromInt(i);
+  return r;
+} // returns bit length of the integer x
+
+function nbits(x) {
+  let r = 1;
+  let t;
+
+  if ((t = x >>> 16) != 0) {
+    x = t;
+    r += 16;
+  }
+
+  if ((t = x >> 8) != 0) {
+    x = t;
+    r += 8;
+  }
+
+  if ((t = x >> 4) != 0) {
+    x = t;
+    r += 4;
+  }
+
+  if ((t = x >> 2) != 0) {
+    x = t;
+    r += 2;
+  }
+
+  if ((t = x >> 1) != 0) {
+    x = t;
+    r += 1;
+  }
+
+  return r;
+} // "constants"
+
+BigInteger.ZERO = nbv(0);
+BigInteger.ONE = nbv(1);
+
+// prng4.js - uses Arcfour as a PRNG
+class Arcfour {
+  constructor() {
+    this.i = 0;
+    this.j = 0;
+    this.S = [];
+  } // Arcfour.prototype.init = ARC4init;
+  // Initialize arcfour context from key, an array of ints, each from [0..255]
+
+
+  init(key) {
+    let i;
+    let j;
+    let t;
+
+    for (i = 0; i < 256; ++i) {
+      this.S[i] = i;
+    }
+
+    j = 0;
+
+    for (i = 0; i < 256; ++i) {
+      j = j + this.S[i] + key[i % key.length] & 255;
+      t = this.S[i];
+      this.S[i] = this.S[j];
+      this.S[j] = t;
+    }
+
+    this.i = 0;
+    this.j = 0;
+  } // Arcfour.prototype.next = ARC4next;
+
+
+  next() {
+    this.i = this.i + 1 & 255;
+    this.j = this.j + this.S[this.i] & 255;
+    const t = this.S[this.i];
+    this.S[this.i] = this.S[this.j];
+    this.S[this.j] = t;
+    return this.S[t + this.S[this.i] & 255];
+  }
+
+} // Plug in your RNG constructor here
+
+function prng_newstate() {
+  return new Arcfour();
+} // Pool size must be a multiple of 4 and greater than 32.
+// An array of bytes the size of the pool will be passed to init()
+
+const rng_psize = 256;
+
+// Random number generator - requires a PRNG backend, e.g. prng4.js
+let rng_state;
+let rng_pool = [];
+let rng_pptr; // Initialize the pool with junk if needed.
+
+if (rng_pool == null) {
+  rng_pool = [];
+  rng_pptr = 0;
+}
+
+function rng_get_byte() {
+  if (rng_state == null) {
+    rng_state = prng_newstate(); // At this point, we may not have collected enough entropy.  If not, fall back to Math.random
+
+    while (rng_pptr < rng_psize) {
+      const random = Math.floor(65536 * Math.random());
+      rng_pool[rng_pptr++] = random & 255;
+    }
+
+    rng_state.init(rng_pool);
+
+    for (rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr) {
+      rng_pool[rng_pptr] = 0;
+    }
+
+    rng_pptr = 0;
+  } // TODO: allow reseeding after first request
+
+
+  return rng_state.next();
+}
+
+class SecureRandom {
+  nextBytes(ba) {
+    for (let i = 0; i < ba.length; ++i) {
+      ba[i] = rng_get_byte();
+    }
+  }
+
+}
+
+// Depends on jsbn.js and rng.js
+
+function pkcs1pad2(s, n) {
+  if (n < s.length + 11) {
+    // TODO: fix for utf-8
+    console.error('Message too long for RSA');
+    return null;
+  }
+
+  const ba = [];
+  let i = s.length - 1;
+
+  while (i >= 0 && n > 0) {
+    const c = s.charCodeAt(i--);
+
+    if (c < 128) {
+      // encode using utf-8
+      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;
+  const rng = new SecureRandom();
+  const x = [];
+
+  while (n > 2) {
+    // random non-zero pad
+    x[0] = 0;
+
+    while (x[0] == 0) {
+      rng.nextBytes(x);
+    }
+
+    ba[--n] = x[0];
+  }
+
+  ba[--n] = 2;
+  ba[--n] = 0;
+  return new BigInteger(ba);
+} // "empty" RSA key constructor
+
+
+class RSAKey {
+  constructor() {
+    this.e = 0;
+  } //#region PROTECTED
+  // protected
+  // RSAKey.prototype.doPublic = RSADoPublic;
+  // Perform raw public operation on "x": return x^e (mod n)
+
+
+  doPublic(x) {
+    if (this.n) {
+      return x.modPowInt(this.e, this.n);
+    }
+
+    return null;
+  } //#endregion PROTECTED
+  //#region PUBLIC
+  // RSAKey.prototype.setPublic = RSASetPublic;
+  // Set the public key fields N and e from hex strings
+
+
+  setPublic(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');
+    }
+  } // RSAKey.prototype.encrypt = RSAEncrypt;
+  // Return the PKCS#1 RSA encryption of "text" as an even-length hex string
+
+
+  encrypt(text) {
+    if (!this.n) {
+      return null;
+    }
+
+    const maxLength = this.n.bitLength() + 7 >> 3;
+    const m = pkcs1pad2(text, maxLength);
+
+    if (m == null) {
+      return null;
+    }
+
+    const c = this.doPublic(m);
+
+    if (c == null) {
+      return null;
+    }
+
+    let h = c.toString(16);
+    const length = h.length; // fix zero before result
+
+    for (let i = 0; i < maxLength * 2 - length; i++) {
+      h = '0' + h;
+    }
+
+    return h;
+  } // RSAKey.prototype.generate = RSAGenerate;
+  // Generate a new random private key B bits long, using public expt E
+
+
+  generate(B, E) {
+    const rng = new SecureRandom();
+    const qs = B >> 1;
+    this.e = parseInt(E, 16);
+    const 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) {
+        const t = this.p;
+        this.p = this.q;
+        this.q = t;
+      }
+
+      const p1 = this.p.subtract(BigInteger.ONE);
+      const q1 = this.q.subtract(BigInteger.ONE);
+      const 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;
+      }
+    }
+  } // Generate a new random private key B bits long, using public expt E
+
+
+  generateAsync(B, E, callback) {
+    const rng = new SecureRandom();
+    const qs = B >> 1;
+    this.e = parseInt(E, 16);
+    const ee = new BigInteger(E, 16); // These functions have non-descript names because they were originally for(;;) loops.
+    // I don't know about cryptography to give them better names than loop1-4.
+
+    const loop1 = () => {
+      const loop4 = () => {
+        if (this.p.compareTo(this.q) <= 0) {
+          const t = this.p;
+          this.p = this.q;
+          this.q = t;
+        }
+
+        const p1 = this.p.subtract(BigInteger.ONE);
+        const q1 = this.q.subtract(BigInteger.ONE);
+        const 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);
+          setTimeout(function () {
+            callback();
+          }, 0); // escape
+        } else {
+          setTimeout(loop1, 0);
+        }
+      };
+
+      const loop3 = () => {
+        this.q = nbi();
+        this.q.fromNumberAsync(qs, 1, rng, () => {
+          this.q.subtract(BigInteger.ONE).gcda(ee, r => {
+            if (r.compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) {
+              setTimeout(loop4, 0);
+            } else {
+              setTimeout(loop3, 0);
+            }
+          });
+        });
+      };
+
+      const loop2 = () => {
+        this.p = nbi();
+        this.p.fromNumberAsync(B - qs, 1, rng, () => {
+          this.p.subtract(BigInteger.ONE).gcda(ee, r => {
+            if (r.compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) {
+              setTimeout(loop3, 0);
+            } else {
+              setTimeout(loop2, 0);
+            }
+          });
+        });
+      };
+
+      setTimeout(loop2, 0);
+    };
+
+    setTimeout(loop1, 0);
+  }
+
+}
+
+/**
+ * Create a new JSEncryptRSAKey that extends Tom Wu's RSA key object.
+ * This object is just a decorator for parsing the key parameter
+ * @param {string|Object} key - The key in string format, or an object containing
+ * the parameters needed to build a RSAKey object.
+ * @constructor
+ */
+
+class JSEncryptRSAKey extends RSAKey {
+  constructor(key) {
+    super(); // Call the super constructor.
+    //  RSAKey.call(this);
+    // If a key key was provided.
+
+    if (key) {
+      // If this is a string...
+      if (typeof key === 'string') {
+        this.parseKey(key);
+      } else if (JSEncryptRSAKey.hasPublicKeyProperty(key)) {
+        // Set the values for the key.
+        this.parsePropertiesFrom(key);
+      }
+    }
+  }
+  /**
+   * Method to parse a pem encoded string containing both a public or private key.
+   * The method will translate the pem encoded string in a der encoded string and
+   * will parse private key and public key parameters. This method accepts public key
+   * in the rsaencryption pkcs #1 format (oid: 1.2.840.113549.1.1.1).
+   *
+   * @todo Check how many rsa formats use the same format of pkcs #1.
+   *
+   * The format is defined as:
+   * PublicKeyInfo ::= SEQUENCE {
+   *   algorithm       AlgorithmIdentifier,
+   *   PublicKey       BIT STRING
+   * }
+   * Where AlgorithmIdentifier is:
+   * AlgorithmIdentifier ::= SEQUENCE {
+   *   algorithm       OBJECT IDENTIFIER,     the OID of the enc algorithm
+   *   parameters      ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)
+   * }
+   * and PublicKey is a SEQUENCE encapsulated in a BIT STRING
+   * RSAPublicKey ::= SEQUENCE {
+   *   modulus           INTEGER,  -- n
+   *   publicExponent    INTEGER   -- e
+   * }
+   * it's possible to examine the structure of the keys obtained from openssl using
+   * an asn.1 dumper as the one used here to parse the components: http://lapo.it/asn1js/
+   * @argument {string} pem the pem encoded string, can include the BEGIN/END header/footer
+   * @private
+   */
+
+
+  parseKey(pem) {
+    try {
+      let modulus = 0;
+      let public_exponent = 0;
+      const reHex = /^\s*(?:[0-9A-Fa-f][0-9A-Fa-f]\s*)+$/;
+      const der = reHex.test(pem) ? Hex.decode(pem) : Base64.unarmor(pem);
+      let asn1 = ASN1.decode(der); // Fixes a bug with OpenSSL 1.0+ private keys
+
+      if (asn1.sub && asn1.sub.length === 3) {
+        if (asn1.sub[2].sub) {
+          asn1 = asn1.sub[2].sub[0];
+        }
+      }
+
+      if (asn1.sub && asn1.sub.length === 9) {
+        // Parse the private key.
+        modulus = asn1.sub[1].getHexStringValue(); // bigint
+
+        this.n = parseBigInt(modulus, 16);
+        public_exponent = asn1.sub[2].getHexStringValue(); // int
+
+        this.e = parseInt(public_exponent, 16);
+        const private_exponent = asn1.sub[3].getHexStringValue(); // bigint
+
+        this.d = parseBigInt(private_exponent, 16);
+        const prime1 = asn1.sub[4].getHexStringValue(); // bigint
+
+        this.p = parseBigInt(prime1, 16);
+        const prime2 = asn1.sub[5].getHexStringValue(); // bigint
+
+        this.q = parseBigInt(prime2, 16);
+        const exponent1 = asn1.sub[6].getHexStringValue(); // bigint
+
+        this.dmp1 = parseBigInt(exponent1, 16);
+        const exponent2 = asn1.sub[7].getHexStringValue(); // bigint
+
+        this.dmq1 = parseBigInt(exponent2, 16);
+        const coefficient = asn1.sub[8].getHexStringValue(); // bigint
+
+        this.coeff = parseBigInt(coefficient, 16);
+      } else if (asn1.sub && asn1.sub.length === 2) {
+        // Parse the public key.
+        const bit_string = asn1.sub[1];
+
+        if (bit_string.sub) {
+          const sequence = bit_string.sub[0];
+
+          if (sequence.sub) {
+            modulus = sequence.sub[0].getHexStringValue();
+            this.n = parseBigInt(modulus, 16);
+            public_exponent = sequence.sub[1].getHexStringValue();
+            this.e = parseInt(public_exponent, 16);
+          } else {
+            return false;
+          }
+        } else {
+          return false;
+        }
+      } else {
+        return false;
+      }
+
+      return true;
+    } catch (ex) {
+      return false;
+    }
+  }
+  /**
+   * Check if the object contains the necessary parameters to populate the rsa modulus
+   * and public exponent parameters.
+   * @param {Object} [obj={}] - An object that may contain the two public key
+   * parameters
+   * @returns {boolean} true if the object contains both the modulus and the public exponent
+   * properties (n and e)
+   * @todo check for types of n and e. N should be a parseable bigInt object, E should
+   * be a parseable integer number
+   * @private
+   */
+
+
+  static hasPublicKeyProperty(obj) {
+    obj = obj || {}; // eslint-disable-next-line no-prototype-builtins
+
+    return obj.hasOwnProperty('n') && obj.hasOwnProperty('e');
+  }
+  /**
+   * Parse the properties of obj in the current rsa object. Obj should AT LEAST
+   * include the modulus and public exponent (n, e) parameters.
+   * @param {Object} obj - the object containing rsa parameters
+   * @private
+   */
+
+
+  parsePropertiesFrom(obj) {
+    this.n = obj.n;
+    this.e = obj.e; // eslint-disable-next-line no-prototype-builtins
+
+    if (obj.hasOwnProperty('d')) {
+      this.d = obj.d;
+      this.p = obj.p;
+      this.q = obj.q;
+      this.dmp1 = obj.dmp1;
+      this.dmq1 = obj.dmq1;
+      this.coeff = obj.coeff;
+    }
+  }
+
+}
+
+/**
+ *
+ * @param {Object} [options = {}] - An object to customize JSEncrypt behaviour
+ * possible parameters are:
+ * - default_key_size        {number}  default: 1024 the key size in bit
+ * - default_public_exponent {string}  default: '010001' the hexadecimal representation of the public exponent
+ * - log                     {boolean} default: false whether log warn/error or not
+ * @constructor
+ */
+
+class JSEncrypt {
+  constructor(options = {}) {
+    options = options || {};
+    this.default_key_size = options.default_key_size ? parseInt(options.default_key_size, 10) : 1024;
+    this.default_public_exponent = options.default_public_exponent || '010001'; // 65537 default openssl public exponent for rsa key type
+
+    this.log = options.log || false;
+  }
+  /**
+   * Method to set the rsa key parameter (one method is enough to set both the public
+   * and the private key, since the private key contains the public key paramenters)
+   * Log a warning if logs are enabled
+   * @param {Object|string} key the pem encoded string or an object (with or without header/footer)
+   * @public
+   */
+
+
+  setKey(key) {
+    if (this.log && this.key) {
+      console.warn('A key was already set, overriding existing.');
+    }
+
+    this.key = new JSEncryptRSAKey(key);
+  }
+  /**
+   * Proxy method for setKey, for api compatibility
+   * @see setKey
+   * @public
+   */
+
+
+  setPublicKey(pubkey) {
+    // Sets the public key.
+    this.setKey(pubkey);
+  }
+  /**
+   * Proxy method for RSAKey object's encrypt, encrypt the string using the public
+   * components of the rsa key object. Note that if the object was not set will be created
+   * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor
+   * @param {string} str the string to encrypt
+   * @return {string} the encrypted string encoded in base64
+   * @public
+   */
+
+
+  encrypt(str) {
+    // Return the encrypted string.
+    try {
+      const text = this.getKey().encrypt(str);
+
+      if (typeof text === 'string') {
+        return hex2b64(text);
+      }
+    } catch (ex) {//
+    }
+
+    return '';
+  }
+  /**
+   * Getter for the current JSEncryptRSAKey object. If it doesn't exists a new object
+   * will be created and returned
+   * @param {callback} [cb] the callback to be called if we want the key to be generated
+   * in an async fashion
+   * @returns {JSEncryptRSAKey} the JSEncryptRSAKey object
+   * @public
+   */
+
+
+  getKey(cb) {
+    // Only create new if it does not exist.
+    if (!this.key) {
+      // Get a new private key.
+      this.key = new JSEncryptRSAKey();
+
+      if (cb && {}.toString.call(cb) === '[object Function]') {
+        this.key.generateAsync(this.default_key_size, this.default_public_exponent, cb);
+        return this.key;
+      } // Generate the key.
+
+
+      this.key.generate(this.default_key_size, this.default_public_exponent);
+    }
+
+    return this.key;
+  }
+
+}
+
+exports.JSEncrypt = JSEncrypt;
+exports["default"] = JSEncrypt;