SPB Git forge

spb/admin-ka

Public
41commits 1branches 0releases
172.9 MBsize
maindefault branch
19 days agolast push
JavaScript 65.5% Python 17.8% CSS 13% HTML 3.7%
21.1 KB · 312 lines javascript
Raw Blame History
1"use strict";23Object.defineProperty(exports, "__esModule", {4  value: true5});6exports.RSACipher = void 0;7var _base = _interopRequireDefault(require("../base64.js"));8var _bigint = require("./bigint.js");9function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }10function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }11function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator["return"] && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, "catch": function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }12function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }13function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }14function _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function"); }15function _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }16function _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", { writable: !1 }), e; }17function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }18function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }19var RSACipher = exports.RSACipher = /*#__PURE__*/function () {20  function RSACipher() {21    _classCallCheck(this, RSACipher);22    this._keyLength = 0;23    this._keyBytes = 0;24    this._n = null;25    this._e = null;26    this._d = null;27    this._nBigInt = null;28    this._eBigInt = null;29    this._dBigInt = null;30    this._extractable = false;31  }32  return _createClass(RSACipher, [{33    key: "algorithm",34    get: function get() {35      return {36        name: "RSA-PKCS1-v1_5"37      };38    }39  }, {40    key: "_base64urlDecode",41    value: function _base64urlDecode(data) {42      data = data.replace(/-/g, "+").replace(/_/g, "/");43      data = data.padEnd(Math.ceil(data.length / 4) * 4, "=");44      return _base["default"].decode(data);45    }46  }, {47    key: "_padArray",48    value: function _padArray(arr, length) {49      var res = new Uint8Array(length);50      res.set(arr, length - arr.length);51      return res;52    }53  }, {54    key: "_generateKey",55    value: function () {56      var _generateKey2 = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee(algorithm, extractable) {57        var key, privateKey;58        return _regeneratorRuntime().wrap(function _callee$(_context) {59          while (1) switch (_context.prev = _context.next) {60            case 0:61              this._keyLength = algorithm.modulusLength;62              this._keyBytes = Math.ceil(this._keyLength / 8);63              _context.next = 4;64              return window.crypto.subtle.generateKey({65                name: "RSA-OAEP",66                modulusLength: algorithm.modulusLength,67                publicExponent: algorithm.publicExponent,68                hash: {69                  name: "SHA-256"70                }71              }, true, ["encrypt", "decrypt"]);72            case 4:73              key = _context.sent;74              _context.next = 7;75              return window.crypto.subtle.exportKey("jwk", key.privateKey);76            case 7:77              privateKey = _context.sent;78              this._n = this._padArray(this._base64urlDecode(privateKey.n), this._keyBytes);79              this._nBigInt = (0, _bigint.u8ArrayToBigInt)(this._n);80              this._e = this._padArray(this._base64urlDecode(privateKey.e), this._keyBytes);81              this._eBigInt = (0, _bigint.u8ArrayToBigInt)(this._e);82              this._d = this._padArray(this._base64urlDecode(privateKey.d), this._keyBytes);83              this._dBigInt = (0, _bigint.u8ArrayToBigInt)(this._d);84              this._extractable = extractable;85            case 15:86            case "end":87              return _context.stop();88          }89        }, _callee, this);90      }));91      function _generateKey(_x, _x2) {92        return _generateKey2.apply(this, arguments);93      }94      return _generateKey;95    }()96  }, {97    key: "_importKey",98    value: function () {99      var _importKey2 = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee2(key, extractable) {100        var n, e;101        return _regeneratorRuntime().wrap(function _callee2$(_context2) {102          while (1) switch (_context2.prev = _context2.next) {103            case 0:104              n = key.n;105              e = key.e;106              if (!(n.length !== e.length)) {107                _context2.next = 4;108                break;109              }110              throw new Error("the sizes of modulus and public exponent do not match");111            case 4:112              this._keyBytes = n.length;113              this._keyLength = this._keyBytes * 8;114              this._n = new Uint8Array(this._keyBytes);115              this._e = new Uint8Array(this._keyBytes);116              this._n.set(n);117              this._e.set(e);118              this._nBigInt = (0, _bigint.u8ArrayToBigInt)(this._n);119              this._eBigInt = (0, _bigint.u8ArrayToBigInt)(this._e);120              this._extractable = extractable;121            case 13:122            case "end":123              return _context2.stop();124          }125        }, _callee2, this);126      }));127      function _importKey(_x3, _x4) {128        return _importKey2.apply(this, arguments);129      }130      return _importKey;131    }()132  }, {133    key: "encrypt",134    value: function () {135      var _encrypt = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee3(_algorithm, message) {136        var ps, i, em, emBigInt, c;137        return _regeneratorRuntime().wrap(function _callee3$(_context3) {138          while (1) switch (_context3.prev = _context3.next) {139            case 0:140              if (!(message.length > this._keyBytes - 11)) {141                _context3.next = 2;142                break;143              }144              return _context3.abrupt("return", null);145            case 2:146              ps = new Uint8Array(this._keyBytes - message.length - 3);147              window.crypto.getRandomValues(ps);148              for (i = 0; i < ps.length; i++) {149                ps[i] = Math.floor(ps[i] * 254 / 255 + 1);150              }151              em = new Uint8Array(this._keyBytes);152              em[1] = 0x02;153              em.set(ps, 2);154              em.set(message, ps.length + 3);155              emBigInt = (0, _bigint.u8ArrayToBigInt)(em);156              c = (0, _bigint.modPow)(emBigInt, this._eBigInt, this._nBigInt);157              return _context3.abrupt("return", (0, _bigint.bigIntToU8Array)(c, this._keyBytes));158            case 12:159            case "end":160              return _context3.stop();161          }162        }, _callee3, this);163      }));164      function encrypt(_x5, _x6) {165        return _encrypt.apply(this, arguments);166      }167      return encrypt;168    }()169  }, {170    key: "decrypt",171    value: function () {172      var _decrypt = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee4(_algorithm, message) {173        var msgBigInt, emBigInt, em, i;174        return _regeneratorRuntime().wrap(function _callee4$(_context4) {175          while (1) switch (_context4.prev = _context4.next) {176            case 0:177              if (!(message.length !== this._keyBytes)) {178                _context4.next = 2;179                break;180              }181              return _context4.abrupt("return", null);182            case 2:183              msgBigInt = (0, _bigint.u8ArrayToBigInt)(message);184              emBigInt = (0, _bigint.modPow)(msgBigInt, this._dBigInt, this._nBigInt);185              em = (0, _bigint.bigIntToU8Array)(emBigInt, this._keyBytes);186              if (!(em[0] !== 0x00 || em[1] !== 0x02)) {187                _context4.next = 7;188                break;189              }190              return _context4.abrupt("return", null);191            case 7:192              i = 2;193            case 8:194              if (!(i < em.length)) {195                _context4.next = 14;196                break;197              }198              if (!(em[i] === 0x00)) {199                _context4.next = 11;200                break;201              }202              return _context4.abrupt("break", 14);203            case 11:204              i++;205              _context4.next = 8;206              break;207            case 14:208              if (!(i === em.length)) {209                _context4.next = 16;210                break;211              }212              return _context4.abrupt("return", null);213            case 16:214              return _context4.abrupt("return", em.slice(i + 1, em.length));215            case 17:216            case "end":217              return _context4.stop();218          }219        }, _callee4, this);220      }));221      function decrypt(_x7, _x8) {222        return _decrypt.apply(this, arguments);223      }224      return decrypt;225    }()226  }, {227    key: "exportKey",228    value: function () {229      var _exportKey = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee5() {230        return _regeneratorRuntime().wrap(function _callee5$(_context5) {231          while (1) switch (_context5.prev = _context5.next) {232            case 0:233              if (this._extractable) {234                _context5.next = 2;235                break;236              }237              throw new Error("key is not extractable");238            case 2:239              return _context5.abrupt("return", {240                n: this._n,241                e: this._e,242                d: this._d243              });244            case 3:245            case "end":246              return _context5.stop();247          }248        }, _callee5, this);249      }));250      function exportKey() {251        return _exportKey.apply(this, arguments);252      }253      return exportKey;254    }()255  }], [{256    key: "generateKey",257    value: function () {258      var _generateKey3 = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee6(algorithm, extractable, _keyUsages) {259        var cipher;260        return _regeneratorRuntime().wrap(function _callee6$(_context6) {261          while (1) switch (_context6.prev = _context6.next) {262            case 0:263              cipher = new RSACipher();264              _context6.next = 3;265              return cipher._generateKey(algorithm, extractable);266            case 3:267              return _context6.abrupt("return", {268                privateKey: cipher269              });270            case 4:271            case "end":272              return _context6.stop();273          }274        }, _callee6);275      }));276      function generateKey(_x9, _x10, _x11) {277        return _generateKey3.apply(this, arguments);278      }279      return generateKey;280    }()281  }, {282    key: "importKey",283    value: function () {284      var _importKey3 = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee7(key, _algorithm, extractable, keyUsages) {285        var cipher;286        return _regeneratorRuntime().wrap(function _callee7$(_context7) {287          while (1) switch (_context7.prev = _context7.next) {288            case 0:289              if (!(keyUsages.length !== 1 || keyUsages[0] !== "encrypt")) {290                _context7.next = 2;291                break;292              }293              throw new Error("only support importing RSA public key");294            case 2:295              cipher = new RSACipher();296              _context7.next = 5;297              return cipher._importKey(key, extractable);298            case 5:299              return _context7.abrupt("return", cipher);300            case 6:301            case "end":302              return _context7.stop();303          }304        }, _callee7);305      }));306      function importKey(_x12, _x13, _x14, _x15) {307        return _importKey3.apply(this, arguments);308      }309      return importKey;310    }()311  }]);312}();