orion-design 0.1.48 → 0.1.50

package/dist/request/leaf7/smCrypto/sm2/ec.d.ts

@@ -0,0 +1,119 @@
+/**
+ * 椭圆曲线域元素
+ */
+declare class ECFieldElementFp {
+    constructor(q: any, x: any);
+    /**
+     * 判断相等
+     */
+    equals(other: any): any;
+    /**
+     * 返回具体数值
+     */
+    toBigInteger(): any;
+    /**
+     * 取反
+     */
+    negate(): ECFieldElementFp;
+    /**
+     * 相加
+     */
+    add(b: any): ECFieldElementFp;
+    /**
+     * 相减
+     */
+    subtract(b: any): ECFieldElementFp;
+    /**
+     * 相乘
+     */
+    multiply(b: any): ECFieldElementFp;
+    /**
+     * 相除
+     */
+    divide(b: any): ECFieldElementFp;
+    /**
+     * 平方
+     */
+    square(): ECFieldElementFp;
+}
+export declare class ECPointFp {
+    constructor(curve: any, x: any, y: any, z: any);
+    getX(): any;
+    getY(): any;
+    /**
+     * 判断相等
+     */
+    equals(other: any): any;
+    /**
+     * 是否是无穷远点
+     */
+    isInfinity(): any;
+    /**
+     * 取反，x 轴对称点
+     */
+    negate(): ECPointFp;
+    /**
+     * 相加
+     *
+     * 标准射影坐标系：
+     *
+     * λ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(b: any): any;
+    /**
+     * 自加
+     *
+     * 标准射影坐标系：
+     *
+     * λ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(): any;
+    /**
+     * 倍点计算
+     */
+    multiply(k: any): any;
+}
+/**
+ * 椭圆曲线 y^2 = x^3 + ax + b
+ */
+export declare class ECCurveFp {
+    constructor(q: any, a: any, b: any);
+    /**
+     * 判断两个椭圆曲线是否相等
+     */
+    equals(other: any): any;
+    /**
+     * 生成椭圆曲线域元素
+     */
+    fromBigInteger(x: any): ECFieldElementFp;
+    /**
+     * 解析 16 进制串为椭圆曲线点
+     */
+    decodePointHex(s: any): any;
+}
+declare const _default: {
+    ECPointFp: typeof ECPointFp;
+    ECCurveFp: typeof ECCurveFp;
+};
+export default _default;

package/dist/request/leaf7/smCrypto/sm2/ec.js

@@ -0,0 +1,199 @@
+import { j as n } from "../../../../index-BW3nOBfD.js";
+const v = new n.BigInteger("2"), p = new n.BigInteger("3");
+class h {
+  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 h(this.q, this.x.negate().mod(this.q));
+  }
+  /**
+   * 相加
+   */
+  add(t) {
+    return new h(this.q, this.x.add(t.toBigInteger()).mod(this.q));
+  }
+  /**
+   * 相减
+   */
+  subtract(t) {
+    return new h(this.q, this.x.subtract(t.toBigInteger()).mod(this.q));
+  }
+  /**
+   * 相乘
+   */
+  multiply(t) {
+    return new h(this.q, this.x.multiply(t.toBigInteger()).mod(this.q));
+  }
+  /**
+   * 相除
+   */
+  divide(t) {
+    return new h(this.q, this.x.multiply(t.toBigInteger().modInverse(this.q)).mod(this.q));
+  }
+  /**
+   * 平方
+   */
+  square() {
+    return new h(this.q, this.x.square().mod(this.q));
+  }
+}
+class c {
+  constructor(t, s, e, i) {
+    this.curve = t, this.x = s, this.y = e, this.z = i ?? n.BigInteger.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.BigInteger.ZERO) ? t.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(t.z)).mod(this.curve.q).equals(n.BigInteger.ZERO) : !1;
+  }
+  /**
+   * 是否是无穷远点
+   */
+  isInfinity() {
+    return this.x === null && this.y === null ? !0 : this.z.equals(n.BigInteger.ZERO) && !this.y.toBigInteger().equals(n.BigInteger.ZERO);
+  }
+  /**
+   * 取反，x 轴对称点
+   */
+  negate() {
+    return new c(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(), g = t.z, r = this.curve.q, m = s.multiply(g).mod(r), a = u.multiply(i).mod(r), l = m.subtract(a), I = e.multiply(g).mod(r), f = o.multiply(i).mod(r), y = I.subtract(f);
+    if (n.BigInteger.ZERO.equals(l))
+      return n.BigInteger.ZERO.equals(y) ? this.twice() : this.curve.infinity;
+    const x = m.add(a), d = i.multiply(g).mod(r), q = l.square().mod(r), B = l.multiply(q).mod(r), w = d.multiply(y.square()).subtract(x.multiply(q)).mod(r), z = l.multiply(w).mod(r), b = y.multiply(q.multiply(m).subtract(w)).subtract(I.multiply(B)).mod(r), O = B.multiply(d).mod(r);
+    return new c(this.curve, this.curve.fromBigInteger(z), this.curve.fromBigInteger(b), O);
+  }
+  /**
+   * 自加
+   *
+   * 标准射影坐标系：
+   *
+   * λ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(p).add(u.multiply(e.square())).mod(i), g = s.shiftLeft(1).multiply(e).mod(i), r = s.square().mod(i), m = r.multiply(t).multiply(e).mod(i), a = g.square().mod(i), l = o.square().subtract(m.shiftLeft(3)).mod(i), I = g.multiply(l).mod(i), f = o.multiply(m.shiftLeft(2).subtract(l)).subtract(a.shiftLeft(1).multiply(r)).mod(i), y = g.multiply(a).mod(i);
+    return new c(this.curve, this.curve.fromBigInteger(I), this.curve.fromBigInteger(f), y);
+  }
+  /**
+   * 倍点计算
+   */
+  multiply(t) {
+    if (this.isInfinity()) return this;
+    if (!t.signum()) return this.curve.infinity;
+    const s = t.multiply(p), e = this.negate();
+    let i = this;
+    for (let u = s.bitLength() - 2; u > 0; u--) {
+      i = i.twice();
+      const o = s.testBit(u), g = t.testBit(u);
+      o !== g && (i = i.add(o ? this : e));
+    }
+    return i;
+  }
+}
+class R {
+  constructor(t, s, e) {
+    this.q = t, this.a = this.fromBigInteger(s), this.b = this.fromBigInteger(e), this.infinity = new c(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 h(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.BigInteger(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.BigInteger("4")).add(n.BigInteger.ONE), this.q)
+        );
+        return e.toBigInteger().mod(v).equals(new n.BigInteger(t.substr(0, 2), 16).subtract(v)) || (e = e.negate()), new c(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 c(this, this.fromBigInteger(new n.BigInteger(u, 16)), this.fromBigInteger(new n.BigInteger(o, 16)));
+      default:
+        return null;
+    }
+  }
+}
+const H = {
+  ECPointFp: c,
+  ECCurveFp: R
+};
+export {
+  R as ECCurveFp,
+  c as ECPointFp,
+  H as default
+};
+//# sourceMappingURL=ec.js.map

package/dist/request/leaf7/smCrypto/sm2/ec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ec.js","sources":["../../../../../src/request/leaf7/smCrypto/sm2/ec.ts"],"sourcesContent":["import { BigInteger } from 'jsbn'\r\n\r\n/**\r\n * thanks for Tom Wu : http://www-cs-students.stanford.edu/~tjw/jsbn/\r\n *\r\n * Basic Javascript Elliptic Curve implementation\r\n * Ported loosely from BouncyCastle's Java EC code\r\n * Only Fp curves implemented for now\r\n */\r\n\r\nconst TWO = new BigInteger('2')\r\nconst THREE = new BigInteger('3')\r\n\r\n/**\r\n * 椭圆曲线域元素\r\n */\r\nclass ECFieldElementFp {\r\n  constructor(q, x) {\r\n    this.x = x\r\n    this.q = q\r\n    // TODO if (x.compareTo(q) >= 0) error\r\n  }\r\n\r\n  /**\r\n   * 判断相等\r\n   */\r\n  equals(other) {\r\n    if (other === this) return true\r\n    return this.q.equals(other.q) && this.x.equals(other.x)\r\n  }\r\n\r\n  /**\r\n   * 返回具体数值\r\n   */\r\n  toBigInteger() {\r\n    return this.x\r\n  }\r\n\r\n  /**\r\n   * 取反\r\n   */\r\n  negate() {\r\n    return new ECFieldElementFp(this.q, this.x.negate().mod(this.q))\r\n  }\r\n\r\n  /**\r\n   * 相加\r\n   */\r\n  add(b) {\r\n    return new ECFieldElementFp(this.q, this.x.add(b.toBigInteger()).mod(this.q))\r\n  }\r\n\r\n  /**\r\n   * 相减\r\n   */\r\n  subtract(b) {\r\n    return new ECFieldElementFp(this.q, this.x.subtract(b.toBigInteger()).mod(this.q))\r\n  }\r\n\r\n  /**\r\n   * 相乘\r\n   */\r\n  multiply(b) {\r\n    return new ECFieldElementFp(this.q, this.x.multiply(b.toBigInteger()).mod(this.q))\r\n  }\r\n\r\n  /**\r\n   * 相除\r\n   */\r\n  divide(b) {\r\n    return new ECFieldElementFp(this.q, this.x.multiply(b.toBigInteger().modInverse(this.q)).mod(this.q))\r\n  }\r\n\r\n  /**\r\n   * 平方\r\n   */\r\n  square() {\r\n    return new ECFieldElementFp(this.q, this.x.square().mod(this.q))\r\n  }\r\n}\r\n\r\nexport class ECPointFp {\r\n  constructor(curve, x, y, z) {\r\n    this.curve = curve\r\n    this.x = x\r\n    this.y = y\r\n    // 标准射影坐标系：zinv == null 或 z * zinv == 1\r\n    this.z = z == null ? BigInteger.ONE : z\r\n    this.zinv = null\r\n    // TODO: compression flag\r\n  }\r\n\r\n  getX() {\r\n    if (this.zinv === null) this.zinv = this.z.modInverse(this.curve.q)\r\n\r\n    return this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q))\r\n  }\r\n\r\n  getY() {\r\n    if (this.zinv === null) this.zinv = this.z.modInverse(this.curve.q)\r\n\r\n    return this.curve.fromBigInteger(this.y.toBigInteger().multiply(this.zinv).mod(this.curve.q))\r\n  }\r\n\r\n  /**\r\n   * 判断相等\r\n   */\r\n  equals(other) {\r\n    if (other === this) return true\r\n    if (this.isInfinity()) return other.isInfinity()\r\n    if (other.isInfinity()) return this.isInfinity()\r\n\r\n    // u = y2 * z1 - y1 * z2\r\n    const u = other.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(other.z)).mod(this.curve.q)\r\n    if (!u.equals(BigInteger.ZERO)) return false\r\n\r\n    // v = x2 * z1 - x1 * z2\r\n    const v = other.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(other.z)).mod(this.curve.q)\r\n    return v.equals(BigInteger.ZERO)\r\n  }\r\n\r\n  /**\r\n   * 是否是无穷远点\r\n   */\r\n  isInfinity() {\r\n    if (this.x === null && this.y === null) return true\r\n    return this.z.equals(BigInteger.ZERO) && !this.y.toBigInteger().equals(BigInteger.ZERO)\r\n  }\r\n\r\n  /**\r\n   * 取反，x 轴对称点\r\n   */\r\n  negate() {\r\n    return new ECPointFp(this.curve, this.x, this.y.negate(), this.z)\r\n  }\r\n\r\n  /**\r\n   * 相加\r\n   *\r\n   * 标准射影坐标系：\r\n   *\r\n   * λ1 = x1 * z2\r\n   * λ2 = x2 * z1\r\n   * λ3 = λ1 − λ2\r\n   * λ4 = y1 * z2\r\n   * λ5 = y2 * z1\r\n   * λ6 = λ4 − λ5\r\n   * λ7 = λ1 + λ2\r\n   * λ8 = z1 * z2\r\n   * λ9 = λ3^2\r\n   * λ10 = λ3 * λ9\r\n   * λ11 = λ8 * λ6^2 − λ7 * λ9\r\n   * x3 = λ3 * λ11\r\n   * y3 = λ6 * (λ9 * λ1 − λ11) − λ4 * λ10\r\n   * z3 = λ10 * λ8\r\n   */\r\n  add(b) {\r\n    if (this.isInfinity()) return b\r\n    if (b.isInfinity()) return this\r\n\r\n    const x1 = this.x.toBigInteger()\r\n    const y1 = this.y.toBigInteger()\r\n    const z1 = this.z\r\n    const x2 = b.x.toBigInteger()\r\n    const y2 = b.y.toBigInteger()\r\n    const z2 = b.z\r\n    const q = this.curve.q\r\n\r\n    const w1 = x1.multiply(z2).mod(q)\r\n    const w2 = x2.multiply(z1).mod(q)\r\n    const w3 = w1.subtract(w2)\r\n    const w4 = y1.multiply(z2).mod(q)\r\n    const w5 = y2.multiply(z1).mod(q)\r\n    const w6 = w4.subtract(w5)\r\n\r\n    if (BigInteger.ZERO.equals(w3)) {\r\n      if (BigInteger.ZERO.equals(w6)) {\r\n        return this.twice() // this == b，计算自加\r\n      }\r\n      return this.curve.infinity // this == -b，则返回无穷远点\r\n    }\r\n\r\n    const w7 = w1.add(w2)\r\n    const w8 = z1.multiply(z2).mod(q)\r\n    const w9 = w3.square().mod(q)\r\n    const w10 = w3.multiply(w9).mod(q)\r\n    const w11 = w8.multiply(w6.square()).subtract(w7.multiply(w9)).mod(q)\r\n\r\n    const x3 = w3.multiply(w11).mod(q)\r\n    const y3 = w6.multiply(w9.multiply(w1).subtract(w11)).subtract(w4.multiply(w10)).mod(q)\r\n    const z3 = w10.multiply(w8).mod(q)\r\n\r\n    return new ECPointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3), z3)\r\n  }\r\n\r\n  /**\r\n   * 自加\r\n   *\r\n   * 标准射影坐标系：\r\n   *\r\n   * λ1 = 3 * x1^2 + a * z1^2\r\n   * λ2 = 2 * y1 * z1\r\n   * λ3 = y1^2\r\n   * λ4 = λ3 * x1 * z1\r\n   * λ5 = λ2^2\r\n   * λ6 = λ1^2 − 8 * λ4\r\n   * x3 = λ2 * λ6\r\n   * y3 = λ1 * (4 * λ4 − λ6) − 2 * λ5 * λ3\r\n   * z3 = λ2 * λ5\r\n   */\r\n  twice() {\r\n    if (this.isInfinity()) return this\r\n    if (!this.y.toBigInteger().signum()) return this.curve.infinity\r\n\r\n    const x1 = this.x.toBigInteger()\r\n    const y1 = this.y.toBigInteger()\r\n    const z1 = this.z\r\n    const q = this.curve.q\r\n    const a = this.curve.a.toBigInteger()\r\n\r\n    const w1 = x1.square().multiply(THREE).add(a.multiply(z1.square())).mod(q)\r\n    const w2 = y1.shiftLeft(1).multiply(z1).mod(q)\r\n    const w3 = y1.square().mod(q)\r\n    const w4 = w3.multiply(x1).multiply(z1).mod(q)\r\n    const w5 = w2.square().mod(q)\r\n    const w6 = w1.square().subtract(w4.shiftLeft(3)).mod(q)\r\n\r\n    const x3 = w2.multiply(w6).mod(q)\r\n    const y3 = w1.multiply(w4.shiftLeft(2).subtract(w6)).subtract(w5.shiftLeft(1).multiply(w3)).mod(q)\r\n    const z3 = w2.multiply(w5).mod(q)\r\n\r\n    return new ECPointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3), z3)\r\n  }\r\n\r\n  /**\r\n   * 倍点计算\r\n   */\r\n  multiply(k) {\r\n    if (this.isInfinity()) return this\r\n    if (!k.signum()) return this.curve.infinity\r\n\r\n    // 使用加减法\r\n    const k3 = k.multiply(THREE)\r\n    const neg = this.negate()\r\n    let Q = this\r\n\r\n    for (let i = k3.bitLength() - 2; i > 0; i--) {\r\n      Q = Q.twice()\r\n\r\n      const k3Bit = k3.testBit(i)\r\n      const kBit = k.testBit(i)\r\n\r\n      if (k3Bit !== kBit) {\r\n        Q = Q.add(k3Bit ? this : neg)\r\n      }\r\n    }\r\n\r\n    return Q\r\n  }\r\n}\r\n\r\n/**\r\n * 椭圆曲线 y^2 = x^3 + ax + b\r\n */\r\nexport class ECCurveFp {\r\n  constructor(q, a, b) {\r\n    this.q = q\r\n    this.a = this.fromBigInteger(a)\r\n    this.b = this.fromBigInteger(b)\r\n    this.infinity = new ECPointFp(this, null, null) // 无穷远点\r\n  }\r\n\r\n  /**\r\n   * 判断两个椭圆曲线是否相等\r\n   */\r\n  equals(other) {\r\n    if (other === this) return true\r\n    return this.q.equals(other.q) && this.a.equals(other.a) && this.b.equals(other.b)\r\n  }\r\n\r\n  /**\r\n   * 生成椭圆曲线域元素\r\n   */\r\n  fromBigInteger(x) {\r\n    return new ECFieldElementFp(this.q, x)\r\n  }\r\n\r\n  /**\r\n   * 解析 16 进制串为椭圆曲线点\r\n   */\r\n  decodePointHex(s) {\r\n    switch (parseInt(s.substr(0, 2), 16)) {\r\n      // 第一个字节\r\n      case 0:\r\n        return this.infinity\r\n      case 2:\r\n      case 3:\r\n        // 压缩\r\n        const x = this.fromBigInteger(new BigInteger(s.substr(2), 16))\r\n        // 对 p ≡ 3 (mod4)，即存在正整数 u，使得 p = 4u + 3\r\n        // 计算 y = (√ (x^3 + ax + b) % p)^(u + 1) modp\r\n        let y = this.fromBigInteger(\r\n          x\r\n            .multiply(x.square())\r\n            .add(x.multiply(this.a))\r\n            .add(this.b)\r\n            .toBigInteger()\r\n            .modPow(this.q.divide(new BigInteger('4')).add(BigInteger.ONE), this.q)\r\n        )\r\n        // 算出结果 2 进制最后 1 位不等于第 1 个字节减 2 则取反\r\n        if (\r\n          !y\r\n            .toBigInteger()\r\n            .mod(TWO)\r\n            .equals(new BigInteger(s.substr(0, 2), 16).subtract(TWO))\r\n        ) {\r\n          y = y.negate()\r\n        }\r\n        return new ECPointFp(this, x, y)\r\n      case 4:\r\n      case 6:\r\n      case 7:\r\n        const len = (s.length - 2) / 2\r\n        const xHex = s.substr(2, len)\r\n        const yHex = s.substr(len + 2, len)\r\n\r\n        return new ECPointFp(this, this.fromBigInteger(new BigInteger(xHex, 16)), this.fromBigInteger(new BigInteger(yHex, 16)))\r\n      default:\r\n        // 不支持\r\n        return null\r\n    }\r\n  }\r\n}\r\n\r\nexport default {\r\n  ECPointFp,\r\n  ECCurveFp,\r\n}\r\n"],"names":["TWO","BigInteger","THREE","ECFieldElementFp","q","x","other","b","ECPointFp","curve","y","z","x1","y1","z1","x2","y2","z2","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","x3","y3","z3","a","k","k3","neg","Q","i","k3Bit","kBit","ECCurveFp","s","len","xHex","yHex","ec"],"mappings":";AAUA,MAAMA,IAAM,IAAIC,aAAW,GAAG,GACxBC,IAAQ,IAAID,aAAW,GAAG;AAKhC,MAAME,EAAiB;AAAA,EACrB,YAAYC,GAAGC,GAAG;AAChB,SAAK,IAAIA,GACT,KAAK,IAAID;AAAA,EAEX;AAAA;AAAA;AAAA;AAAA,EAKA,OAAOE,GAAO;AACR,WAAAA,MAAU,OAAa,KACpB,KAAK,EAAE,OAAOA,EAAM,CAAC,KAAK,KAAK,EAAE,OAAOA,EAAM,CAAC;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA,EAKA,eAAe;AACb,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS;AACA,WAAA,IAAIH,EAAiB,KAAK,GAAG,KAAK,EAAE,OAAA,EAAS,IAAI,KAAK,CAAC,CAAC;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA,EAKA,IAAII,GAAG;AACL,WAAO,IAAIJ,EAAiB,KAAK,GAAG,KAAK,EAAE,IAAII,EAAE,aAAc,CAAA,EAAE,IAAI,KAAK,CAAC,CAAC;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA,EAKA,SAASA,GAAG;AACV,WAAO,IAAIJ,EAAiB,KAAK,GAAG,KAAK,EAAE,SAASI,EAAE,aAAc,CAAA,EAAE,IAAI,KAAK,CAAC,CAAC;AAAA,EACnF;AAAA;AAAA;AAAA;AAAA,EAKA,SAASA,GAAG;AACV,WAAO,IAAIJ,EAAiB,KAAK,GAAG,KAAK,EAAE,SAASI,EAAE,aAAc,CAAA,EAAE,IAAI,KAAK,CAAC,CAAC;AAAA,EACnF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAOA,GAAG;AACR,WAAO,IAAIJ,EAAiB,KAAK,GAAG,KAAK,EAAE,SAASI,EAAE,aAAe,EAAA,WAAW,KAAK,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC;AAAA,EACtG;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS;AACA,WAAA,IAAIJ,EAAiB,KAAK,GAAG,KAAK,EAAE,OAAA,EAAS,IAAI,KAAK,CAAC,CAAC;AAAA,EACjE;AACF;AAEO,MAAMK,EAAU;AAAA,EACrB,YAAYC,GAAOJ,GAAGK,GAAGC,GAAG;AAC1B,SAAK,QAAQF,GACb,KAAK,IAAIJ,GACT,KAAK,IAAIK,GAET,KAAK,IAAIC,KAAYV,EAAA,WAAW,KAChC,KAAK,OAAO;AAAA,EAEd;AAAA,EAEA,OAAO;AACD,WAAA,KAAK,SAAS,SAAW,KAAA,OAAO,KAAK,EAAE,WAAW,KAAK,MAAM,CAAC,IAE3D,KAAK,MAAM,eAAe,KAAK,EAAE,eAAe,SAAS,KAAK,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC,CAAC;AAAA,EAC9F;AAAA,EAEA,OAAO;AACD,WAAA,KAAK,SAAS,SAAW,KAAA,OAAO,KAAK,EAAE,WAAW,KAAK,MAAM,CAAC,IAE3D,KAAK,MAAM,eAAe,KAAK,EAAE,eAAe,SAAS,KAAK,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC,CAAC;AAAA,EAC9F;AAAA;AAAA;AAAA;AAAA,EAKA,OAAOK,GAAO;AACR,WAAAA,MAAU,OAAa,KACvB,KAAK,WAAA,IAAqBA,EAAM,WAAW,IAC3CA,EAAM,WAAA,IAAqB,KAAK,WAAW,IAGrCA,EAAM,EAAE,aAAA,EAAe,SAAS,KAAK,CAAC,EAAE,SAAS,KAAK,EAAE,aAAa,EAAE,SAASA,EAAM,CAAC,CAAC,EAAE,IAAI,KAAK,MAAM,CAAC,EAC7G,OAAOL,EAAW,WAAA,IAAI,IAGnBK,EAAM,EAAE,aAAA,EAAe,SAAS,KAAK,CAAC,EAAE,SAAS,KAAK,EAAE,aAAa,EAAE,SAASA,EAAM,CAAC,CAAC,EAAE,IAAI,KAAK,MAAM,CAAC,EAC3G,OAAOL,EAAA,WAAW,IAAI,IAJQ;AAAA,EAKzC;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa;AACX,WAAI,KAAK,MAAM,QAAQ,KAAK,MAAM,OAAa,KACxC,KAAK,EAAE,OAAOA,EAAA,WAAW,IAAI,KAAK,CAAC,KAAK,EAAE,aAAe,EAAA,OAAOA,aAAW,IAAI;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS;AACA,WAAA,IAAIO,EAAU,KAAK,OAAO,KAAK,GAAG,KAAK,EAAE,OAAA,GAAU,KAAK,CAAC;AAAA,EAClE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,IAAID,GAAG;AACD,QAAA,KAAK,aAAqB,QAAAA;AAC1B,QAAAA,EAAE,aAAqB,QAAA;AAErB,UAAAK,IAAK,KAAK,EAAE,aAAa,GACzBC,IAAK,KAAK,EAAE,aAAa,GACzBC,IAAK,KAAK,GACVC,IAAKR,EAAE,EAAE,aAAa,GACtBS,IAAKT,EAAE,EAAE,aAAa,GACtBU,IAAKV,EAAE,GACPH,IAAI,KAAK,MAAM,GAEfc,IAAKN,EAAG,SAASK,CAAE,EAAE,IAAIb,CAAC,GAC1Be,IAAKJ,EAAG,SAASD,CAAE,EAAE,IAAIV,CAAC,GAC1BgB,IAAKF,EAAG,SAASC,CAAE,GACnBE,IAAKR,EAAG,SAASI,CAAE,EAAE,IAAIb,CAAC,GAC1BkB,IAAKN,EAAG,SAASF,CAAE,EAAE,IAAIV,CAAC,GAC1BmB,IAAKF,EAAG,SAASC,CAAE;AAEzB,QAAIrB,aAAW,KAAK,OAAOmB,CAAE;AAC3B,aAAInB,aAAW,KAAK,OAAOsB,CAAE,IACpB,KAAK,UAEP,KAAK,MAAM;AAGd,UAAAC,IAAKN,EAAG,IAAIC,CAAE,GACdM,IAAKX,EAAG,SAASG,CAAE,EAAE,IAAIb,CAAC,GAC1BsB,IAAKN,EAAG,OAAO,EAAE,IAAIhB,CAAC,GACtBuB,IAAMP,EAAG,SAASM,CAAE,EAAE,IAAItB,CAAC,GAC3BwB,IAAMH,EAAG,SAASF,EAAG,QAAQ,EAAE,SAASC,EAAG,SAASE,CAAE,CAAC,EAAE,IAAItB,CAAC,GAE9DyB,IAAKT,EAAG,SAASQ,CAAG,EAAE,IAAIxB,CAAC,GAC3B0B,IAAKP,EAAG,SAASG,EAAG,SAASR,CAAE,EAAE,SAASU,CAAG,CAAC,EAAE,SAASP,EAAG,SAASM,CAAG,CAAC,EAAE,IAAIvB,CAAC,GAChF2B,IAAKJ,EAAI,SAASF,CAAE,EAAE,IAAIrB,CAAC;AAEjC,WAAO,IAAII,EAAU,KAAK,OAAO,KAAK,MAAM,eAAeqB,CAAE,GAAG,KAAK,MAAM,eAAeC,CAAE,GAAGC,CAAE;AAAA,EACnG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,QAAQ;AACF,QAAA,KAAK,aAAqB,QAAA;AAC1B,QAAA,CAAC,KAAK,EAAE,eAAe,OAAO,EAAU,QAAA,KAAK,MAAM;AAEjD,UAAAnB,IAAK,KAAK,EAAE,aAAa,GACzBC,IAAK,KAAK,EAAE,aAAa,GACzBC,IAAK,KAAK,GACVV,IAAI,KAAK,MAAM,GACf4B,IAAI,KAAK,MAAM,EAAE,aAAa,GAE9Bd,IAAKN,EAAG,OAAS,EAAA,SAASV,CAAK,EAAE,IAAI8B,EAAE,SAASlB,EAAG,OAAO,CAAC,CAAC,EAAE,IAAIV,CAAC,GACnEe,IAAKN,EAAG,UAAU,CAAC,EAAE,SAASC,CAAE,EAAE,IAAIV,CAAC,GACvCgB,IAAKP,EAAG,OAAO,EAAE,IAAIT,CAAC,GACtBiB,IAAKD,EAAG,SAASR,CAAE,EAAE,SAASE,CAAE,EAAE,IAAIV,CAAC,GACvCkB,IAAKH,EAAG,OAAO,EAAE,IAAIf,CAAC,GACtBmB,IAAKL,EAAG,OAAA,EAAS,SAASG,EAAG,UAAU,CAAC,CAAC,EAAE,IAAIjB,CAAC,GAEhDyB,IAAKV,EAAG,SAASI,CAAE,EAAE,IAAInB,CAAC,GAC1B0B,IAAKZ,EAAG,SAASG,EAAG,UAAU,CAAC,EAAE,SAASE,CAAE,CAAC,EAAE,SAASD,EAAG,UAAU,CAAC,EAAE,SAASF,CAAE,CAAC,EAAE,IAAIhB,CAAC,GAC3F2B,IAAKZ,EAAG,SAASG,CAAE,EAAE,IAAIlB,CAAC;AAEhC,WAAO,IAAII,EAAU,KAAK,OAAO,KAAK,MAAM,eAAeqB,CAAE,GAAG,KAAK,MAAM,eAAeC,CAAE,GAAGC,CAAE;AAAA,EACnG;AAAA;AAAA;AAAA;AAAA,EAKA,SAASE,GAAG;AACN,QAAA,KAAK,aAAqB,QAAA;AAC9B,QAAI,CAACA,EAAE,OAAA,EAAU,QAAO,KAAK,MAAM;AAG7B,UAAAC,IAAKD,EAAE,SAAS/B,CAAK,GACrBiC,IAAM,KAAK;AACjB,QAAIC,IAAI;AAER,aAASC,IAAIH,EAAG,UAAA,IAAc,GAAGG,IAAI,GAAGA,KAAK;AAC3C,MAAAD,IAAIA,EAAE;AAEA,YAAAE,IAAQJ,EAAG,QAAQG,CAAC,GACpBE,IAAON,EAAE,QAAQI,CAAC;AAExB,MAAIC,MAAUC,MACZH,IAAIA,EAAE,IAAIE,IAAQ,OAAOH,CAAG;AAAA,IAEhC;AAEO,WAAAC;AAAA,EACT;AACF;AAKO,MAAMI,EAAU;AAAA,EACrB,YAAYpC,GAAG4B,GAAGzB,GAAG;AACnB,SAAK,IAAIH,GACJ,KAAA,IAAI,KAAK,eAAe4B,CAAC,GACzB,KAAA,IAAI,KAAK,eAAezB,CAAC,GAC9B,KAAK,WAAW,IAAIC,EAAU,MAAM,MAAM,IAAI;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAOF,GAAO;AACR,WAAAA,MAAU,OAAa,KACpB,KAAK,EAAE,OAAOA,EAAM,CAAC,KAAK,KAAK,EAAE,OAAOA,EAAM,CAAC,KAAK,KAAK,EAAE,OAAOA,EAAM,CAAC;AAAA,EAClF;AAAA;AAAA;AAAA;AAAA,EAKA,eAAeD,GAAG;AAChB,WAAO,IAAIF,EAAiB,KAAK,GAAGE,CAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,eAAeoC,GAAG;AAChB,YAAQ,SAASA,EAAE,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG;AAAA,MAEpC,KAAK;AACH,eAAO,KAAK;AAAA,MACd,KAAK;AAAA,MACL,KAAK;AAEG,cAAApC,IAAI,KAAK,eAAe,IAAIJ,EAAA,WAAWwC,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;AAG7D,YAAI/B,IAAI,KAAK;AAAA,UACXL,EACG,SAASA,EAAE,OAAQ,CAAA,EACnB,IAAIA,EAAE,SAAS,KAAK,CAAC,CAAC,EACtB,IAAI,KAAK,CAAC,EACV,aAAA,EACA,OAAO,KAAK,EAAE,OAAO,IAAIJ,EAAA,WAAW,GAAG,CAAC,EAAE,IAAIA,EAAA,WAAW,GAAG,GAAG,KAAK,CAAC;AAAA,QAAA;AAIxE,eAACS,EACE,aAAa,EACb,IAAIV,CAAG,EACP,OAAO,IAAIC,EAAA,WAAWwC,EAAE,OAAO,GAAG,CAAC,GAAG,EAAE,EAAE,SAASzC,CAAG,CAAC,MAE1DU,IAAIA,EAAE,WAED,IAAIF,EAAU,MAAMH,GAAGK,CAAC;AAAA,MACjC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACG,cAAAgC,KAAOD,EAAE,SAAS,KAAK,GACvBE,IAAOF,EAAE,OAAO,GAAGC,CAAG,GACtBE,IAAOH,EAAE,OAAOC,IAAM,GAAGA,CAAG;AAElC,eAAO,IAAIlC,EAAU,MAAM,KAAK,eAAe,IAAIP,aAAW0C,GAAM,EAAE,CAAC,GAAG,KAAK,eAAe,IAAI1C,EAAAA,WAAW2C,GAAM,EAAE,CAAC,CAAC;AAAA,MACzH;AAES,eAAA;AAAA,IACX;AAAA,EACF;AACF;AAEA,MAAeC,IAAA;AAAA,EACb,WAAArC;AAAA,EACA,WAAAgC;AACF;"}

package/dist/request/leaf7/smCrypto/sm2/index.d.ts

@@ -0,0 +1,45 @@
+/**
+ * 加密
+ */
+declare function _s2EN(msg: any, publicKey: any, cipherMode?: number): string;
+/**
+ * 解密
+ */
+declare function _s2DE(encryptData: any, privateKey: any, cipherMode?: number, { output }?: {
+    output?: string | undefined;
+}): string | never[];
+/**
+ * 签名
+ */
+declare function _s2DOSIG(msg: any, privateKey: any, { pointPool, der, hash, publicKey, userId }?: {}): any;
+/**
+ * 验签
+ */
+declare function _s2DOVERSIG(msg: any, signHex: any, publicKey: any, { der, hash, userId }?: {}): any;
+/**
+ * 计算公钥
+ */
+declare function _s2GETPublicFPrivate(privateKey: any): string;
+/**
+ * 获取椭圆曲线点
+ */
+declare function getPoint(): {
+    privateKey: any;
+    publicKey: string;
+};
+declare const _default: {
+    generateKeyPairHex: (a: any, b: any, c: any) => {
+        privateKey: any;
+        publicKey: string;
+    };
+    compressPublicKeyHex: (s: any) => string;
+    comparePublicKeyHex: (publicKey1: any, publicKey2: any) => any;
+    _s2EN: typeof _s2EN;
+    _s2DE: typeof _s2DE;
+    _s2DOSIG: typeof _s2DOSIG;
+    _s2DOVERSIG: typeof _s2DOVERSIG;
+    _s2GETPublicFPrivate: typeof _s2GETPublicFPrivate;
+    getPoint: typeof getPoint;
+    verifyPublicKey: (publicKey: any) => any;
+};
+export default _default;

package/dist/request/leaf7/smCrypto/sm2/index.js

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

package/dist/request/leaf7/smCrypto/sm2/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../src/request/leaf7/smCrypto/sm2/index.ts"],"sourcesContent":["import { BigInteger } from 'jsbn'\r\nimport asn1 from './asn1'\r\nimport _ from './utils'\r\nimport SM3 from './sm3'\r\n\r\nconst { sm3 } = SM3\r\nconst { encodeDer, decodeDer } = asn1\r\n\r\nconst { G, curve, n } = _.generateEcparam()\r\nconst C1C2C3 = 0\r\n\r\n/**\r\n * 加密\r\n */\r\nfunction _s2EN(msg, publicKey, cipherMode = 1) {\r\n  msg = typeof msg === 'string' ? _.hexToArray(_.utf8ToHex(msg)) : Array.prototype.slice.call(msg)\r\n  publicKey = _.getGlobalCurve().decodePointHex(publicKey) // 先将公钥转成点\r\n\r\n  const keypair = _.generateKeyPairHex()\r\n  const k = new BigInteger(keypair.privateKey, 16) // 随机数 k\r\n\r\n  // c1 = k * G\r\n  let c1 = keypair.publicKey\r\n  if (c1.length > 128) c1 = c1.substr(c1.length - 128)\r\n\r\n  // (x2, y2) = k * publicKey\r\n  const p = publicKey.multiply(k)\r\n  const x2 = _.hexToArray(_.leftPad(p.getX().toBigInteger().toRadix(16), 64))\r\n  const y2 = _.hexToArray(_.leftPad(p.getY().toBigInteger().toRadix(16), 64))\r\n\r\n  // c3 = hash(x2 || msg || y2)\r\n  const c3 = _.arrayToHex(sm3([].concat(x2, msg, y2)))\r\n\r\n  let ct = 1\r\n  let offset = 0\r\n  let t = [] // 256 位\r\n  const z = [].concat(x2, y2)\r\n  const nextT = () => {\r\n    // (1) Hai = hash(z || ct)\r\n    // (2) ct++\r\n    t = sm3([...z, (ct >> 24) & 0x00ff, (ct >> 16) & 0x00ff, (ct >> 8) & 0x00ff, ct & 0x00ff])\r\n    ct++\r\n    offset = 0\r\n  }\r\n  nextT() // 先生成 Ha1\r\n\r\n  for (let i = 0, len = msg.length; i < len; i++) {\r\n    // t = Ha1 || Ha2 || Ha3 || Ha4\r\n    if (offset === t.length) nextT()\r\n\r\n    // c2 = msg ^ t\r\n    msg[i] ^= t[offset++] & 0xff\r\n  }\r\n  const c2 = _.arrayToHex(msg)\r\n\r\n  return cipherMode === C1C2C3 ? c1 + c2 + c3 : c1 + c3 + c2\r\n}\r\n\r\n/**\r\n * 解密\r\n */\r\nfunction _s2DE(encryptData, privateKey, cipherMode = 1, { output = 'string' } = {}) {\r\n  privateKey = new BigInteger(privateKey, 16)\r\n\r\n  let c3 = encryptData.substr(128, 64)\r\n  let c2 = encryptData.substr(128 + 64)\r\n\r\n  if (cipherMode === C1C2C3) {\r\n    c3 = encryptData.substr(encryptData.length - 64)\r\n    c2 = encryptData.substr(128, encryptData.length - 128 - 64)\r\n  }\r\n\r\n  const msg = _.hexToArray(c2)\r\n  const c1 = _.getGlobalCurve().decodePointHex('04' + encryptData.substr(0, 128))\r\n\r\n  const p = c1.multiply(privateKey)\r\n  const x2 = _.hexToArray(_.leftPad(p.getX().toBigInteger().toRadix(16), 64))\r\n  const y2 = _.hexToArray(_.leftPad(p.getY().toBigInteger().toRadix(16), 64))\r\n\r\n  let ct = 1\r\n  let offset = 0\r\n  let t = [] // 256 位\r\n  const z = [].concat(x2, y2)\r\n  const nextT = () => {\r\n    // (1) Hai = hash(z || ct)\r\n    // (2) ct++\r\n    t = sm3([...z, (ct >> 24) & 0x00ff, (ct >> 16) & 0x00ff, (ct >> 8) & 0x00ff, ct & 0x00ff])\r\n    ct++\r\n    offset = 0\r\n  }\r\n  nextT() // 先生成 Ha1\r\n\r\n  for (let i = 0, len = msg.length; i < len; i++) {\r\n    // t = Ha1 || Ha2 || Ha3 || Ha4\r\n    if (offset === t.length) nextT()\r\n\r\n    // c2 = msg ^ t\r\n    msg[i] ^= t[offset++] & 0xff\r\n  }\r\n\r\n  // c3 = hash(x2 || msg || y2)\r\n  const checkC3 = _.arrayToHex(sm3([].concat(x2, msg, y2)))\r\n\r\n  if (checkC3 === c3.toLowerCase()) {\r\n    return output === 'array' ? msg : _.arrayToUtf8(msg)\r\n  } else {\r\n    return output === 'array' ? [] : ''\r\n  }\r\n}\r\n\r\n/**\r\n * 签名\r\n */\r\nfunction _s2DOSIG(msg, privateKey, { pointPool, der, hash, publicKey, userId } = {}) {\r\n  let hashHex = typeof msg === 'string' ? _.utf8ToHex(msg) : _.arrayToHex(msg)\r\n\r\n  if (hash) {\r\n    // sm3杂凑\r\n    publicKey = publicKey || getPublicKeyFromPrivateKey(privateKey)\r\n    hashHex = getHash(hashHex, publicKey, userId)\r\n  }\r\n\r\n  const dA = new BigInteger(privateKey, 16)\r\n  const e = new BigInteger(hashHex, 16)\r\n\r\n  // k\r\n  let k = null\r\n  let r = null\r\n  let s = null\r\n\r\n  do {\r\n    do {\r\n      let point\r\n      if (pointPool && pointPool.length) {\r\n        point = pointPool.pop()\r\n      } else {\r\n        point = getPoint()\r\n      }\r\n      k = point.k\r\n\r\n      // r = (e + x1) mod n\r\n      r = e.add(point.x1).mod(n)\r\n    } while (r.equals(BigInteger.ZERO) || r.add(k).equals(n))\r\n\r\n    // s = ((1 + dA)^-1 * (k - r * dA)) mod n\r\n    s = dA\r\n      .add(BigInteger.ONE)\r\n      .modInverse(n)\r\n      .multiply(k.subtract(r.multiply(dA)))\r\n      .mod(n)\r\n  } while (s.equals(BigInteger.ZERO))\r\n\r\n  if (der) return encodeDer(r, s) // asn.1 der 编码\r\n\r\n  return _.leftPad(r.toString(16), 64) + _.leftPad(s.toString(16), 64)\r\n}\r\n\r\n/**\r\n * 验签\r\n */\r\nfunction _s2DOVERSIG(msg, signHex, publicKey, { der, hash, userId } = {}) {\r\n  let hashHex = typeof msg === 'string' ? _.utf8ToHex(msg) : _.arrayToHex(msg)\r\n\r\n  if (hash) {\r\n    // sm3杂凑\r\n    hashHex = getHash(hashHex, publicKey, userId)\r\n  }\r\n\r\n  let r\r\n  let s\r\n  if (der) {\r\n    const decodeDerObj = decodeDer(signHex) // asn.1 der 解码\r\n    r = decodeDerObj.r\r\n    s = decodeDerObj.s\r\n  } else {\r\n    r = new BigInteger(signHex.substring(0, 64), 16)\r\n    s = new BigInteger(signHex.substring(64), 16)\r\n  }\r\n\r\n  const PA = curve.decodePointHex(publicKey)\r\n  const e = new BigInteger(hashHex, 16)\r\n\r\n  // t = (r + s) mod n\r\n  const t = r.add(s).mod(n)\r\n\r\n  if (t.equals(BigInteger.ZERO)) return false\r\n\r\n  // x1y1 = s * G + t * PA\r\n  const x1y1 = G.multiply(s).add(PA.multiply(t))\r\n\r\n  // R = (e + x1) mod n\r\n  const R = e.add(x1y1.getX().toBigInteger()).mod(n)\r\n\r\n  return r.equals(R)\r\n}\r\n\r\n/**\r\n * sm3杂凑算法\r\n */\r\nfunction getHash(hashHex, publicKey, userId = '1234567812345678') {\r\n  // z = hash(entl || userId || a || b || gx || gy || px || py)\r\n  userId = _.utf8ToHex(userId)\r\n  const a = _.leftPad(G.curve.a.toBigInteger().toRadix(16), 64)\r\n  const b = _.leftPad(G.curve.b.toBigInteger().toRadix(16), 64)\r\n  const gx = _.leftPad(G.getX().toBigInteger().toRadix(16), 64)\r\n  const gy = _.leftPad(G.getY().toBigInteger().toRadix(16), 64)\r\n  let px\r\n  let py\r\n  if (publicKey.length === 128) {\r\n    px = publicKey.substr(0, 64)\r\n    py = publicKey.substr(64, 64)\r\n  } else {\r\n    const point = G.curve.decodePointHex(publicKey)\r\n    px = _.leftPad(point.getX().toBigInteger().toRadix(16), 64)\r\n    py = _.leftPad(point.getY().toBigInteger().toRadix(16), 64)\r\n  }\r\n  const data = _.hexToArray(userId + a + b + gx + gy + px + py)\r\n\r\n  const entl = userId.length * 4\r\n  data.unshift(entl & 0x00ff)\r\n  data.unshift((entl >> 8) & 0x00ff)\r\n\r\n  const z = sm3(data)\r\n\r\n  // e = hash(z || msg)\r\n  return _.arrayToHex(sm3(z.concat(_.hexToArray(hashHex))))\r\n}\r\n\r\n/**\r\n * 计算公钥\r\n */\r\nfunction _s2GETPublicFPrivate(privateKey) {\r\n  const PA = G.multiply(new BigInteger(privateKey, 16))\r\n  const x = _.leftPad(PA.getX().toBigInteger().toString(16), 64)\r\n  const y = _.leftPad(PA.getY().toBigInteger().toString(16), 64)\r\n  return '04' + x + y\r\n}\r\n\r\n/**\r\n * 获取椭圆曲线点\r\n */\r\nfunction getPoint() {\r\n  const keypair = _.generateKeyPairHex()\r\n  const PA = curve.decodePointHex(keypair.publicKey)\r\n\r\n  keypair.k = new BigInteger(keypair.privateKey, 16)\r\n  keypair.x1 = PA.getX().toBigInteger()\r\n\r\n  return keypair\r\n}\r\n\r\nexport default {\r\n  generateKeyPairHex: _.generateKeyPairHex,\r\n  compressPublicKeyHex: _.compressPublicKeyHex,\r\n  comparePublicKeyHex: _.comparePublicKeyHex,\r\n  _s2EN,\r\n  _s2DE,\r\n  _s2DOSIG,\r\n  _s2DOVERSIG,\r\n  _s2GETPublicFPrivate,\r\n  getPoint,\r\n  verifyPublicKey: _.verifyPublicKey,\r\n}\r\n"],"names":["sm3","SM3","encodeDer","decodeDer","asn1","G","curve","n","_","C1C2C3","_s2EN","msg","publicKey","cipherMode","keypair","k","BigInteger","c1","p","x2","y2","c3","ct","offset","t","z","nextT","i","len","c2","_s2DE","encryptData","privateKey","output","_s2DOSIG","pointPool","der","hash","userId","hashHex","getHash","dA","e","r","s","point","getPoint","_s2DOVERSIG","signHex","decodeDerObj","PA","x1y1","R","a","b","gx","gy","px","py","data","entl","_s2GETPublicFPrivate","x","y","sm2"],"mappings":";;;;AAKA,MAAM,EAAE,KAAAA,EAAQ,IAAAC,GACV,EAAE,WAAAC,GAAW,WAAAC,EAAc,IAAAC,GAE3B,EAAE,GAAAC,GAAG,OAAAC,GAAO,GAAAC,EAAE,IAAIC,EAAE,gBAAgB,GACpCC,IAAS;AAKf,SAASC,EAAMC,GAAKC,GAAWC,IAAa,GAAG;AAC7C,EAAAF,IAAM,OAAOA,KAAQ,WAAWH,EAAE,WAAWA,EAAE,UAAUG,CAAG,CAAC,IAAI,MAAM,UAAU,MAAM,KAAKA,CAAG,GAC/FC,IAAYJ,EAAE,eAAiB,EAAA,eAAeI,CAAS;AAEjD,QAAAE,IAAUN,EAAE,sBACZO,IAAI,IAAIC,EAAW,WAAAF,EAAQ,YAAY,EAAE;AAG/C,MAAIG,IAAKH,EAAQ;AACb,EAAAG,EAAG,SAAS,QAAKA,IAAKA,EAAG,OAAOA,EAAG,SAAS,GAAG;AAG7C,QAAAC,IAAIN,EAAU,SAASG,CAAC,GACxBI,IAAKX,EAAE,WAAWA,EAAE,QAAQU,EAAE,KAAA,EAAO,aAAe,EAAA,QAAQ,EAAE,GAAG,EAAE,CAAC,GACpEE,IAAKZ,EAAE,WAAWA,EAAE,QAAQU,EAAE,KAAA,EAAO,aAAe,EAAA,QAAQ,EAAE,GAAG,EAAE,CAAC,GAGpEG,IAAKb,EAAE,WAAWR,EAAI,CAAA,EAAG,OAAOmB,GAAIR,GAAKS,CAAE,CAAC,CAAC;AAEnD,MAAIE,IAAK,GACLC,IAAS,GACTC,IAAI,CAAA;AACR,QAAMC,IAAI,CAAG,EAAA,OAAON,GAAIC,CAAE,GACpBM,IAAQ,MAAM;AAGlB,IAAAF,IAAIxB,EAAI,CAAC,GAAGyB,GAAIH,KAAM,KAAM,KAASA,KAAM,KAAM,KAASA,KAAM,IAAK,KAAQA,IAAK,GAAM,CAAC,GACzFA,KACSC,IAAA;AAAA,EAAA;AAEL,EAAAG;AAEN,WAASC,IAAI,GAAGC,IAAMjB,EAAI,QAAQgB,IAAIC,GAAKD;AAErC,IAAAJ,MAAWC,EAAE,UAAcE,EAAA,GAG/Bf,EAAIgB,CAAC,KAAKH,EAAED,GAAQ,IAAI;AAEpB,QAAAM,IAAKrB,EAAE,WAAWG,CAAG;AAE3B,SAAOE,MAAeJ,IAASQ,IAAKY,IAAKR,IAAKJ,IAAKI,IAAKQ;AAC1D;AAKA,SAASC,EAAMC,GAAaC,GAAYnB,IAAa,GAAG,EAAE,QAAAoB,IAAS,SAAa,IAAA,IAAI;AACrE,EAAAD,IAAA,IAAIhB,EAAAA,WAAWgB,GAAY,EAAE;AAE1C,MAAIX,IAAKU,EAAY,OAAO,KAAK,EAAE,GAC/BF,IAAKE,EAAY,OAAO,GAAQ;AAEpC,EAAIlB,MAAeJ,MACjBY,IAAKU,EAAY,OAAOA,EAAY,SAAS,EAAE,GAC/CF,IAAKE,EAAY,OAAO,KAAKA,EAAY,SAAS,MAAM,EAAE;AAGtD,QAAApB,IAAMH,EAAE,WAAWqB,CAAE,GAGrBX,IAFKV,EAAE,eAAA,EAAiB,eAAe,OAAOuB,EAAY,OAAO,GAAG,GAAG,CAAC,EAEjE,SAASC,CAAU,GAC1Bb,IAAKX,EAAE,WAAWA,EAAE,QAAQU,EAAE,KAAA,EAAO,aAAe,EAAA,QAAQ,EAAE,GAAG,EAAE,CAAC,GACpEE,IAAKZ,EAAE,WAAWA,EAAE,QAAQU,EAAE,KAAA,EAAO,aAAe,EAAA,QAAQ,EAAE,GAAG,EAAE,CAAC;AAE1E,MAAII,IAAK,GACLC,IAAS,GACTC,IAAI,CAAA;AACR,QAAMC,IAAI,CAAG,EAAA,OAAON,GAAIC,CAAE,GACpBM,IAAQ,MAAM;AAGlB,IAAAF,IAAIxB,EAAI,CAAC,GAAGyB,GAAIH,KAAM,KAAM,KAASA,KAAM,KAAM,KAASA,KAAM,IAAK,KAAQA,IAAK,GAAM,CAAC,GACzFA,KACSC,IAAA;AAAA,EAAA;AAEL,EAAAG;AAEN,WAASC,IAAI,GAAGC,IAAMjB,EAAI,QAAQgB,IAAIC,GAAKD;AAErC,IAAAJ,MAAWC,EAAE,UAAcE,EAAA,GAG/Bf,EAAIgB,CAAC,KAAKH,EAAED,GAAQ,IAAI;AAMtB,SAFYf,EAAE,WAAWR,EAAI,CAAA,EAAG,OAAOmB,GAAIR,GAAKS,CAAE,CAAC,CAAC,MAExCC,EAAG,gBACVY,MAAW,UAAUtB,IAAMH,EAAE,YAAYG,CAAG,IAE5CsB,MAAW,UAAU,CAAK,IAAA;AAErC;AAKA,SAASC,EAASvB,GAAKqB,GAAY,EAAE,WAAAG,GAAW,KAAAC,GAAK,MAAAC,GAAM,WAAAzB,GAAW,QAAA0B,EAAW,IAAA,IAAI;AAC/E,MAAAC,IAAU,OAAO5B,KAAQ,WAAWH,EAAE,UAAUG,CAAG,IAAIH,EAAE,WAAWG,CAAG;AAE3E,EAAI0B,MAEUzB,IAAAA,KAAa,2BAA2BoB,CAAU,GACpDO,IAAAC,EAAQD,GAAS3B,GAAW0B,CAAM;AAG9C,QAAMG,IAAK,IAAIzB,EAAAA,WAAWgB,GAAY,EAAE,GAClCU,IAAI,IAAI1B,EAAAA,WAAWuB,GAAS,EAAE;AAGpC,MAAIxB,IAAI,MACJ4B,IAAI,MACJC,IAAI;AAEL,KAAA;AACE,OAAA;AACG,UAAAC;AACA,MAAAV,KAAaA,EAAU,SACzBU,IAAQV,EAAU,QAElBU,IAAQC,EAAS,GAEnB/B,IAAI8B,EAAM,GAGVF,IAAID,EAAE,IAAIG,EAAM,EAAE,EAAE,IAAItC,CAAC;AAAA,IAC3B,SAASoC,EAAE,OAAO3B,EAAW,WAAA,IAAI,KAAK2B,EAAE,IAAI5B,CAAC,EAAE,OAAOR,CAAC;AAGvD,IAAAqC,IAAIH,EACD,IAAIzB,EAAAA,WAAW,GAAG,EAClB,WAAWT,CAAC,EACZ,SAASQ,EAAE,SAAS4B,EAAE,SAASF,CAAE,CAAC,CAAC,EACnC,IAAIlC,CAAC;AAAA,EACD,SAAAqC,EAAE,OAAO5B,EAAA,WAAW,IAAI;AAEjC,SAAIoB,IAAYlC,EAAUyC,GAAGC,CAAC,IAEvBpC,EAAE,QAAQmC,EAAE,SAAS,EAAE,GAAG,EAAE,IAAInC,EAAE,QAAQoC,EAAE,SAAS,EAAE,GAAG,EAAE;AACrE;AAKA,SAASG,EAAYpC,GAAKqC,GAASpC,GAAW,EAAE,KAAAwB,GAAK,MAAAC,GAAM,QAAAC,EAAW,IAAA,IAAI;AACpE,MAAAC,IAAU,OAAO5B,KAAQ,WAAWH,EAAE,UAAUG,CAAG,IAAIH,EAAE,WAAWG,CAAG;AAE3E,EAAI0B,MAEQE,IAAAC,EAAQD,GAAS3B,GAAW0B,CAAM;AAG1C,MAAAK,GACA;AACJ,MAAIP,GAAK;AACD,UAAAa,IAAe9C,EAAU6C,CAAO;AACtC,IAAAL,IAAIM,EAAa,GACjB,IAAIA,EAAa;AAAA,EAAA;AAEjB,IAAAN,IAAI,IAAI3B,EAAW,WAAAgC,EAAQ,UAAU,GAAG,EAAE,GAAG,EAAE,GAC/C,IAAI,IAAIhC,EAAAA,WAAWgC,EAAQ,UAAU,EAAE,GAAG,EAAE;AAGxC,QAAAE,IAAK5C,EAAM,eAAeM,CAAS,GACnC8B,IAAI,IAAI1B,EAAAA,WAAWuB,GAAS,EAAE,GAG9Bf,IAAImB,EAAE,IAAI,CAAC,EAAE,IAAIpC,CAAC;AAExB,MAAIiB,EAAE,OAAOR,EAAAA,WAAW,IAAI,EAAU,QAAA;AAGhC,QAAAmC,IAAO9C,EAAE,SAAS,CAAC,EAAE,IAAI6C,EAAG,SAAS1B,CAAC,CAAC,GAGvC4B,IAAIV,EAAE,IAAIS,EAAK,OAAO,cAAc,EAAE,IAAI5C,CAAC;AAE1C,SAAAoC,EAAE,OAAOS,CAAC;AACnB;AAKA,SAASZ,EAAQD,GAAS3B,GAAW0B,IAAS,oBAAoB;AAEvD,EAAAA,IAAA9B,EAAE,UAAU8B,CAAM;AACrB,QAAAe,IAAI7C,EAAE,QAAQH,EAAE,MAAM,EAAE,aAAe,EAAA,QAAQ,EAAE,GAAG,EAAE,GACtDiD,IAAI9C,EAAE,QAAQH,EAAE,MAAM,EAAE,aAAe,EAAA,QAAQ,EAAE,GAAG,EAAE,GACtDkD,IAAK/C,EAAE,QAAQH,EAAE,KAAA,EAAO,aAAA,EAAe,QAAQ,EAAE,GAAG,EAAE,GACtDmD,IAAKhD,EAAE,QAAQH,EAAE,KAAA,EAAO,aAAA,EAAe,QAAQ,EAAE,GAAG,EAAE;AACxD,MAAAoD,GACAC;AACA,MAAA9C,EAAU,WAAW;AAClB,IAAA6C,IAAA7C,EAAU,OAAO,GAAG,EAAE,GACtB8C,IAAA9C,EAAU,OAAO,IAAI,EAAE;AAAA,OACvB;AACL,UAAMiC,IAAQxC,EAAE,MAAM,eAAeO,CAAS;AACzC,IAAA6C,IAAAjD,EAAE,QAAQqC,EAAM,KAAK,EAAE,eAAe,QAAQ,EAAE,GAAG,EAAE,GACrDa,IAAAlD,EAAE,QAAQqC,EAAM,KAAK,EAAE,eAAe,QAAQ,EAAE,GAAG,EAAE;AAAA,EAC5D;AACM,QAAAc,IAAOnD,EAAE,WAAW8B,IAASe,IAAIC,IAAIC,IAAKC,IAAKC,IAAKC,CAAE,GAEtDE,IAAOtB,EAAO,SAAS;AACxB,EAAAqB,EAAA,QAAQC,IAAO,GAAM,GACrBD,EAAA,QAASC,KAAQ,IAAK,GAAM;AAE3B,QAAAnC,IAAIzB,EAAI2D,CAAI;AAGX,SAAAnD,EAAE,WAAWR,EAAIyB,EAAE,OAAOjB,EAAE,WAAW+B,CAAO,CAAC,CAAC,CAAC;AAC1D;AAKA,SAASsB,EAAqB7B,GAAY;AACxC,QAAMkB,IAAK7C,EAAE,SAAS,IAAIW,EAAAA,WAAWgB,GAAY,EAAE,CAAC,GAC9C8B,IAAItD,EAAE,QAAQ0C,EAAG,KAAA,EAAO,aAAA,EAAe,SAAS,EAAE,GAAG,EAAE,GACvDa,IAAIvD,EAAE,QAAQ0C,EAAG,KAAA,EAAO,aAAA,EAAe,SAAS,EAAE,GAAG,EAAE;AAC7D,SAAO,OAAOY,IAAIC;AACpB;AAKA,SAASjB,IAAW;AACZ,QAAAhC,IAAUN,EAAE,sBACZ0C,IAAK5C,EAAM,eAAeQ,EAAQ,SAAS;AAEjD,SAAAA,EAAQ,IAAI,IAAIE,EAAAA,WAAWF,EAAQ,YAAY,EAAE,GACjDA,EAAQ,KAAKoC,EAAG,KAAK,EAAE,aAAa,GAE7BpC;AACT;AAEA,MAAekD,IAAA;AAAA,EACb,oBAAoBxD,EAAE;AAAA,EACtB,sBAAsBA,EAAE;AAAA,EACxB,qBAAqBA,EAAE;AAAA,EACvB,OAAAE;AAAA,EACA,OAAAoB;AAAA,EACA,UAAAI;AAAA,EACA,aAAAa;AAAA,EACA,sBAAAc;AAAA,EACA,UAAAf;AAAA,EACA,iBAAiBtC,EAAE;AACrB;"}

package/dist/request/leaf7/smCrypto/sm2/sm3.d.ts

@@ -0,0 +1,10 @@
+/**
+ * sm3 本体
+ */
+export declare function sm3(array: any): never[];
+export declare function hmac(input: any, key: any): never[];
+declare const _default: {
+    sm3: typeof sm3;
+    hmac: typeof hmac;
+};
+export default _default;

package/dist/request/leaf7/smCrypto/sm2/sm3.js

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

package/dist/request/leaf7/smCrypto/sm2/sm3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sm3.js","sources":["../../../../../src/request/leaf7/smCrypto/sm2/sm3.ts"],"sourcesContent":["// 消息扩展\r\nconst W = new Uint32Array(68)\r\nconst M = new Uint32Array(64) // W'\r\n\r\n/**\r\n * 循环左移\r\n */\r\nfunction rotl(x, n) {\r\n  const s = n & 31\r\n  return (x << s) | (x >>> (32 - s))\r\n}\r\n\r\n/**\r\n * 二进制异或运算\r\n */\r\nfunction xor(x, y) {\r\n  const result = []\r\n  for (let i = x.length - 1; i >= 0; i--) result[i] = (x[i] ^ y[i]) & 0xff\r\n  return result\r\n}\r\n\r\n/**\r\n * 压缩函数中的置换函数 P0(X) = X xor (X <<< 9) xor (X <<< 17)\r\n */\r\nfunction P0(X) {\r\n  return X ^ rotl(X, 9) ^ rotl(X, 17)\r\n}\r\n\r\n/**\r\n * 消息扩展中的置换函数 P1(X) = X xor (X <<< 15) xor (X <<< 23)\r\n */\r\nfunction P1(X) {\r\n  return X ^ rotl(X, 15) ^ rotl(X, 23)\r\n}\r\n\r\n/**\r\n * sm3 本体\r\n */\r\nexport function sm3(array) {\r\n  let len = array.length * 8\r\n\r\n  // k 是满足 len + 1 + k = 448mod512 的最小的非负整数\r\n  let k = len % 512\r\n  // 如果 448 <= (512 % len) < 512，需要多补充 (len % 448) 比特'0'以满足总比特长度为512的倍数\r\n  k = k >= 448 ? 512 - (k % 448) - 1 : 448 - k - 1\r\n\r\n  // 填充\r\n  const kArr = new Array((k - 7) / 8)\r\n  const lenArr = new Array(8)\r\n  for (let i = 0, len = kArr.length; i < len; i++) kArr[i] = 0\r\n  for (let i = 0, len = lenArr.length; i < len; i++) lenArr[i] = 0\r\n  len = len.toString(2)\r\n  for (let i = 7; i >= 0; i--) {\r\n    if (len.length > 8) {\r\n      const start = len.length - 8\r\n      lenArr[i] = parseInt(len.substr(start), 2)\r\n      len = len.substr(0, start)\r\n    } else if (len.length > 0) {\r\n      lenArr[i] = parseInt(len, 2)\r\n      len = ''\r\n    }\r\n  }\r\n  const m = new Uint8Array([...array, 0x80, ...kArr, ...lenArr])\r\n  const dataView = new DataView(m.buffer, 0)\r\n\r\n  // 迭代压缩\r\n  const n = m.length / 64\r\n  const V = new Uint32Array([0x7380166f, 0x4914b2b9, 0x172442d7, 0xda8a0600, 0xa96f30bc, 0x163138aa, 0xe38dee4d, 0xb0fb0e4e])\r\n  for (let i = 0; i < n; i++) {\r\n    W.fill(0)\r\n    M.fill(0)\r\n\r\n    // 将消息分组B划分为 16 个字 W0， W1，……，W15\r\n    const start = 16 * i\r\n    for (let j = 0; j < 16; j++) {\r\n      W[j] = dataView.getUint32((start + j) * 4, false)\r\n    }\r\n\r\n    // W16 ～ W67：W[j] <- P1(W[j−16] xor W[j−9] xor (W[j−3] <<< 15)) xor (W[j−13] <<< 7) xor W[j−6]\r\n    for (let j = 16; j < 68; j++) {\r\n      W[j] = P1(W[j - 16] ^ W[j - 9] ^ rotl(W[j - 3], 15)) ^ rotl(W[j - 13], 7) ^ W[j - 6]\r\n    }\r\n\r\n    // W′0 ～ W′63：W′[j] = W[j] xor W[j+4]\r\n    for (let j = 0; j < 64; j++) {\r\n      M[j] = W[j] ^ W[j + 4]\r\n    }\r\n\r\n    // 压缩\r\n    const T1 = 0x79cc4519\r\n    const T2 = 0x7a879d8a\r\n    // 字寄存器\r\n    let A = V[0]\r\n    let B = V[1]\r\n    let C = V[2]\r\n    let D = V[3]\r\n    let E = V[4]\r\n    let F = V[5]\r\n    let G = V[6]\r\n    let H = V[7]\r\n    // 中间变量\r\n    let SS1\r\n    let SS2\r\n    let TT1\r\n    let TT2\r\n    let T\r\n    for (let j = 0; j < 64; j++) {\r\n      T = j >= 0 && j <= 15 ? T1 : T2\r\n      SS1 = rotl(rotl(A, 12) + E + rotl(T, j), 7)\r\n      SS2 = SS1 ^ rotl(A, 12)\r\n\r\n      TT1 = (j >= 0 && j <= 15 ? A ^ B ^ C : (A & B) | (A & C) | (B & C)) + D + SS2 + M[j]\r\n      TT2 = (j >= 0 && j <= 15 ? E ^ F ^ G : (E & F) | (~E & G)) + H + SS1 + W[j]\r\n\r\n      D = C\r\n      C = rotl(B, 9)\r\n      B = A\r\n      A = TT1\r\n      H = G\r\n      G = rotl(F, 19)\r\n      F = E\r\n      E = P0(TT2)\r\n    }\r\n\r\n    V[0] ^= A\r\n    V[1] ^= B\r\n    V[2] ^= C\r\n    V[3] ^= D\r\n    V[4] ^= E\r\n    V[5] ^= F\r\n    V[6] ^= G\r\n    V[7] ^= H\r\n  }\r\n\r\n  // 转回 uint8\r\n  const result = []\r\n  for (let i = 0, len = V.length; i < len; i++) {\r\n    const word = V[i]\r\n    result.push((word & 0xff000000) >>> 24, (word & 0xff0000) >>> 16, (word & 0xff00) >>> 8, word & 0xff)\r\n  }\r\n\r\n  return result\r\n}\r\n\r\n/**\r\n * hmac 实现\r\n */\r\nconst blockLen = 64\r\nconst iPad = new Uint8Array(blockLen)\r\nconst oPad = new Uint8Array(blockLen)\r\nfor (let i = 0; i < blockLen; i++) {\r\n  iPad[i] = 0x36\r\n  oPad[i] = 0x5c\r\n}\r\nexport function hmac(input, key) {\r\n  // 密钥填充\r\n  if (key.length > blockLen) key = sm3(key)\r\n  while (key.length < blockLen) key.push(0)\r\n\r\n  const iPadKey = xor(key, iPad)\r\n  const oPadKey = xor(key, oPad)\r\n\r\n  const hash = sm3([...iPadKey, ...input])\r\n  return sm3([...oPadKey, ...hash])\r\n}\r\n\r\nexport default {\r\n  sm3,\r\n  hmac,\r\n}\r\n"],"names":["W","M","rotl","x","n","s","xor","y","result","i","P0","X","P1","sm3","array","len","k","kArr","lenArr","start","dataView","V","j","T1","T2","A","B","C","D","E","F","G","H","SS1","SS2","TT1","TT2","T","word","blockLen","iPad","oPad","hmac","input","key","iPadKey","oPadKey","hash","SM3"],"mappings":"AACA,MAAMA,IAAI,IAAI,YAAY,EAAE,GACtBC,IAAI,IAAI,YAAY,EAAE;AAK5B,SAASC,EAAKC,GAAGC,GAAG;AAClB,QAAMC,IAAID,IAAI;AACN,SAAAD,KAAKE,IAAMF,MAAO,KAAKE;AACjC;AAKA,SAASC,EAAIH,GAAGI,GAAG;AACjB,QAAMC,IAAS,CAAA;AACf,WAASC,IAAIN,EAAE,SAAS,GAAGM,KAAK,GAAGA,IAAY,CAAAD,EAAAC,CAAC,KAAKN,EAAEM,CAAC,IAAIF,EAAEE,CAAC,KAAK;AAC7D,SAAAD;AACT;AAKA,SAASE,EAAGC,GAAG;AACb,SAAOA,IAAIT,EAAKS,GAAG,CAAC,IAAIT,EAAKS,GAAG,EAAE;AACpC;AAKA,SAASC,EAAGD,GAAG;AACb,SAAOA,IAAIT,EAAKS,GAAG,EAAE,IAAIT,EAAKS,GAAG,EAAE;AACrC;AAKO,SAASE,EAAIC,GAAO;AACrB,MAAAC,IAAMD,EAAM,SAAS,GAGrBE,IAAID,IAAM;AAEd,EAAAC,IAAIA,KAAK,MAAM,MAAOA,IAAI,MAAO,IAAI,MAAMA,IAAI;AAG/C,QAAMC,IAAO,IAAI,OAAOD,IAAI,KAAK,CAAC,GAC5BE,IAAS,IAAI,MAAM,CAAC;AACjB,WAAAT,IAAI,GAAGM,IAAME,EAAK,QAAQR,IAAIM,GAAKN,IAAU,CAAAQ,EAAAR,CAAC,IAAI;AAClD,WAAAA,IAAI,GAAGM,IAAMG,EAAO,QAAQT,IAAIM,GAAKN,IAAY,CAAAS,EAAAT,CAAC,IAAI;AACzD,EAAAM,IAAAA,EAAI,SAAS,CAAC;AACpB,WAASN,IAAI,GAAGA,KAAK,GAAGA;AAClB,QAAAM,EAAI,SAAS,GAAG;AACZ,YAAAI,IAAQJ,EAAI,SAAS;AAC3B,MAAAG,EAAOT,CAAC,IAAI,SAASM,EAAI,OAAOI,CAAK,GAAG,CAAC,GACnCJ,IAAAA,EAAI,OAAO,GAAGI,CAAK;AAAA,IAAA,MAC3B,CAAWJ,EAAI,SAAS,MACtBG,EAAOT,CAAC,IAAI,SAASM,GAAK,CAAC,GACrBA,IAAA;AAGJ,QAAA,IAAI,IAAI,WAAW,CAAC,GAAGD,GAAO,KAAM,GAAGG,GAAM,GAAGC,CAAM,CAAC,GACvDE,IAAW,IAAI,SAAS,EAAE,QAAQ,CAAC,GAGnChB,IAAI,EAAE,SAAS,IACfiB,IAAI,IAAI,YAAY,CAAC,YAAY,YAAY,WAAY,YAAY,YAAY,WAAY,YAAY,UAAU,CAAC;AAC1H,WAASZ,IAAI,GAAGA,IAAIL,GAAGK,KAAK;AAC1B,IAAAT,EAAE,KAAK,CAAC,GACRC,EAAE,KAAK,CAAC;AAGR,UAAMkB,IAAQ,KAAKV;AACnB,aAASa,IAAI,GAAGA,IAAI,IAAIA;AACtB,MAAAtB,EAAEsB,CAAC,IAAIF,EAAS,WAAWD,IAAQG,KAAK,GAAG,EAAK;AAIlD,aAASA,IAAI,IAAIA,IAAI,IAAIA;AACvB,MAAAtB,EAAEsB,CAAC,IAAIV,EAAGZ,EAAEsB,IAAI,EAAE,IAAItB,EAAEsB,IAAI,CAAC,IAAIpB,EAAKF,EAAEsB,IAAI,CAAC,GAAG,EAAE,CAAC,IAAIpB,EAAKF,EAAEsB,IAAI,EAAE,GAAG,CAAC,IAAItB,EAAEsB,IAAI,CAAC;AAIrF,aAASA,IAAI,GAAGA,IAAI,IAAIA;AACtB,MAAArB,EAAEqB,CAAC,IAAItB,EAAEsB,CAAC,IAAItB,EAAEsB,IAAI,CAAC;AAIvB,UAAMC,IAAK,YACLC,IAAK;AAEP,QAAAC,IAAIJ,EAAE,CAAC,GACPK,IAAIL,EAAE,CAAC,GACPM,IAAIN,EAAE,CAAC,GACPO,IAAIP,EAAE,CAAC,GACPQ,IAAIR,EAAE,CAAC,GACPS,IAAIT,EAAE,CAAC,GACPU,IAAIV,EAAE,CAAC,GACPW,IAAIX,EAAE,CAAC,GAEPY,GACAC,GACAC,GACAC,GACAC;AACJ,aAASf,IAAI,GAAGA,IAAI,IAAIA;AACtB,MAAAe,IAAIf,KAAK,KAAKA,KAAK,KAAKC,IAAKC,GACvBS,IAAA/B,EAAKA,EAAKuB,GAAG,EAAE,IAAII,IAAI3B,EAAKmC,GAAGf,CAAC,GAAG,CAAC,GACpCY,IAAAD,IAAM/B,EAAKuB,GAAG,EAAE,GAEtBU,KAAOb,KAAK,KAAKA,KAAK,KAAKG,IAAIC,IAAIC,IAAKF,IAAIC,IAAMD,IAAIE,IAAMD,IAAIC,KAAMC,IAAIM,IAAMjC,EAAEqB,CAAC,GACnFc,KAAOd,KAAK,KAAKA,KAAK,KAAKO,IAAIC,IAAIC,IAAKF,IAAIC,IAAM,CAACD,IAAIE,KAAMC,IAAIC,IAAMjC,EAAEsB,CAAC,GAEtEM,IAAAD,GACAA,IAAAzB,EAAKwB,GAAG,CAAC,GACTA,IAAAD,GACAA,IAAAU,GACAH,IAAAD,GACAA,IAAA7B,EAAK4B,GAAG,EAAE,GACVA,IAAAD,GACJA,IAAInB,EAAG0B,CAAG;AAGZ,IAAAf,EAAE,CAAC,KAAKI,GACRJ,EAAE,CAAC,KAAKK,GACRL,EAAE,CAAC,KAAKM,GACRN,EAAE,CAAC,KAAKO,GACRP,EAAE,CAAC,KAAKQ,GACRR,EAAE,CAAC,KAAKS,GACRT,EAAE,CAAC,KAAKU,GACRV,EAAE,CAAC,KAAKW;AAAA,EACV;AAGA,QAAMxB,IAAS,CAAA;AACf,WAASC,IAAI,GAAGM,IAAMM,EAAE,QAAQZ,IAAIM,GAAKN,KAAK;AACtC,UAAA6B,IAAOjB,EAAEZ,CAAC;AACT,IAAAD,EAAA,MAAM8B,IAAO,gBAAgB,KAAKA,IAAO,cAAc,KAAKA,IAAO,WAAY,GAAGA,IAAO,GAAI;AAAA,EACtG;AAEO,SAAA9B;AACT;AAKA,MAAM+B,IAAW,IACXC,IAAO,IAAI,WAAWD,CAAQ,GAC9BE,IAAO,IAAI,WAAWF,CAAQ;AACpC,SAAS9B,IAAI,GAAGA,IAAI8B,GAAU9B;AAC5B,EAAA+B,EAAK/B,CAAC,IAAI,IACVgC,EAAKhC,CAAC,IAAI;AAEI,SAAAiC,EAAKC,GAAOC,GAAK;AAG/B,OADIA,EAAI,SAASL,MAAUK,IAAM/B,EAAI+B,CAAG,IACjCA,EAAI,SAASL,IAAU,CAAAK,EAAI,KAAK,CAAC;AAElC,QAAAC,IAAUvC,EAAIsC,GAAKJ,CAAI,GACvBM,IAAUxC,EAAIsC,GAAKH,CAAI,GAEvBM,IAAOlC,EAAI,CAAC,GAAGgC,GAAS,GAAGF,CAAK,CAAC;AACvC,SAAO9B,EAAI,CAAC,GAAGiC,GAAS,GAAGC,CAAI,CAAC;AAClC;AAEA,MAAeC,IAAA;AAAA,EACb,KAAAnC;AAAA,EACA,MAAA6B;AACF;"}