orion-design 0.1.48 → 0.1.50

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

@@ -0,0 +1,66 @@
+import { ECCurveFp } from './ec';
+/**
+ * 获取公共椭圆曲线
+ */
+declare function getGlobalCurve(): ECCurveFp;
+/**
+ * 生成ecparam
+ */
+declare function generateEcparam(): {
+    curve: ECCurveFp;
+    G: any;
+    n: any;
+};
+/**
+ * 生成密钥对：publicKey = privateKey * G
+ */
+declare function generateKeyPairHex(a: any, b: any, c: any): {
+    privateKey: any;
+    publicKey: string;
+};
+/**
+ * 生成压缩公钥
+ */
+declare function compressPublicKeyHex(s: any): string;
+/**
+ * utf8串转16进制串
+ */
+declare function utf8ToHex(input: any): string;
+/**
+ * 补全16进制字符串
+ */
+declare function leftPad(input: any, num: any): any;
+/**
+ * 转成16进制串
+ */
+declare function arrayToHex(arr: any): any;
+/**
+ * 转成utf8串
+ */
+declare function arrayToUtf8(arr: any): string;
+/**
+ * 转成字节数组
+ */
+declare function hexToArray(hexStr: any): never[];
+/**
+ * 验证公钥是否为椭圆曲线上的点
+ */
+declare function verifyPublicKey(publicKey: any): any;
+/**
+ * 验证公钥是否等价，等价返回true
+ */
+declare function comparePublicKeyHex(publicKey1: any, publicKey2: any): any;
+declare const _default: {
+    getGlobalCurve: typeof getGlobalCurve;
+    generateEcparam: typeof generateEcparam;
+    generateKeyPairHex: typeof generateKeyPairHex;
+    compressPublicKeyHex: typeof compressPublicKeyHex;
+    utf8ToHex: typeof utf8ToHex;
+    leftPad: typeof leftPad;
+    arrayToHex: typeof arrayToHex;
+    arrayToUtf8: typeof arrayToUtf8;
+    hexToArray: typeof hexToArray;
+    verifyPublicKey: typeof verifyPublicKey;
+    comparePublicKeyHex: typeof comparePublicKeyHex;
+};
+export default _default;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sources":["../../../../../src/request/leaf7/smCrypto/sm2/utils.ts"],"sourcesContent":["import { BigInteger, SecureRandom } from 'jsbn'\r\nimport { ECCurveFp } from './ec'\r\n\r\nconst rng = new SecureRandom()\r\nconst { curve, G, n } = generateEcparam()\r\n\r\n/**\r\n * 获取公共椭圆曲线\r\n */\r\nfunction getGlobalCurve() {\r\n  return curve\r\n}\r\n\r\n/**\r\n * 生成ecparam\r\n */\r\nfunction generateEcparam() {\r\n  // 椭圆曲线\r\n  const p = new BigInteger('FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF', 16)\r\n  const a = new BigInteger('FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC', 16)\r\n  const b = new BigInteger('28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93', 16)\r\n  const curve = new ECCurveFp(p, a, b)\r\n\r\n  // 基点\r\n  const gxHex = '32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7'\r\n  const gyHex = 'BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0'\r\n  const G = curve.decodePointHex('04' + gxHex + gyHex)\r\n\r\n  const n = new BigInteger('FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123', 16)\r\n\r\n  return { curve, G, n }\r\n}\r\n\r\n/**\r\n * 生成密钥对：publicKey = privateKey * G\r\n */\r\nfunction generateKeyPairHex(a, b, c) {\r\n  const random = a ? new BigInteger(a, b, c) : new BigInteger(n.bitLength(), rng)\r\n  const d = random.mod(n.subtract(BigInteger.ONE)).add(BigInteger.ONE) // 随机数\r\n  const privateKey = leftPad(d.toString(16), 64)\r\n\r\n  const P = G.multiply(d) // P = dG，p 为公钥，d 为私钥\r\n  const Px = leftPad(P.getX().toBigInteger().toString(16), 64)\r\n  const Py = leftPad(P.getY().toBigInteger().toString(16), 64)\r\n  const publicKey = '04' + Px + Py\r\n\r\n  return { privateKey, publicKey }\r\n}\r\n\r\n/**\r\n * 生成压缩公钥\r\n */\r\nfunction compressPublicKeyHex(s) {\r\n  if (s.length !== 130) throw new Error('Invalid public key to compress')\r\n\r\n  const len = (s.length - 2) / 2\r\n  const xHex = s.substr(2, len)\r\n  const y = new BigInteger(s.substr(len + 2, len), 16)\r\n\r\n  let prefix = '03'\r\n  if (y.mod(new BigInteger('2')).equals(BigInteger.ZERO)) prefix = '02'\r\n\r\n  return prefix + xHex\r\n}\r\n\r\n/**\r\n * utf8串转16进制串\r\n */\r\nfunction utf8ToHex(input) {\r\n  input = unescape(encodeURIComponent(input))\r\n\r\n  const length = input.length\r\n\r\n  // 转换到字数组\r\n  const words = []\r\n  for (let i = 0; i < length; i++) {\r\n    words[i >>> 2] |= (input.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8)\r\n  }\r\n\r\n  // 转换到16进制\r\n  const hexChars = []\r\n  for (let i = 0; i < length; i++) {\r\n    const bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff\r\n    hexChars.push((bite >>> 4).toString(16))\r\n    hexChars.push((bite & 0x0f).toString(16))\r\n  }\r\n\r\n  return hexChars.join('')\r\n}\r\n\r\n/**\r\n * 补全16进制字符串\r\n */\r\nfunction leftPad(input, num) {\r\n  if (input.length >= num) return input\r\n\r\n  return new Array(num - input.length + 1).join('0') + input\r\n}\r\n\r\n/**\r\n * 转成16进制串\r\n */\r\nfunction arrayToHex(arr) {\r\n  return arr\r\n    .map((item) => {\r\n      item = item.toString(16)\r\n      return item.length === 1 ? '0' + item : item\r\n    })\r\n    .join('')\r\n}\r\n\r\n/**\r\n * 转成utf8串\r\n */\r\nfunction arrayToUtf8(arr) {\r\n  const words = []\r\n  let j = 0\r\n  for (let i = 0; i < arr.length * 2; i += 2) {\r\n    words[i >>> 3] |= parseInt(arr[j], 10) << (24 - (i % 8) * 4)\r\n    j++\r\n  }\r\n\r\n  try {\r\n    const latin1Chars = []\r\n\r\n    for (let i = 0; i < arr.length; i++) {\r\n      const bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff\r\n      latin1Chars.push(String.fromCharCode(bite))\r\n    }\r\n\r\n    return decodeURIComponent(escape(latin1Chars.join('')))\r\n  } catch (e) {\r\n    throw new Error('Malformed UTF-8 data')\r\n  }\r\n}\r\n\r\n/**\r\n * 转成字节数组\r\n */\r\nfunction hexToArray(hexStr) {\r\n  const words = []\r\n  let hexStrLength = hexStr.length\r\n\r\n  if (hexStrLength % 2 !== 0) {\r\n    hexStr = leftPad(hexStr, hexStrLength + 1)\r\n  }\r\n\r\n  hexStrLength = hexStr.length\r\n\r\n  for (let i = 0; i < hexStrLength; i += 2) {\r\n    words.push(parseInt(hexStr.substr(i, 2), 16))\r\n  }\r\n  return words\r\n}\r\n\r\n/**\r\n * 验证公钥是否为椭圆曲线上的点\r\n */\r\nfunction verifyPublicKey(publicKey) {\r\n  const point = curve.decodePointHex(publicKey)\r\n  if (!point) return false\r\n\r\n  const x = point.getX()\r\n  const y = point.getY()\r\n\r\n  // 验证 y^2 是否等于 x^3 + ax + b\r\n  return y.square().equals(x.multiply(x.square()).add(x.multiply(curve.a)).add(curve.b))\r\n}\r\n\r\n/**\r\n * 验证公钥是否等价，等价返回true\r\n */\r\nfunction comparePublicKeyHex(publicKey1, publicKey2) {\r\n  const point1 = curve.decodePointHex(publicKey1)\r\n  if (!point1) return false\r\n\r\n  const point2 = curve.decodePointHex(publicKey2)\r\n  if (!point2) return false\r\n\r\n  return point1.equals(point2)\r\n}\r\n\r\nexport default {\r\n  getGlobalCurve,\r\n  generateEcparam,\r\n  generateKeyPairHex,\r\n  compressPublicKeyHex,\r\n  utf8ToHex,\r\n  leftPad,\r\n  arrayToHex,\r\n  arrayToUtf8,\r\n  hexToArray,\r\n  verifyPublicKey,\r\n  comparePublicKeyHex,\r\n}\r\n"],"names":["rng","SecureRandom","curve","G","n","generateEcparam","getGlobalCurve","p","BigInteger","a","b","ECCurveFp","generateKeyPairHex","c","d","privateKey","leftPad","P","Px","Py","publicKey","compressPublicKeyHex","s","len","xHex","y","prefix","utf8ToHex","input","length","words","i","hexChars","bite","num","arrayToHex","arr","item","arrayToUtf8","j","latin1Chars","hexToArray","hexStr","hexStrLength","verifyPublicKey","point","x","comparePublicKeyHex","publicKey1","publicKey2","point1","point2","_"],"mappings":";;AAGA,MAAMA,IAAM,IAAIC,EAAAA,gBACV,EAAE,OAAAC,GAAO,GAAAC,GAAG,GAAAC,MAAMC,EAAgB;AAKxC,SAASC,IAAiB;AACjB,SAAAJ;AACT;AAKA,SAASG,IAAkB;AAEzB,QAAME,IAAI,IAAIC,EAAAA,WAAW,oEAAoE,EAAE,GACzFC,IAAI,IAAID,EAAAA,WAAW,oEAAoE,EAAE,GACzFE,IAAI,IAAIF,EAAAA,WAAW,oEAAoE,EAAE,GACzFN,IAAQ,IAAIS,EAAUJ,GAAGE,GAAGC,CAAC,GAK7BP,IAAID,EAAM,eAAe,OAFjB,qEACA,kEACqC,GAE7CE,IAAI,IAAII,EAAAA,WAAW,oEAAoE,EAAE;AAE/F,SAAO,EAAE,OAAAN,GAAO,GAAAC,GAAG,GAAAC;AACrB;AAKA,SAASQ,EAAmBH,GAAGC,GAAGG,GAAG;AAE7B,QAAAC,KADSL,IAAI,IAAID,EAAA,WAAWC,GAAGC,GAAGG,CAAC,IAAI,IAAIL,EAAAA,WAAWJ,EAAE,aAAaJ,CAAG,GAC7D,IAAII,EAAE,SAASI,aAAW,GAAG,CAAC,EAAE,IAAIA,EAAA,WAAW,GAAG,GAC7DO,IAAaC,EAAQF,EAAE,SAAS,EAAE,GAAG,EAAE,GAEvCG,IAAId,EAAE,SAASW,CAAC,GAChBI,IAAKF,EAAQC,EAAE,KAAK,EAAE,aAAe,EAAA,SAAS,EAAE,GAAG,EAAE,GACrDE,IAAKH,EAAQC,EAAE,KAAK,EAAE,aAAe,EAAA,SAAS,EAAE,GAAG,EAAE,GACrDG,IAAY,OAAOF,IAAKC;AAEvB,SAAA,EAAE,YAAAJ,GAAY,WAAAK;AACvB;AAKA,SAASC,EAAqBC,GAAG;AAC/B,MAAIA,EAAE,WAAW,IAAW,OAAA,IAAI,MAAM,gCAAgC;AAEhE,QAAAC,KAAOD,EAAE,SAAS,KAAK,GACvBE,IAAOF,EAAE,OAAO,GAAGC,CAAG,GACtBE,IAAI,IAAIjB,EAAW,WAAAc,EAAE,OAAOC,IAAM,GAAGA,CAAG,GAAG,EAAE;AAEnD,MAAIG,IAAS;AACT,SAAAD,EAAE,IAAI,IAAIjB,EAAAA,WAAW,GAAG,CAAC,EAAE,OAAOA,aAAW,IAAI,MAAYkB,IAAA,OAE1DA,IAASF;AAClB;AAKA,SAASG,EAAUC,GAAO;AAChB,EAAAA,IAAA,SAAS,mBAAmBA,CAAK,CAAC;AAE1C,QAAMC,IAASD,EAAM,QAGfE,IAAQ,CAAA;AACd,WAASC,IAAI,GAAGA,IAAIF,GAAQE;AACpB,IAAAD,EAAAC,MAAM,CAAC,MAAMH,EAAM,WAAWG,CAAC,IAAI,QAAU,KAAMA,IAAI,IAAK;AAIpE,QAAMC,IAAW,CAAA;AACjB,WAASD,IAAI,GAAGA,IAAIF,GAAQE,KAAK;AACzB,UAAAE,IAAQH,EAAMC,MAAM,CAAC,MAAO,KAAMA,IAAI,IAAK,IAAM;AACvD,IAAAC,EAAS,MAAMC,MAAS,GAAG,SAAS,EAAE,CAAC,GACvCD,EAAS,MAAMC,IAAO,IAAM,SAAS,EAAE,CAAC;AAAA,EAC1C;AAEO,SAAAD,EAAS,KAAK,EAAE;AACzB;AAKA,SAAShB,EAAQY,GAAOM,GAAK;AACvB,SAAAN,EAAM,UAAUM,IAAYN,IAEzB,IAAI,MAAMM,IAAMN,EAAM,SAAS,CAAC,EAAE,KAAK,GAAG,IAAIA;AACvD;AAKA,SAASO,EAAWC,GAAK;AAChB,SAAAA,EACJ,IAAI,CAACC,OACGA,IAAAA,EAAK,SAAS,EAAE,GAChBA,EAAK,WAAW,IAAI,MAAMA,IAAOA,EACzC,EACA,KAAK,EAAE;AACZ;AAKA,SAASC,EAAYF,GAAK;AACxB,QAAMN,IAAQ,CAAA;AACd,MAAIS,IAAI;AACR,WAASR,IAAI,GAAGA,IAAIK,EAAI,SAAS,GAAGL,KAAK;AACjC,IAAAD,EAAAC,MAAM,CAAC,KAAK,SAASK,EAAIG,CAAC,GAAG,EAAE,KAAM,KAAMR,IAAI,IAAK,GAC1DQ;AAGE,MAAA;AACF,UAAMC,IAAc,CAAA;AAEpB,aAAST,IAAI,GAAGA,IAAIK,EAAI,QAAQL,KAAK;AAC7B,YAAAE,IAAQH,EAAMC,MAAM,CAAC,MAAO,KAAMA,IAAI,IAAK,IAAM;AACvD,MAAAS,EAAY,KAAK,OAAO,aAAaP,CAAI,CAAC;AAAA,IAC5C;AAEA,WAAO,mBAAmB,OAAOO,EAAY,KAAK,EAAE,CAAC,CAAC;AAAA,UAC5C;AACJ,UAAA,IAAI,MAAM,sBAAsB;AAAA,EACxC;AACF;AAKA,SAASC,EAAWC,GAAQ;AAC1B,QAAMZ,IAAQ,CAAA;AACd,MAAIa,IAAeD,EAAO;AAEtB,EAAAC,IAAe,MAAM,MACdD,IAAA1B,EAAQ0B,GAAQC,IAAe,CAAC,IAG3CA,IAAeD,EAAO;AAEtB,WAASX,IAAI,GAAGA,IAAIY,GAAcZ,KAAK;AAC/B,IAAAD,EAAA,KAAK,SAASY,EAAO,OAAOX,GAAG,CAAC,GAAG,EAAE,CAAC;AAEvC,SAAAD;AACT;AAKA,SAASc,EAAgBxB,GAAW;AAC5B,QAAAyB,IAAQ3C,EAAM,eAAekB,CAAS;AACxC,MAAA,CAACyB,EAAc,QAAA;AAEb,QAAAC,IAAID,EAAM;AAIT,SAHGA,EAAM,OAGP,SAAS,OAAOC,EAAE,SAASA,EAAE,QAAQ,EAAE,IAAIA,EAAE,SAAS5C,EAAM,CAAC,CAAC,EAAE,IAAIA,EAAM,CAAC,CAAC;AACvF;AAKA,SAAS6C,EAAoBC,GAAYC,GAAY;AAC7C,QAAAC,IAAShD,EAAM,eAAe8C,CAAU;AAC1C,MAAA,CAACE,EAAe,QAAA;AAEd,QAAAC,IAASjD,EAAM,eAAe+C,CAAU;AAC1C,SAACE,IAEED,EAAO,OAAOC,CAAM,IAFP;AAGtB;AAEA,MAAeC,IAAA;AAAA,EACb,gBAAA9C;AAAA,EACA,iBAAAD;AAAA,EACA,oBAAAO;AAAA,EACA,sBAAAS;AAAA,EACA,WAAAM;AAAA,EACA,SAAAX;AAAA,EACA,YAAAmB;AAAA,EACA,aAAAG;AAAA,EACA,YAAAG;AAAA,EACA,iBAAAG;AAAA,EACA,qBAAAG;AACF;"}

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

@@ -0,0 +1 @@
+export default function (input: any, options?: any): any;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../src/request/leaf7/smCrypto/sm3/index.ts"],"sourcesContent":["import { sm3, hmac } from '../sm2/sm3'\r\n\r\n/**\r\n * 补全16进制字符串\r\n */\r\nfunction leftPad(input, num) {\r\n  if (input.length >= num) return input\r\n\r\n  return new Array(num - input.length + 1).join('0') + input\r\n}\r\n\r\n/**\r\n * 字节数组转 16 进制串\r\n */\r\nfunction ArrayToHex(arr) {\r\n  return arr\r\n    .map((item) => {\r\n      item = item.toString(16)\r\n      return item.length === 1 ? '0' + item : item\r\n    })\r\n    .join('')\r\n}\r\n\r\n/**\r\n * 转成字节数组\r\n */\r\nfunction hexToArray(hexStr) {\r\n  const words = []\r\n  let hexStrLength = hexStr.length\r\n\r\n  if (hexStrLength % 2 !== 0) {\r\n    hexStr = leftPad(hexStr, hexStrLength + 1)\r\n  }\r\n\r\n  hexStrLength = hexStr.length\r\n\r\n  for (let i = 0; i < hexStrLength; i += 2) {\r\n    words.push(parseInt(hexStr.substr(i, 2), 16))\r\n  }\r\n  return words\r\n}\r\n\r\n/**\r\n * utf8 串转字节数组\r\n */\r\nfunction utf8ToArray(str) {\r\n  const arr = []\r\n\r\n  for (let i = 0, len = str.length; i < len; i++) {\r\n    const point = str.codePointAt(i)\r\n\r\n    if (point <= 0x007f) {\r\n      // 单字节，标量值：00000000 00000000 0zzzzzzz\r\n      arr.push(point)\r\n    } else if (point <= 0x07ff) {\r\n      // 双字节，标量值：00000000 00000yyy yyzzzzzz\r\n      arr.push(0xc0 | (point >>> 6)) // 110yyyyy（0xc0-0xdf）\r\n      arr.push(0x80 | (point & 0x3f)) // 10zzzzzz（0x80-0xbf）\r\n    } else if (point <= 0xd7ff || (point >= 0xe000 && point <= 0xffff)) {\r\n      // 三字节：标量值：00000000 xxxxyyyy yyzzzzzz\r\n      arr.push(0xe0 | (point >>> 12)) // 1110xxxx（0xe0-0xef）\r\n      arr.push(0x80 | ((point >>> 6) & 0x3f)) // 10yyyyyy（0x80-0xbf）\r\n      arr.push(0x80 | (point & 0x3f)) // 10zzzzzz（0x80-0xbf）\r\n    } else if (point >= 0x010000 && point <= 0x10ffff) {\r\n      // 四字节：标量值：000wwwxx xxxxyyyy yyzzzzzz\r\n      i++\r\n      arr.push(0xf0 | ((point >>> 18) & 0x1c)) // 11110www（0xf0-0xf7）\r\n      arr.push(0x80 | ((point >>> 12) & 0x3f)) // 10xxxxxx（0x80-0xbf）\r\n      arr.push(0x80 | ((point >>> 6) & 0x3f)) // 10yyyyyy（0x80-0xbf）\r\n      arr.push(0x80 | (point & 0x3f)) // 10zzzzzz（0x80-0xbf）\r\n    } else {\r\n      // 五、六字节，暂时不支持\r\n      arr.push(point)\r\n      throw new Error('input is not supported')\r\n    }\r\n  }\r\n\r\n  return arr\r\n}\r\n\r\nexport default function (input, options?) {\r\n  input = typeof input === 'string' ? utf8ToArray(input) : Array.prototype.slice.call(input)\r\n\r\n  if (options) {\r\n    const mode = options.mode || 'hmac'\r\n    if (mode !== 'hmac') throw new Error('invalid mode')\r\n\r\n    let key = options.key\r\n    if (!key) throw new Error('invalid key')\r\n\r\n    key = typeof key === 'string' ? hexToArray(key) : Array.prototype.slice.call(key)\r\n    return ArrayToHex(hmac(input, key))\r\n  }\r\n\r\n  return ArrayToHex(sm3(input))\r\n}\r\n"],"names":["leftPad","input","num","ArrayToHex","arr","item","hexToArray","hexStr","words","hexStrLength","i","utf8ToArray","str","len","point","sm3","options","key","hmac"],"mappings":";AAKA,SAASA,EAAQC,GAAOC,GAAK;AACvB,SAAAD,EAAM,UAAUC,IAAYD,IAEzB,IAAI,MAAMC,IAAMD,EAAM,SAAS,CAAC,EAAE,KAAK,GAAG,IAAIA;AACvD;AAKA,SAASE,EAAWC,GAAK;AAChB,SAAAA,EACJ,IAAI,CAACC,OACGA,IAAAA,EAAK,SAAS,EAAE,GAChBA,EAAK,WAAW,IAAI,MAAMA,IAAOA,EACzC,EACA,KAAK,EAAE;AACZ;AAKA,SAASC,EAAWC,GAAQ;AAC1B,QAAMC,IAAQ,CAAA;AACd,MAAIC,IAAeF,EAAO;AAEtB,EAAAE,IAAe,MAAM,MACdF,IAAAP,EAAQO,GAAQE,IAAe,CAAC,IAG3CA,IAAeF,EAAO;AAEtB,WAASG,IAAI,GAAGA,IAAID,GAAcC,KAAK;AAC/B,IAAAF,EAAA,KAAK,SAASD,EAAO,OAAOG,GAAG,CAAC,GAAG,EAAE,CAAC;AAEvC,SAAAF;AACT;AAKA,SAASG,EAAYC,GAAK;AACxB,QAAMR,IAAM,CAAA;AAEZ,WAASM,IAAI,GAAGG,IAAMD,EAAI,QAAQF,IAAIG,GAAKH,KAAK;AACxC,UAAAI,IAAQF,EAAI,YAAYF,CAAC;AAE/B,QAAII,KAAS;AAEX,MAAAV,EAAI,KAAKU,CAAK;AAAA,aACLA,KAAS;AAEd,MAAAV,EAAA,KAAK,MAAQU,MAAU,CAAE,GACzBV,EAAA,KAAK,MAAQU,IAAQ,EAAK;AAAA,aACrBA,KAAS,SAAWA,KAAS,SAAUA,KAAS;AAErD,MAAAV,EAAA,KAAK,MAAQU,MAAU,EAAG,GAC9BV,EAAI,KAAK,MAASU,MAAU,IAAK,EAAK,GAClCV,EAAA,KAAK,MAAQU,IAAQ,EAAK;AAAA,aACrBA,KAAS,SAAYA,KAAS;AAEvC,MAAAJ,KACAN,EAAI,KAAK,MAASU,MAAU,KAAM,EAAK,GACvCV,EAAI,KAAK,MAASU,MAAU,KAAM,EAAK,GACvCV,EAAI,KAAK,MAASU,MAAU,IAAK,EAAK,GAClCV,EAAA,KAAK,MAAQU,IAAQ,EAAK;AAAA;AAG9B,YAAAV,EAAI,KAAKU,CAAK,GACR,IAAI,MAAM,wBAAwB;AAAA,EAE5C;AAEO,SAAAV;AACT;AAEA,SAAAW,EAAyBd,GAAOe,GAAU;AAGxC,MAFQf,IAAA,OAAOA,KAAU,WAAWU,EAAYV,CAAK,IAAI,MAAM,UAAU,MAAM,KAAKA,CAAK,GAErFe,GAAS;AAEX,SADaA,EAAQ,QAAQ,YAChB,OAAc,OAAA,IAAI,MAAM,cAAc;AAEnD,QAAIC,IAAMD,EAAQ;AAClB,QAAI,CAACC,EAAW,OAAA,IAAI,MAAM,aAAa;AAEjC,WAAAA,IAAA,OAAOA,KAAQ,WAAWX,EAAWW,CAAG,IAAI,MAAM,UAAU,MAAM,KAAKA,CAAG,GACzEd,EAAWe,EAAKjB,GAAOgB,CAAG,CAAC;AAAA,EACpC;AAEO,SAAAd,EAAWY,EAAId,CAAK,CAAC;AAC9B;"}

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

@@ -0,0 +1,5 @@
+declare const _default: {
+    _s4EN(inArray: any, key: any, options: any): any;
+    _s4DE(inArray: any, key: any, options: any): any;
+};
+export default _default;

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

@@ -0,0 +1,399 @@
+const w = [
+  214,
+  144,
+  233,
+  254,
+  204,
+  225,
+  61,
+  183,
+  22,
+  182,
+  20,
+  194,
+  40,
+  251,
+  44,
+  5,
+  43,
+  103,
+  154,
+  118,
+  42,
+  190,
+  4,
+  195,
+  170,
+  68,
+  19,
+  38,
+  73,
+  134,
+  6,
+  153,
+  156,
+  66,
+  80,
+  244,
+  145,
+  239,
+  152,
+  122,
+  51,
+  84,
+  11,
+  67,
+  237,
+  207,
+  172,
+  98,
+  228,
+  179,
+  28,
+  169,
+  201,
+  8,
+  232,
+  149,
+  128,
+  223,
+  148,
+  250,
+  117,
+  143,
+  63,
+  166,
+  71,
+  7,
+  167,
+  252,
+  243,
+  115,
+  23,
+  186,
+  131,
+  89,
+  60,
+  25,
+  230,
+  133,
+  79,
+  168,
+  104,
+  107,
+  129,
+  178,
+  113,
+  100,
+  218,
+  139,
+  248,
+  235,
+  15,
+  75,
+  112,
+  86,
+  157,
+  53,
+  30,
+  36,
+  14,
+  94,
+  99,
+  88,
+  209,
+  162,
+  37,
+  34,
+  124,
+  59,
+  1,
+  33,
+  120,
+  135,
+  212,
+  0,
+  70,
+  87,
+  159,
+  211,
+  39,
+  82,
+  76,
+  54,
+  2,
+  231,
+  160,
+  196,
+  200,
+  158,
+  234,
+  191,
+  138,
+  210,
+  64,
+  199,
+  56,
+  181,
+  163,
+  247,
+  242,
+  206,
+  249,
+  97,
+  21,
+  161,
+  224,
+  174,
+  93,
+  164,
+  155,
+  52,
+  26,
+  85,
+  173,
+  147,
+  50,
+  48,
+  245,
+  140,
+  177,
+  227,
+  29,
+  246,
+  226,
+  46,
+  130,
+  102,
+  202,
+  96,
+  192,
+  41,
+  35,
+  171,
+  13,
+  83,
+  78,
+  111,
+  213,
+  219,
+  55,
+  69,
+  222,
+  253,
+  142,
+  47,
+  3,
+  255,
+  106,
+  114,
+  109,
+  108,
+  91,
+  81,
+  141,
+  27,
+  175,
+  146,
+  187,
+  221,
+  188,
+  127,
+  17,
+  217,
+  92,
+  65,
+  31,
+  16,
+  90,
+  216,
+  10,
+  193,
+  49,
+  136,
+  165,
+  205,
+  123,
+  189,
+  45,
+  116,
+  208,
+  18,
+  184,
+  229,
+  180,
+  176,
+  137,
+  105,
+  151,
+  74,
+  12,
+  150,
+  119,
+  126,
+  101,
+  185,
+  241,
+  9,
+  197,
+  110,
+  198,
+  132,
+  24,
+  240,
+  125,
+  236,
+  58,
+  220,
+  77,
+  32,
+  121,
+  238,
+  95,
+  62,
+  215,
+  203,
+  57,
+  72
+], P = [
+  462357,
+  472066609,
+  943670861,
+  1415275113,
+  1886879365,
+  2358483617,
+  2830087869,
+  3301692121,
+  3773296373,
+  4228057617,
+  404694573,
+  876298825,
+  1347903077,
+  1819507329,
+  2291111581,
+  2762715833,
+  3234320085,
+  3705924337,
+  4177462797,
+  337322537,
+  808926789,
+  1280531041,
+  1752135293,
+  2223739545,
+  2695343797,
+  3166948049,
+  3638552301,
+  4110090761,
+  269950501,
+  741554753,
+  1213159005,
+  1684763257
+];
+function g(t) {
+  const e = [];
+  for (let o = 0, s = t.length; o < s; o += 2)
+    e.push(parseInt(t.substr(o, 2), 16));
+  return e;
+}
+function Y(t) {
+  return t.map((e) => (e = e.toString(16), e.length === 1 ? "0" + e : e)).join("");
+}
+function B(t) {
+  const e = [];
+  for (let o = 0, s = t.length; o < s; o++) {
+    const i = t.codePointAt(o);
+    if (i <= 127)
+      e.push(i);
+    else if (i <= 2047)
+      e.push(192 | i >>> 6), e.push(128 | i & 63);
+    else if (i <= 55295 || i >= 57344 && i <= 65535)
+      e.push(224 | i >>> 12), e.push(128 | i >>> 6 & 63), e.push(128 | i & 63);
+    else if (i >= 65536 && i <= 1114111)
+      o++, e.push(240 | i >>> 18 & 28), e.push(128 | i >>> 12 & 63), e.push(128 | i >>> 6 & 63), e.push(128 | i & 63);
+    else
+      throw e.push(i), new Error("input is not supported");
+  }
+  return e;
+}
+function m(t) {
+  const e = [];
+  for (let o = 0, s = t.length; o < s; o++)
+    t[o] >= 240 && t[o] <= 247 ? (e.push(String.fromCodePoint(((t[o] & 7) << 18) + ((t[o + 1] & 63) << 12) + ((t[o + 2] & 63) << 6) + (t[o + 3] & 63))), o += 3) : t[o] >= 224 && t[o] <= 239 ? (e.push(String.fromCodePoint(((t[o] & 15) << 12) + ((t[o + 1] & 63) << 6) + (t[o + 2] & 63))), o += 2) : t[o] >= 192 && t[o] <= 223 ? (e.push(String.fromCodePoint(((t[o] & 31) << 6) + (t[o + 1] & 63))), o++) : e.push(String.fromCodePoint(t[o]));
+  return e.join("");
+}
+function p(t, e) {
+  const o = e & 31;
+  return t << o | t >>> 32 - o;
+}
+function h(t) {
+  return (w[t >>> 24 & 255] & 255) << 24 | (w[t >>> 16 & 255] & 255) << 16 | (w[t >>> 8 & 255] & 255) << 8 | w[t & 255] & 255;
+}
+function T(t) {
+  return t ^ p(t, 2) ^ p(t, 10) ^ p(t, 18) ^ p(t, 24);
+}
+function D(t) {
+  return t ^ p(t, 13) ^ p(t, 23);
+}
+function S(t, e, o) {
+  const s = new Array(4), i = new Array(4);
+  for (let n = 0; n < 4; n++)
+    i[0] = t[4 * n] & 255, i[1] = t[4 * n + 1] & 255, i[2] = t[4 * n + 2] & 255, i[3] = t[4 * n + 3] & 255, s[n] = i[0] << 24 | i[1] << 16 | i[2] << 8 | i[3];
+  for (let n = 0, f; n < 32; n += 4)
+    f = s[1] ^ s[2] ^ s[3] ^ o[n + 0], s[0] ^= T(h(f)), f = s[2] ^ s[3] ^ s[0] ^ o[n + 1], s[1] ^= T(h(f)), f = s[3] ^ s[0] ^ s[1] ^ o[n + 2], s[2] ^= T(h(f)), f = s[0] ^ s[1] ^ s[2] ^ o[n + 3], s[3] ^= T(h(f));
+  for (let n = 0; n < 16; n += 4)
+    e[n] = s[3 - n / 4] >>> 24 & 255, e[n + 1] = s[3 - n / 4] >>> 16 & 255, e[n + 2] = s[3 - n / 4] >>> 8 & 255, e[n + 3] = s[3 - n / 4] & 255;
+}
+function x(t, e, o) {
+  const s = new Array(4), i = new Array(4);
+  for (let n = 0; n < 4; n++)
+    i[0] = t[0 + 4 * n] & 255, i[1] = t[1 + 4 * n] & 255, i[2] = t[2 + 4 * n] & 255, i[3] = t[3 + 4 * n] & 255, s[n] = i[0] << 24 | i[1] << 16 | i[2] << 8 | i[3];
+  s[0] ^= 2746333894, s[1] ^= 1453994832, s[2] ^= 1736282519, s[3] ^= 2993693404;
+  for (let n = 0, f; n < 32; n += 4)
+    f = s[1] ^ s[2] ^ s[3] ^ P[n + 0], e[n + 0] = s[0] ^= D(h(f)), f = s[2] ^ s[3] ^ s[0] ^ P[n + 1], e[n + 1] = s[1] ^= D(h(f)), f = s[3] ^ s[0] ^ s[1] ^ P[n + 2], e[n + 2] = s[2] ^= D(h(f)), f = s[0] ^ s[1] ^ s[2] ^ P[n + 3], e[n + 3] = s[3] ^= D(h(f));
+  if (o === 0)
+    for (let n = 0, f; n < 16; n++)
+      f = e[n], e[n] = e[31 - n], e[31 - n] = f;
+}
+function L(t, e, o, { padding: s = "pkcs#7", mode: i, iv: n = [], output: f = "string" } = {}) {
+  if (i === "cbc" && (typeof n == "string" && (n = g(n)), n.length !== 128 / 8))
+    throw new Error("iv is invalid");
+  if (typeof e == "string" && (e = g(e)), e.length !== 128 / 8)
+    throw new Error("key is invalid");
+  if (typeof t == "string" ? o !== 0 ? t = B(t) : t = g(t) : t = [...t], (s === "pkcs#5" || s === "pkcs#7") && o !== 0) {
+    const r = 16 - t.length % 16;
+    for (let c = 0; c < r; c++) t.push(r);
+  }
+  const R = new Array(32);
+  x(e, R, o);
+  const u = [];
+  let C = n, O = t.length, E = 0;
+  for (; O >= 16; ) {
+    const r = t.slice(E, E + 16), c = new Array(16);
+    if (i === "cbc")
+      for (let l = 0; l < 16; l++)
+        o !== 0 && (r[l] ^= C[l]);
+    S(r, c, R);
+    for (let l = 0; l < 16; l++)
+      i === "cbc" && o === 0 && (c[l] ^= C[l]), u[E + l] = c[l];
+    i === "cbc" && (o !== 0 ? C = c : C = r), O -= 16, E += 16;
+  }
+  if ((s === "pkcs#5" || s === "pkcs#7") && o === 0) {
+    const r = u.length, c = u[r - 1];
+    for (let l = 1; l <= c; l++)
+      if (u[r - l] !== c) throw new Error("padding is invalid");
+    u.splice(r - c, c);
+  }
+  return f !== "array" ? o !== 0 ? Y(u) : m(u) : u;
+}
+const j = {
+  _s4EN(t, e, o) {
+    return L(t, e, 1, o);
+  },
+  _s4DE(t, e, o) {
+    return L(t, e, 0, o);
+  }
+};
+export {
+  j as default
+};
+//# sourceMappingURL=index.js.map