module-develop-kit 0.5.10 → 0.5.11

package/dist/vendor/sm-crypto/src/sm2/asn1.js

@@ -0,0 +1,86 @@
+import { __require as R } from "../../../jsbn/index.js";
+var c, f;
+function m() {
+  if (f) return c;
+  f = 1;
+  const { BigInteger: i } = R();
+  function d(e) {
+    let t = e.toString(16);
+    if (t[0] !== "-")
+      t.length % 2 === 1 ? t = "0" + t : t.match(/^[0-7]/) || (t = "00" + t);
+    else {
+      t = t.substr(1);
+      let n = t.length;
+      n % 2 === 1 ? n += 1 : t.match(/^[0-7]/) || (n += 2);
+      let s = "";
+      for (let r = 0; r < n; r++) s += "f";
+      s = new i(s, 16), t = s.xor(e).add(i.ONE), t = t.toString(16).replace(/^-/, "");
+    }
+    return t;
+  }
+  class l {
+    constructor() {
+      this.tlv = null, this.t = "00", this.l = "00", this.v = "";
+    }
+    /**
+     * 获取 der 编码比特流16进制串
+     */
+    getEncodedHex() {
+      return this.tlv || (this.v = this.getValue(), this.l = this.getLength(), this.tlv = this.t + this.l + this.v), this.tlv;
+    }
+    getLength() {
+      const t = this.v.length / 2;
+      let n = t.toString(16);
+      return n.length % 2 === 1 && (n = "0" + n), t < 128 ? n : (128 + n.length / 2).toString(16) + n;
+    }
+    getValue() {
+      return "";
+    }
+  }
+  class u extends l {
+    constructor(t) {
+      super(), this.t = "02", t && (this.v = d(t));
+    }
+    getValue() {
+      return this.v;
+    }
+  }
+  class v extends l {
+    constructor(t) {
+      super(), this.t = "30", this.asn1Array = t;
+    }
+    getValue() {
+      return this.v = this.asn1Array.map((t) => t.getEncodedHex()).join(""), this.v;
+    }
+  }
+  function h(e, t) {
+    return +e[t + 2] < 8 ? 1 : +e.substr(t + 2, 2) & 128;
+  }
+  function g(e, t) {
+    const n = h(e, t), s = e.substr(t + 2, n * 2);
+    return s ? (+s[0] < 8 ? new i(s, 16) : new i(s.substr(2), 16)).intValue() : -1;
+  }
+  function o(e, t) {
+    const n = h(e, t);
+    return t + (n + 1) * 2;
+  }
+  return c = {
+    /**
+     * ASN.1 der 编码，针对 sm2 签名
+     */
+    encodeDer(e, t) {
+      const n = new u(e), s = new u(t);
+      return new v([n, s]).getEncodedHex();
+    },
+    /**
+     * 解析 ASN.1 der，针对 sm2 验签
+     */
+    decodeDer(e) {
+      const t = o(e, 0), n = o(e, t), s = g(e, t), r = e.substr(n, s * 2), a = n + r.length, S = o(e, a), x = g(e, a), b = e.substr(S, x * 2), q = new i(r, 16), w = new i(b, 16);
+      return { r: q, s: w };
+    }
+  }, c;
+}
+export {
+  m as __require
+};

package/dist/vendor/sm-crypto/src/sm2/ec.js

@@ -0,0 +1,205 @@
+import { __require as H } from "../../../jsbn/index.js";
+var I, z;
+function k() {
+  if (z) return I;
+  z = 1;
+  const { BigInteger: n } = H(), w = new n("2"), B = new n("3");
+  class c {
+    constructor(t, s) {
+      this.x = s, this.q = t;
+    }
+    /**
+     * 判断相等
+     */
+    equals(t) {
+      return t === this ? !0 : this.q.equals(t.q) && this.x.equals(t.x);
+    }
+    /**
+     * 返回具体数值
+     */
+    toBigInteger() {
+      return this.x;
+    }
+    /**
+     * 取反
+     */
+    negate() {
+      return new c(this.q, this.x.negate().mod(this.q));
+    }
+    /**
+     * 相加
+     */
+    add(t) {
+      return new c(this.q, this.x.add(t.toBigInteger()).mod(this.q));
+    }
+    /**
+     * 相减
+     */
+    subtract(t) {
+      return new c(this.q, this.x.subtract(t.toBigInteger()).mod(this.q));
+    }
+    /**
+     * 相乘
+     */
+    multiply(t) {
+      return new c(this.q, this.x.multiply(t.toBigInteger()).mod(this.q));
+    }
+    /**
+     * 相除
+     */
+    divide(t) {
+      return new c(this.q, this.x.multiply(t.toBigInteger().modInverse(this.q)).mod(this.q));
+    }
+    /**
+     * 平方
+     */
+    square() {
+      return new c(this.q, this.x.square().mod(this.q));
+    }
+  }
+  class l {
+    constructor(t, s, e, i) {
+      this.curve = t, this.x = s, this.y = e, this.z = i ?? n.ONE, this.zinv = null;
+    }
+    getX() {
+      return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
+    }
+    getY() {
+      return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.y.toBigInteger().multiply(this.zinv).mod(this.curve.q));
+    }
+    /**
+     * 判断相等
+     */
+    equals(t) {
+      return t === this ? !0 : this.isInfinity() ? t.isInfinity() : t.isInfinity() ? this.isInfinity() : t.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(t.z)).mod(this.curve.q).equals(n.ZERO) ? t.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(t.z)).mod(this.curve.q).equals(n.ZERO) : !1;
+    }
+    /**
+     * 是否是无穷远点
+     */
+    isInfinity() {
+      return this.x === null && this.y === null ? !0 : this.z.equals(n.ZERO) && !this.y.toBigInteger().equals(n.ZERO);
+    }
+    /**
+     * 取反，x 轴对称点
+     */
+    negate() {
+      return new l(this.curve, this.x, this.y.negate(), this.z);
+    }
+    /**
+     * 相加
+     *
+     * 标准射影坐标系：
+     *
+     * λ1 = x1 * z2
+     * λ2 = x2 * z1
+     * λ3 = λ1 − λ2
+     * λ4 = y1 * z2
+     * λ5 = y2 * z1
+     * λ6 = λ4 − λ5
+     * λ7 = λ1 + λ2
+     * λ8 = z1 * z2
+     * λ9 = λ3^2
+     * λ10 = λ3 * λ9
+     * λ11 = λ8 * λ6^2 − λ7 * λ9
+     * x3 = λ3 * λ11
+     * y3 = λ6 * (λ9 * λ1 − λ11) − λ4 * λ10
+     * z3 = λ10 * λ8
+     */
+    add(t) {
+      if (this.isInfinity()) return t;
+      if (t.isInfinity()) return this;
+      const s = this.x.toBigInteger(), e = this.y.toBigInteger(), i = this.z, u = t.x.toBigInteger(), o = t.y.toBigInteger(), h = t.z, r = this.curve.q, m = s.multiply(h).mod(r), a = u.multiply(i).mod(r), g = m.subtract(a), q = e.multiply(h).mod(r), f = o.multiply(i).mod(r), y = q.subtract(f);
+      if (n.ZERO.equals(g))
+        return n.ZERO.equals(y) ? this.twice() : this.curve.infinity;
+      const O = m.add(a), v = i.multiply(h).mod(r), d = g.square().mod(r), p = g.multiply(d).mod(r), x = v.multiply(y.square()).subtract(O.multiply(d)).mod(r), R = g.multiply(x).mod(r), Z = y.multiply(d.multiply(m).subtract(x)).subtract(q.multiply(p)).mod(r), L = p.multiply(v).mod(r);
+      return new l(this.curve, this.curve.fromBigInteger(R), this.curve.fromBigInteger(Z), L);
+    }
+    /**
+     * 自加
+     *
+     * 标准射影坐标系：
+     *
+     * λ1 = 3 * x1^2 + a * z1^2
+     * λ2 = 2 * y1 * z1
+     * λ3 = y1^2
+     * λ4 = λ3 * x1 * z1
+     * λ5 = λ2^2
+     * λ6 = λ1^2 − 8 * λ4
+     * x3 = λ2 * λ6
+     * y3 = λ1 * (4 * λ4 − λ6) − 2 * λ5 * λ3
+     * z3 = λ2 * λ5
+     */
+    twice() {
+      if (this.isInfinity()) return this;
+      if (!this.y.toBigInteger().signum()) return this.curve.infinity;
+      const t = this.x.toBigInteger(), s = this.y.toBigInteger(), e = this.z, i = this.curve.q, u = this.curve.a.toBigInteger(), o = t.square().multiply(B).add(u.multiply(e.square())).mod(i), h = s.shiftLeft(1).multiply(e).mod(i), r = s.square().mod(i), m = r.multiply(t).multiply(e).mod(i), a = h.square().mod(i), g = o.square().subtract(m.shiftLeft(3)).mod(i), q = h.multiply(g).mod(i), f = o.multiply(m.shiftLeft(2).subtract(g)).subtract(a.shiftLeft(1).multiply(r)).mod(i), y = h.multiply(a).mod(i);
+      return new l(this.curve, this.curve.fromBigInteger(q), this.curve.fromBigInteger(f), y);
+    }
+    /**
+     * 倍点计算
+     */
+    multiply(t) {
+      if (this.isInfinity()) return this;
+      if (!t.signum()) return this.curve.infinity;
+      const s = t.multiply(B), e = this.negate();
+      let i = this;
+      for (let u = s.bitLength() - 2; u > 0; u--) {
+        i = i.twice();
+        const o = s.testBit(u), h = t.testBit(u);
+        o !== h && (i = i.add(o ? this : e));
+      }
+      return i;
+    }
+  }
+  class b {
+    constructor(t, s, e) {
+      this.q = t, this.a = this.fromBigInteger(s), this.b = this.fromBigInteger(e), this.infinity = new l(this, null, null);
+    }
+    /**
+     * 判断两个椭圆曲线是否相等
+     */
+    equals(t) {
+      return t === this ? !0 : this.q.equals(t.q) && this.a.equals(t.a) && this.b.equals(t.b);
+    }
+    /**
+     * 生成椭圆曲线域元素
+     */
+    fromBigInteger(t) {
+      return new c(this.q, t);
+    }
+    /**
+     * 解析 16 进制串为椭圆曲线点
+     */
+    decodePointHex(t) {
+      switch (parseInt(t.substr(0, 2), 16)) {
+        // 第一个字节
+        case 0:
+          return this.infinity;
+        case 2:
+        case 3:
+          const s = this.fromBigInteger(new n(t.substr(2), 16));
+          let e = this.fromBigInteger(s.multiply(s.square()).add(
+            s.multiply(this.a)
+          ).add(this.b).toBigInteger().modPow(
+            this.q.divide(new n("4")).add(n.ONE),
+            this.q
+          ));
+          return e.toBigInteger().mod(w).equals(new n(t.substr(0, 2), 16).subtract(w)) || (e = e.negate()), new l(this, s, e);
+        case 4:
+        case 6:
+        case 7:
+          const i = (t.length - 2) / 2, u = t.substr(2, i), o = t.substr(i + 2, i);
+          return new l(this, this.fromBigInteger(new n(u, 16)), this.fromBigInteger(new n(o, 16)));
+        default:
+          return null;
+      }
+    }
+  }
+  return I = {
+    ECPointFp: l,
+    ECCurveFp: b
+  }, I;
+}
+export {
+  k as __require
+};

package/dist/vendor/sm-crypto/src/sm2/index.js

@@ -0,0 +1,114 @@
+import { __require as O } from "../../../jsbn/index.js";
+import { __require as Y } from "./asn1.js";
+import { __require as z } from "./utils.js";
+import { __require as G } from "./sm3.js";
+var q, v;
+function J() {
+  if (v) return q;
+  v = 1;
+  const { BigInteger: u } = O(), { encodeDer: _, decodeDer: S } = Y(), e = z(), H = G().sm3, { G: P, curve: B, n: m } = e.generateEcparam(), R = 0;
+  function k(t, r, n = 1) {
+    t = typeof t == "string" ? e.hexToArray(e.utf8ToHex(t)) : Array.prototype.slice.call(t), r = e.getGlobalCurve().decodePointHex(r);
+    const g = e.generateKeyPairHex(), y = new u(g.privateKey, 16);
+    let i = g.publicKey;
+    i.length > 128 && (i = i.substr(i.length - 128));
+    const l = r.multiply(y), f = e.hexToArray(e.leftPad(l.getX().toBigInteger().toRadix(16), 64)), a = e.hexToArray(e.leftPad(l.getY().toBigInteger().toRadix(16), 64)), x = e.arrayToHex(H([].concat(f, t, a)));
+    let s = 1, o = 0, c = [];
+    const d = [].concat(f, a), h = () => {
+      c = H([...d, s >> 24 & 255, s >> 16 & 255, s >> 8 & 255, s & 255]), s++, o = 0;
+    };
+    h();
+    for (let p = 0, b = t.length; p < b; p++)
+      o === c.length && h(), t[p] ^= c[o++] & 255;
+    const T = e.arrayToHex(t);
+    return n === R ? i + T + x : i + x + T;
+  }
+  function C(t, r, n = 1, {
+    output: g = "string"
+  } = {}) {
+    r = new u(r, 16);
+    let y = t.substr(128, 64), i = t.substr(192);
+    n === R && (y = t.substr(t.length - 64), i = t.substr(128, t.length - 128 - 64));
+    const l = e.hexToArray(i), a = e.getGlobalCurve().decodePointHex("04" + t.substr(0, 128)).multiply(r), x = e.hexToArray(e.leftPad(a.getX().toBigInteger().toRadix(16), 64)), s = e.hexToArray(e.leftPad(a.getY().toBigInteger().toRadix(16), 64));
+    let o = 1, c = 0, d = [];
+    const h = [].concat(x, s), T = () => {
+      d = H([...h, o >> 24 & 255, o >> 16 & 255, o >> 8 & 255, o & 255]), o++, c = 0;
+    };
+    T();
+    for (let b = 0, K = l.length; b < K; b++)
+      c === d.length && T(), l[b] ^= d[c++] & 255;
+    return e.arrayToHex(H([].concat(x, l, s))) === y.toLowerCase() ? g === "array" ? l : e.arrayToUtf8(l) : g === "array" ? [] : "";
+  }
+  function X(t, r, {
+    pointPool: n,
+    der: g,
+    hash: y,
+    publicKey: i,
+    userId: l
+  } = {}) {
+    let f = typeof t == "string" ? e.utf8ToHex(t) : e.arrayToHex(t);
+    y && (i = i || I(r), f = A(f, i, l));
+    const a = new u(r, 16), x = new u(f, 16);
+    let s = null, o = null, c = null;
+    do {
+      do {
+        let d;
+        n && n.length ? d = n.pop() : d = w(), s = d.k, o = x.add(d.x1).mod(m);
+      } while (o.equals(u.ZERO) || o.add(s).equals(m));
+      c = a.add(u.ONE).modInverse(m).multiply(s.subtract(o.multiply(a))).mod(m);
+    } while (c.equals(u.ZERO));
+    return g ? _(o, c) : e.leftPad(o.toString(16), 64) + e.leftPad(c.toString(16), 64);
+  }
+  function E(t, r, n, { der: g, hash: y, userId: i } = {}) {
+    let l = typeof t == "string" ? e.utf8ToHex(t) : e.arrayToHex(t);
+    y && (l = A(l, n, i));
+    let f, a;
+    if (g) {
+      const h = S(r);
+      f = h.r, a = h.s;
+    } else
+      f = new u(r.substring(0, 64), 16), a = new u(r.substring(64), 16);
+    const x = B.decodePointHex(n), s = new u(l, 16), o = f.add(a).mod(m);
+    if (o.equals(u.ZERO)) return !1;
+    const c = P.multiply(a).add(x.multiply(o)), d = s.add(c.getX().toBigInteger()).mod(m);
+    return f.equals(d);
+  }
+  function A(t, r, n = "1234567812345678") {
+    n = e.utf8ToHex(n);
+    const g = e.leftPad(P.curve.a.toBigInteger().toRadix(16), 64), y = e.leftPad(P.curve.b.toBigInteger().toRadix(16), 64), i = e.leftPad(P.getX().toBigInteger().toRadix(16), 64), l = e.leftPad(P.getY().toBigInteger().toRadix(16), 64);
+    let f, a;
+    if (r.length === 128)
+      f = r.substr(0, 64), a = r.substr(64, 64);
+    else {
+      const c = P.curve.decodePointHex(r);
+      f = e.leftPad(c.getX().toBigInteger().toRadix(16), 64), a = e.leftPad(c.getY().toBigInteger().toRadix(16), 64);
+    }
+    const x = e.hexToArray(n + g + y + i + l + f + a), s = n.length * 4;
+    x.unshift(s & 255), x.unshift(s >> 8 & 255);
+    const o = H(x);
+    return e.arrayToHex(H(o.concat(e.hexToArray(t))));
+  }
+  function I(t) {
+    const r = P.multiply(new u(t, 16)), n = e.leftPad(r.getX().toBigInteger().toString(16), 64), g = e.leftPad(r.getY().toBigInteger().toString(16), 64);
+    return "04" + n + g;
+  }
+  function w() {
+    const t = e.generateKeyPairHex(), r = B.decodePointHex(t.publicKey);
+    return t.k = new u(t.privateKey, 16), t.x1 = r.getX().toBigInteger(), t;
+  }
+  return q = {
+    generateKeyPairHex: e.generateKeyPairHex,
+    compressPublicKeyHex: e.compressPublicKeyHex,
+    comparePublicKeyHex: e.comparePublicKeyHex,
+    doEncrypt: k,
+    doDecrypt: C,
+    doSignature: X,
+    doVerifySignature: E,
+    getPublicKeyFromPrivateKey: I,
+    getPoint: w,
+    verifyPublicKey: e.verifyPublicKey
+  }, q;
+}
+export {
+  J as __require
+};

package/dist/vendor/sm-crypto/src/sm2/sm3.js

@@ -0,0 +1,71 @@
+var p, B;
+function M() {
+  if (B) return p;
+  B = 1;
+  const f = new Uint32Array(68), T = new Uint32Array(64);
+  function s(n, e) {
+    const o = e & 31;
+    return n << o | n >>> 32 - o;
+  }
+  function j(n, e) {
+    const o = [];
+    for (let i = n.length - 1; i >= 0; i--) o[i] = (n[i] ^ e[i]) & 255;
+    return o;
+  }
+  function C(n) {
+    return n ^ s(n, 9) ^ s(n, 17);
+  }
+  function E(n) {
+    return n ^ s(n, 15) ^ s(n, 23);
+  }
+  function S(n) {
+    let e = n.length * 8, o = e % 512;
+    o = o >= 448 ? 512 - o % 448 - 1 : 448 - o - 1;
+    const i = new Array((o - 7) / 8), u = new Array(8);
+    for (let r = 0, c = i.length; r < c; r++) i[r] = 0;
+    for (let r = 0, c = u.length; r < c; r++) u[r] = 0;
+    e = e.toString(2);
+    for (let r = 7; r >= 0; r--)
+      if (e.length > 8) {
+        const c = e.length - 8;
+        u[r] = parseInt(e.substr(c), 2), e = e.substr(0, c);
+      } else e.length > 0 && (u[r] = parseInt(e, 2), e = "");
+    const V = new Uint8Array([...n, 128, ...i, ...u]), G = new DataView(V.buffer, 0), H = V.length / 64, l = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
+    for (let r = 0; r < H; r++) {
+      f.fill(0), T.fill(0);
+      const c = 16 * r;
+      for (let t = 0; t < 16; t++)
+        f[t] = G.getUint32((c + t) * 4, !1);
+      for (let t = 16; t < 68; t++)
+        f[t] = E(f[t - 16] ^ f[t - 9] ^ s(f[t - 3], 15)) ^ s(f[t - 13], 7) ^ f[t - 6];
+      for (let t = 0; t < 64; t++)
+        T[t] = f[t] ^ f[t + 4];
+      const x = 2043430169, L = 2055708042;
+      let a = l[0], g = l[1], w = l[2], U = l[3], h = l[4], A = l[5], b = l[6], m = l[7], P, v, D, I, K;
+      for (let t = 0; t < 64; t++)
+        K = t >= 0 && t <= 15 ? x : L, P = s(s(a, 12) + h + s(K, t), 7), v = P ^ s(a, 12), D = (t >= 0 && t <= 15 ? a ^ g ^ w : a & g | a & w | g & w) + U + v + T[t], I = (t >= 0 && t <= 15 ? h ^ A ^ b : h & A | ~h & b) + m + P + f[t], U = w, w = s(g, 9), g = a, a = D, m = b, b = s(A, 19), A = h, h = C(I);
+      l[0] ^= a, l[1] ^= g, l[2] ^= w, l[3] ^= U, l[4] ^= h, l[5] ^= A, l[6] ^= b, l[7] ^= m;
+    }
+    const _ = [];
+    for (let r = 0, c = l.length; r < c; r++) {
+      const x = l[r];
+      _.push((x & 4278190080) >>> 24, (x & 16711680) >>> 16, (x & 65280) >>> 8, x & 255);
+    }
+    return _;
+  }
+  const d = 64, q = new Uint8Array(d), y = new Uint8Array(d);
+  for (let n = 0; n < d; n++)
+    q[n] = 54, y[n] = 92;
+  function F(n, e) {
+    for (e.length > d && (e = S(e)); e.length < d; ) e.push(0);
+    const o = j(e, q), i = j(e, y), u = S([...o, ...n]);
+    return S([...i, ...u]);
+  }
+  return p = {
+    sm3: S,
+    hmac: F
+  }, p;
+}
+export {
+  M as __require
+};

package/dist/vendor/sm-crypto/src/sm2/utils.js

@@ -0,0 +1,95 @@
+import { __require as v } from "../../../jsbn/index.js";
+import { __require as I } from "./ec.js";
+var l, d;
+function _() {
+  if (d) return l;
+  d = 1;
+  const { BigInteger: o, SecureRandom: h } = v(), { ECCurveFp: p } = I(), x = new h(), { curve: s, G: C, n: f } = g();
+  function y() {
+    return s;
+  }
+  function g() {
+    const F = new o("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), e = new o("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), n = new o("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), t = new p(F, e, n), u = t.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"), a = new o("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
+    return { curve: t, G: u, n: a };
+  }
+  function E(F, e, n) {
+    const r = (F ? new o(F, e, n) : new o(f.bitLength(), x)).mod(f.subtract(o.ONE)).add(o.ONE), c = i(r.toString(16), 64), u = C.multiply(r), a = i(u.getX().toBigInteger().toString(16), 64), P = i(u.getY().toBigInteger().toString(16), 64), D = "04" + a + P;
+    return { privateKey: c, publicKey: D };
+  }
+  function w(F) {
+    if (F.length !== 130) throw new Error("Invalid public key to compress");
+    const e = (F.length - 2) / 2, n = F.substr(2, e), t = new o(F.substr(e + 2, e), 16);
+    let r = "03";
+    return t.mod(new o("2")).equals(o.ZERO) && (r = "02"), r + n;
+  }
+  function B(F) {
+    F = unescape(encodeURIComponent(F));
+    const e = F.length, n = [];
+    for (let r = 0; r < e; r++)
+      n[r >>> 2] |= (F.charCodeAt(r) & 255) << 24 - r % 4 * 8;
+    const t = [];
+    for (let r = 0; r < e; r++) {
+      const c = n[r >>> 2] >>> 24 - r % 4 * 8 & 255;
+      t.push((c >>> 4).toString(16)), t.push((c & 15).toString(16));
+    }
+    return t.join("");
+  }
+  function i(F, e) {
+    return F.length >= e ? F : new Array(e - F.length + 1).join("0") + F;
+  }
+  function b(F) {
+    return F.map((e) => (e = e.toString(16), e.length === 1 ? "0" + e : e)).join("");
+  }
+  function m(F) {
+    const e = [];
+    let n = 0;
+    for (let t = 0; t < F.length * 2; t += 2)
+      e[t >>> 3] |= parseInt(F[n], 10) << 24 - t % 8 * 4, n++;
+    try {
+      const t = [];
+      for (let r = 0; r < F.length; r++) {
+        const c = e[r >>> 2] >>> 24 - r % 4 * 8 & 255;
+        t.push(String.fromCharCode(c));
+      }
+      return decodeURIComponent(escape(t.join("")));
+    } catch {
+      throw new Error("Malformed UTF-8 data");
+    }
+  }
+  function A(F) {
+    const e = [];
+    let n = F.length;
+    n % 2 !== 0 && (F = i(F, n + 1)), n = F.length;
+    for (let t = 0; t < n; t += 2)
+      e.push(parseInt(F.substr(t, 2), 16));
+    return e;
+  }
+  function H(F) {
+    const e = s.decodePointHex(F);
+    if (!e) return !1;
+    const n = e.getX();
+    return e.getY().square().equals(n.multiply(n.square()).add(n.multiply(s.a)).add(s.b));
+  }
+  function q(F, e) {
+    const n = s.decodePointHex(F);
+    if (!n) return !1;
+    const t = s.decodePointHex(e);
+    return t ? n.equals(t) : !1;
+  }
+  return l = {
+    getGlobalCurve: y,
+    generateEcparam: g,
+    generateKeyPairHex: E,
+    compressPublicKeyHex: w,
+    utf8ToHex: B,
+    leftPad: i,
+    arrayToHex: b,
+    arrayToUtf8: m,
+    hexToArray: A,
+    verifyPublicKey: H,
+    comparePublicKeyHex: q
+  }, l;
+}
+export {
+  _ as __require
+};

package/dist/vendor/sm-crypto/src/sm3/index.js

@@ -0,0 +1,50 @@
+import { __require as c } from "../sm2/sm3.js";
+var f, u;
+function y() {
+  if (u) return f;
+  u = 1;
+  const { sm3: i, hmac: h } = c();
+  function l(e, r) {
+    return e.length >= r ? e : new Array(r - e.length + 1).join("0") + e;
+  }
+  function s(e) {
+    return e.map((r) => (r = r.toString(16), r.length === 1 ? "0" + r : r)).join("");
+  }
+  function x(e) {
+    const r = [];
+    let t = e.length;
+    t % 2 !== 0 && (e = l(e, t + 1)), t = e.length;
+    for (let o = 0; o < t; o += 2)
+      r.push(parseInt(e.substr(o, 2), 16));
+    return r;
+  }
+  function a(e) {
+    const r = [];
+    for (let t = 0, o = e.length; t < o; t++) {
+      const n = e.codePointAt(t);
+      if (n <= 127)
+        r.push(n);
+      else if (n <= 2047)
+        r.push(192 | n >>> 6), r.push(128 | n & 63);
+      else if (n <= 55295 || n >= 57344 && n <= 65535)
+        r.push(224 | n >>> 12), r.push(128 | n >>> 6 & 63), r.push(128 | n & 63);
+      else if (n >= 65536 && n <= 1114111)
+        t++, r.push(240 | n >>> 18 & 28), r.push(128 | n >>> 12 & 63), r.push(128 | n >>> 6 & 63), r.push(128 | n & 63);
+      else
+        throw r.push(n), new Error("input is not supported");
+    }
+    return r;
+  }
+  return f = function(e, r) {
+    if (e = typeof e == "string" ? a(e) : Array.prototype.slice.call(e), r) {
+      if ((r.mode || "hmac") !== "hmac") throw new Error("invalid mode");
+      let o = r.key;
+      if (!o) throw new Error("invalid key");
+      return o = typeof o == "string" ? x(o) : Array.prototype.slice.call(o), s(h(e, o));
+    }
+    return s(i(e));
+  }, f;
+}
+export {
+  y as __require
+};