devbox
weixin_40725706
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

nodejs最新某东h5st(4.7.2)参数分析与javascript逆向纯算法还原（含算法源码）（2024-06-09）_h5st 4.7.2

作者：weixin_40725706 | 2024-06-14 08:53:51

赞

踩

h5st 4.7.2

一、作者声明：


    文章仅供学习交流与参考！严禁用于任何商业与非法用途！否则由此产生的一切后果均与作者无关！如有侵权，请联系作者本人进行删除！

二 、写在前面


   h5st从4.1一路更新到4.7.2，逐渐vmp化，基本稳定下来。现在小版本也是更新不断！不过小版本并不会受到太大的一个影响，本次文章更新的算法分析还原为最新4.7大版本下的4.7.2小版本～～
  没有x-api-eid-token--->会出现风控 没有h5st--->不稳定能拿到数据 只有正确的h5st才能百分百拿到数据。


三、 加密分析


首先，看看核心点，目前全部VMP化，先把加密值拿出来，如下所示：

20240606160042598%3Bm9itny6zz9mmzmm8%3Bfb5df%3Btk03wb4481c2018nYOtAQRSkhO0LLdsml3SszMlxWFvYj0i6XQo1LAbkMv9JbG6wNADMG4bnX7gJZU5uVci2a_ujP8FU%3B5be08ae1ec26b3f5fdb2b4874534a585c28e0239ddd73aba69133354d343c387%3B4.7%3B1717660842598%3BTKmWl61wPiYmFVY91TfdhoEOxdR4256MojfrTtc1mdzUsiISbK4CQ3KX7VKYlhPyEGtomiZzVrD2j3uG32O3PONJMz22FBH1L_aFBlrQHqxzWCQ0bBGt1_9VJj0Nc2MW3fbAH2q2uaeaHjOEa-zrzOQZR872Veu4c28_B_WWBD36YLdhIWIFUa6nLG5eaN5Fxn-HYKqRo-1C5SJvhi4UNCR7NMVLrBt9W8ZzgTnmPaCKYQpzvqvXbi9o7JHP8kpxuj831cnf35PscS8sdppanAGEyS-ZLTKzhZZtF59jj3FxmZN27ZHSN7tImxDcfrrh3DM6kbMy4mYy5CEgzyfQlVEPFB1OoQgtz2r2MSfCsMCxNB99KeSzZgjmmdkpl6AC7cEzggE7nDk8PeheJO0dl8zjLad9Prk3hGJ0DQIeqffFGvzEemLTD52YgeDqWQHLXbk3

4.2之前是没有sign签名段的，可以看到整个加密参数的值跟4.2是有区别的！同样经过多块组合拼接而成的 ，最新的以分号拆开大约分为8个部分了！

第一部分是一个时间格式的字符串，后续我们可以自行生成

第二部分则是fingerprint指纹，这个是需要算法生成的，第三部分可固定

第四部分tk则拼接多个参数加上指纹通过加密算法生成

第五部分签名Sign参数，通过对Token、fingerprint、时间戳、APPID

第六部分分别是算法的版本号以及时间戳！这个自行填写

第七部分时间戳

第八部分的大长串则是上面参数经过最终AES加密生成

四、 算法还原


1、第一部分，时间参代码


接下来按上面拆分出来的几部分，附上扣出来的算法并附上讲解，第一部分，时间参代码实现如下：

  1. function timestampToFormat(timestamp) {
  2.     const date = new Date(timestamp);
  3.     const pad = (num, size) => String(num).padStart(size, '0');
  4.     return `${date.getFullYear()}${pad(date.getMonth() + 1, 2)}${pad(date.getDate(), 2)}${pad(date.getHours(), 2)}${pad(date.getMinutes(), 2)}${pad(date.getSeconds(), 2)}${pad(date.getMilliseconds(), 3)}`;
  5. }

2、第二部分，FP指纹


第二部分我们需要还原的是FP的指纹，加密算法实现如下：
 

  1. !function () {
  2.     function t(e) {
  3.         for (var t = "", r = 0; r < e.length;) {
  4.             var n = e.charCodeAt(r++);
  5.             t += n > 63 ? String.fromCharCode(32 ^ n) : 35 == n ? e.charAt(r++) : String.fromCharCode(n)
  6.         }
  7.         return t
  8.     }
  9.  
  10.     var r = [t("SIZE"), "num", t("SPLIT"), "", t("DEFAULT"), t("CALL"), t("PUSH"), "pop", t("TOsTRING"), t("JOIN"), t("DEFAULT"), t("CALL"), t("REPLACE"), ""]
  11.         , n = Function.prototype.call
  12.         ,
  13.         a = [2, 66, 17, 98, 16, 25, 286, 76, 37, 17, 58, 16, 13, 25, -2821, 25, -8150, 68, 25, 10976, 68, 91, 74, 17, 26, 16, 4, 78, 17, 73, 16, 13, 7, 91, 62, 17, 36, 16, 32, 88, 80, 0, 46, 80, 1, 76, 7, 68, 36, 16, 32, 25, -3718, 25, 2322, 68, 25, 1412, 68, 25, 575, 25, 6105, 68, 25, -6675, 68, 3, 88, 3, 25, 6578, 25, -9306, 68, 25, 2729, 68, 3, 80, 0, 46, 80, 1, 76, 68, 88, 68, 5, 17, 48, 70, 2, 52, 3, 76, 54, 17, 63, 17, 60, 93, 4, 40, 72, 76, 70, 5, 72, 25, 8402, 25, -5374, 68, 25, -3028, 68, 25, -8134, 25, -8213, 68, 25, 16362, 68, 65, 71, 17, 63, 17, 60, 93, 4, 40, 72, 76, 70, 5, 72, 25, 6175, 25, 4230, 68, 25, -10390, 68, 91, 79, 17, 67, 0, 33, 17, 30, 45, 95, 70, 6, 25, -5057, 25, 6375, 68, 25, -1283, 68, 63, 17, 49, 93, 4, 40, 87, 70, 7, 4, 25, 3357, 25, -5902, 68, 25, 2581, 68, 91, 3, 70, 8, 25, -8817, 25, 8543, 68, 25, 310, 68, 76, 76, 17, 87, 51, 25, 8755, 25, -8004, 68, 25, -751, 68, 34, 42, -56, 63, 17, 69, 93, 4, 40, 95, 76, 70, 5, 95, 14, 91, 33, 17, 95, 70, 9, 52, 3, 76, 29, 17, 27, 90, 39, 73, -2215, 73, -5180, 68, 73, 7395, 68, 94, 58, 50, 44, 49, 58, 76, 21, 0, 71, 4, 93, 70, 1, 4, 11, 79, 22, 84, 55, 58, 82, 73, -6046, 73, -7717, 68, 73, 13764, 68, 2, 60, 86, 11, 4, 70, 2, 11, 79, 22, 98, 3, 84, 39, 58, 27, 58, 79, 11, 36, 74, 91, -48, 4, 90, 20]
  14.         , o = zk
  15.         , i = Array.from
  16.         , c = Symbol
  17.         , s = eh
  18.         , u = Array.isArray
  19.         , l = Og.exports;
  20.  
  21.     var generateVisitKey = function () {
  22.         for (var e, t, o, i, c, s, u, l, p, v, d, _, x = n, S = a, A = [], E = 0; ;)
  23.             switch (S[E++]) {
  24.                 case 2:
  25.                     A.push(y);
  26.                     break;
  27.                 case 3:
  28.                     _ = A.pop(),
  29.                         A[A.length - 1] -= _;
  30.                     break;
  31.                 case 4:
  32.                     null != A[A.length - 1] ? A[A.length - 2] = x.call(A[A.length - 2], A[A.length - 1]) : (_ = A[A.length - 2],
  33.                         A[A.length - 2] = _()),
  34.                         A.length--;
  35.                     break;
  36.                 case 5:
  37.                     s = A[A.length - 1];
  38.                     break;
  39.                 case 7:
  40.                     A.push(o);
  41.                     break;
  42.                 case 13:
  43.                     A.push(t);
  44.                     break;
  45.                 case 14:
  46.                     A.push(p);
  47.                     break;
  48.                 case 16:
  49.                     A.push(null);
  50.                     break;
  51.                 case 17:
  52.                     A.pop();
  53.                     break;
  54.                 case 25:
  55.                     A.push(S[E++]);
  56.                     break;
  57.                 case 26:
  58.                     A.push(b);
  59.                     break;
  60.                 case 27:
  61.                     A.push(d);
  62.                     break;
  63.                 case 29:
  64.                     d = A[A.length - 1];
  65.                     break;
  66.                 case 30:
  67.                     E += S[E];
  68.                     break;
  69.                 case 32:
  70.                     A.push({});
  71.                     break;
  72.                 case 33:
  73.                     v = A[A.length - 1];
  74.                     break;
  75.                 case 34:
  76.                     _ = A.pop(),
  77.                         A[A.length - 1] = A[A.length - 1] > _;
  78.                     break;
  79.                 case 36:
  80.                     A.push(m);
  81.                     break;
  82.                 case 37:
  83.                     t = A[A.length - 1];
  84.                     break;
  85.                 case 39:
  86.                     return;
  87.                 case 40:
  88.                     A.push(void 0);
  89.                     break;
  90.                 case 42:
  91.                     A.pop() ? E += S[E] : ++E;
  92.                     break;
  93.                 case 46:
  94.                     A.push(c);
  95.                     break;
  96.                 case 48:
  97.                     A.push(s);
  98.                     break;
  99.                 case 49:
  100.                     A.push(h);
  101.                     break;
  102.                 case 51:
  103.                     A[A.length - 1] = A[A.length - 1].length;
  104.                     break;
  105.                 case 52:
  106.                     A.push(r[S[E++]]);
  107.                     break;
  108.                 case 54:
  109.                     u = A[A.length - 1];
  110.                     break;
  111.                 case 58:
  112.                     A.push(k);
  113.                     break;
  114.                 case 60:
  115.                     A.push(f);
  116.                     break;
  117.                 case 62:
  118.                     c = A[A.length - 1];
  119.                     break;
  120.                 case 63:
  121.                     A.push(0);
  122.                     break;
  123.                 case 65:
  124.                     A[A.length - 5] = x.call(A[A.length - 5], A[A.length - 4], A[A.length - 3], A[A.length - 2], A[A.length - 1]),
  125.                         A.length -= 4;
  126.                     break;
  127.                 case 66:
  128.                     e = A[A.length - 1];
  129.                     break;
  130.                 case 67:
  131.                     A.push(new Array(S[E++]));
  132.                     break;
  133.                 case 68:
  134.                     _ = A.pop(),
  135.                         A[A.length - 1] += _;
  136.                     break;
  137.                 case 69:
  138.                     A.push(g);
  139.                     break;
  140.                 case 70:
  141.                     A.push(A[A.length - 1]),
  142.                         A[A.length - 2] = A[A.length - 2][r[S[E++]]];
  143.                     break;
  144.                 case 71:
  145.                     l = A[A.length - 1];
  146.                     break;
  147.                 case 72:
  148.                     A.push(u);
  149.                     break;
  150.                 case 73:
  151.                     A.push(w);
  152.                     break;
  153.                 case 74:
  154.                     o = A[A.length - 1];
  155.                     break;
  156.                 case 76:
  157.                     null != A[A.length - 2] ? (A[A.length - 3] = x.call(A[A.length - 3], A[A.length - 2], A[A.length - 1]),
  158.                         A.length -= 2) : (_ = A[A.length - 3],
  159.                         A[A.length - 3] = _(A[A.length - 1]),
  160.                         A.length -= 2);
  161.                     break;
  162.                 case 78:
  163.                     i = A[A.length - 1];
  164.                     break;
  165.                 case 79:
  166.                     p = A[A.length - 1];
  167.                     break;
  168.                 case 80:
  169.                     A[A.length - 2][r[S[E++]]] = A[A.length - 1],
  170.                         A.length--;
  171.                     break;
  172.                 case 87:
  173.                     A.push(l);
  174.                     break;
  175.                 case 88:
  176.                     A.push(i);
  177.                     break;
  178.                 case 90:
  179.                     return A.pop();
  180.                 case 91:
  181.                     A[A.length - 4] = x.call(A[A.length - 4], A[A.length - 3], A[A.length - 2], A[A.length - 1]),
  182.                         A.length -= 3;
  183.                     break;
  184.                 case 93:
  185.                     A[A.length - 1] = A[A.length - 1][r[S[E++]]];
  186.                     break;
  187.                 case 95:
  188.                     A.push(v);
  189.                     break;
  190.                 case 98:
  191.                     A.push(e)
  192.             }
  193.     };
  194.     var h = l(nm)
  195.         , f = l(zk)
  196.         , g = l(j_)
  197.         , p = l(Rk);
  198.  
  199.     function v(e, t) {
  200.         var r = void 0 !== c && s(e) || e["@@iterator"];
  201.         if (!r) {
  202.             if (u(e) || (r = function (e, t) {
  203.                 var r;
  204.                 if (!e)
  205.                     return;
  206.                 if ("string" == typeof e)
  207.                     return d(e, t);
  208.                 var n = o(r = Object.prototype.toString.call(e)).call(r, 8, -1);
  209.                 "Object" === n && e.constructor && (n = e.constructor.name);
  210.                 if ("Map" === n || "Set" === n)
  211.                     return i(e);
  212.                 if ("Arguments" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n))
  213.                     return d(e, t)
  214.             }(e)) || t && e && "number" == typeof e.length) {
  215.                 r && (e = r);
  216.                 var n = 0
  217.                     , a = function () {
  218.                 };
  219.                 return {
  220.                     s: a,
  221.                     n: function () {
  222.                         return n >= e.length ? {
  223.                             done: !0
  224.                         } : {
  225.                             done: !1,
  226.                             value: e[n++]
  227.                         }
  228.                     },
  229.                     e: function (e) {
  230.                         throw e
  231.                     },
  232.                     f: a
  233.                 }
  234.             }
  235.             throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")
  236.         }
  237.         var l, h = !0, f = !1;
  238.         return {
  239.             s: function () {
  240.                 r = r.call(e)
  241.             },
  242.             n: function () {
  243.                 var e = r.next();
  244.                 return h = e.done,
  245.                     e
  246.             },
  247.             e: function (e) {
  248.                 f = !0,
  249.                     l = e
  250.             },
  251.             f: function () {
  252.                 try {
  253.                     h || null == r.return || r.return()
  254.                 } finally {
  255.                     if (f)
  256.                         throw l
  257.                 }
  258.             }
  259.         }
  260.     }
  261.  
  262.     function d(e, t) {
  263.         (null == t || t > e.length) && (t = e.length);
  264.         for (var r = 0, n = new Array(t); r < t; r++)
  265.             n[r] = e[r];
  266.         return n
  267.     }
  268.  
  269.     function b() {
  270.         return 10 * Math.random() | 0
  271.     }
  272.  
  273.     function y(e, t) {
  274.         var r = _();
  275.         return y = function (t, n) {
  276.             var a = r[t -= 280];
  277.             if (void 0 === y.RpSzcS) {
  278.                 y.licQQm = function (e) {
  279.                     for (var t, r, n = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+/=", a = "", o = "", i = 0, c = 0; r = e.charAt(c++); ~r && (t = i % 4 ? 64 * t + r : r,
  280.                     i++ % 4) ? a += String.fromCharCode(255 & t >> (-2 * i & 6)) : 0)
  281.                         r = (0,
  282.                             p.default)(n).call(n, r);
  283.                     for (var s = 0, u = a.length; s < u; s++) {
  284.                         var l;
  285.                         o += "%" + (0,
  286.                             f.default)(l = "00" + a.charCodeAt(s).toString(16)).call(l, -2)
  287.                     }
  288.                     return decodeURIComponent(o)
  289.                 }
  290.                     ,
  291.                     e = arguments,
  292.                     y.RpSzcS = !0
  293.             }
  294.             var o = t + r[0].substring(0, 2)
  295.                 , i = e[o];
  296.             return i ? a = i : (a = y.licQQm(a),
  297.                 e[o] = a),
  298.                 a
  299.         }
  300.             ,
  301.             y(e, t)
  302.     }
  303.  
  304.     function k(e, t) {
  305.         var r, n = [], a = e.length, o = v(e);
  306.         try {
  307.             for (o.s(); !(r = o.n()).done;) {
  308.                 var i = r.value;
  309.                 if (Math.random() * a < t && (n.push(i),
  310.                 0 == --t))
  311.                     break;
  312.                 a--
  313.             }
  314.         } catch (e) {
  315.             o.e(e)
  316.         } finally {
  317.             o.f()
  318.         }
  319.         for (var c = "", s = 0; s < n.length; s++) {
  320.             var u = Math.random() * (n.length - s) | 0;
  321.             c += n[u],
  322.                 n[u] = n[n.length - s - 1]
  323.         }
  324.         return c
  325.     }
  326.  
  327.     function m(e) {
  328.         for (var t = e.size, r = e.num, n = ""; t--;)
  329.             n += r[Math.random() * r.length | 0];
  330.         return n
  331.     }
  332.  
  333.     function w(e, t) {
  334.         for (var o, i, c, s = n, u = a, l = [], h = 239; ;)
  335.             switch (u[h++]) {
  336.                 case 2:
  337.                     l[l.length - 1] = -l[l.length - 1];
  338.                     break;
  339.                 case 4:
  340.                     l.push(e);
  341.                     break;
  342.                 case 11:
  343.                     l.push(t);
  344.                     break;
  345.                 case 20:
  346.                     return;
  347.                 case 21:
  348.                     l[l.length - 1] = l[l.length - 1][r[10 + u[h++]]];
  349.                     break;
  350.                 case 22:
  351.                     l[l.length - 2] = l[l.length - 2][l[l.length - 1]],
  352.                         l.length--;
  353.                     break;
  354.                 case 27:
  355.                     l.push(o++);
  356.                     break;
  357.                 case 36:
  358.                     l[l.length - 1] = l[l.length - 1].length;
  359.                     break;
  360.                 case 39:
  361.                     e = l[l.length - 1];
  362.                     break;
  363.                 case 49:
  364.                     l.push(0);
  365.                     break;
  366.                 case 50:
  367.                     h += u[h];
  368.                     break;
  369.                 case 55:
  370.                     i = l[l.length - 1];
  371.                     break;
  372.                 case 58:
  373.                     l.pop();
  374.                     break;
  375.                 case 60:
  376.                     c = l.pop(),
  377.                         l[l.length - 1] = l[l.length - 1] !== c;
  378.                     break;
  379.                 case 68:
  380.                     c = l.pop(),
  381.                         l[l.length - 1] += c;
  382.                     break;
  383.                 case 70:
  384.                     l.push(l[l.length - 1]),
  385.                         l[l.length - 2] = l[l.length - 2][r[10 + u[h++]]];
  386.                     break;
  387.                 case 71:
  388.                     l.push(void 0);
  389.                     break;
  390.                 case 73:
  391.                     l.push(u[h++]);
  392.                     break;
  393.                 case 74:
  394.                     c = l.pop(),
  395.                         l[l.length - 1] = l[l.length - 1] < c;
  396.                     break;
  397.                 case 76:
  398.                     l.push(p);
  399.                     break;
  400.                 case 79:
  401.                     l.push(o);
  402.                     break;
  403.                 case 82:
  404.                     l.push(i);
  405.                     break;
  406.                 case 84:
  407.                     l[l.length - 4] = s.call(l[l.length - 4], l[l.length - 3], l[l.length - 2], l[l.length - 1]),
  408.                         l.length -= 3;
  409.                     break;
  410.                 case 86:
  411.                     l[l.length - 1] ? (++h,
  412.                         --l.length) : h += u[h];
  413.                     break;
  414.                 case 90:
  415.                     return l.pop();
  416.                 case 91:
  417.                     l.pop() ? h += u[h] : ++h;
  418.                     break;
  419.                 case 93:
  420.                     null != l[l.length - 2] ? (l[l.length - 3] = s.call(l[l.length - 3], l[l.length - 2], l[l.length - 1]),
  421.                         l.length -= 2) : (c = l[l.length - 3],
  422.                         l[l.length - 3] = c(l[l.length - 1]),
  423.                         l.length -= 2);
  424.                     break;
  425.                 case 94:
  426.                     o = l[l.length - 1];
  427.                     break;
  428.                 case 98:
  429.                     l.push(r[10 + u[h++]])
  430.             }
  431.     }
  432.  
  433.     function _() {
  434.         var e = ["ndqXnZqYofn2uw90Ca", "nJyYmtm3Cvrcvhvc", "mty2ntG2nhrZsg9WtW", "mJjMswjnv0C", "mte5mte0nwP4ugrqAW", "nNHJEvrWva", "odiXmJqXnLf6vKfgvW", "ouPpuNDkDa", "mta0ntK5mgTPwM5TAW", "mMT4AhLiDq", "nZe3nJq4yKHWwunj", "mxvJDdzKmgPOCq", "mZbqBvzVCfu"];
  435.         return (_ = function () {
  436.                 return e
  437.             }
  438.         )()
  439.     }
  440.  
  441.     !function (e, t) {
  442.         for (var r = y, n = e(); ;)
  443.             try {
  444.                 if (676921 === -(0,
  445.                     h.default)(r(284)) / 1 * ((0,
  446.                     h.default)(r(285)) / 2) + (0,
  447.                     h.default)(r(280)) / 3 * ((0,
  448.                     h.default)(r(290)) / 4) + -(0,
  449.                     h.default)(r(292)) / 5 * ((0,
  450.                     h.default)(r(287)) / 6) + (0,
  451.                     h.default)(r(289)) / 7 + (0,
  452.                     h.default)(r(281)) / 8 * ((0,
  453.                     h.default)(r(282)) / 9) + -(0,
  454.                     h.default)(r(283)) / 10 + -(0,
  455.                     h.default)(r(291)) / 11 * (-(0,
  456.                     h.default)(r(288)) / 12))
  457.                     break;
  458.                 n.push(n.shift())
  459.             } catch (e) {
  460.                 n.push(n.shift())
  461.             }
  462.     }(_)
  463. }();

3、第三部分，APPID直接取AID即可


第三部分的APPID直接取AID即可。

4、第四部分，Token


接下来就是第四部分的Token生成了，加密算法实现如下所示：
 

  1. var getLocalTK;
  2. !function () {
  3.     function t(e) {
  4.         for (var t = "", r = 0; r < e.length;) {
  5.             var n = e.charCodeAt(r++);
  6.             t += n > 63 ? String.fromCharCode(53 ^ n) : 35 == n ? e.charAt(r++) : String.fromCharCode(n)
  7.         }
  8.         return t
  9.     }
  10.  
  11.     var r = ["tk", t("XTR#iV"), "03", t("CPGF#iZ["), "w", t("EYTASZGX"), "41", t("PME#iGPF"), "l", t("EGZQ@VPG"), t("PMEG"), t("V#iE]PG"), t("TQYPG32"), t("RPAgT[QZX|qeGZ"), t("F#iOP"), t("Q#iVAaLEP"), t("V@FAZXq#iVA"), "", t("QPST@YA"), "C2", t("ETGFP"), t("P[VGLEA"), t("_Z#i["), "iv", t("SGZXwTFP64"), t("FAG#i[R#iSL"), t("V#iE]PGAPMA"), t("QPST@YA"), t("EGZAZALEP"), t("VTYY"), "set", "buf", t("AZfAG#i[R"), t("F@WFAG"), t("V]TGvZQPtA"), t("V]TGvZQPtA"), t("V]TGvZQPtA"), t("SYZZG"), "pow", t("FPA`#i[A32"), t("FPA|[A16"), t("RPAgT[QZX|qeGZ"), t("F#iOP"), t("Q#iVAaLEP"), t("V@FAZXq#iVA"), "1", "2", "3", "+", "x", t("SYZZG"), t("GT[QZX"), "", t("F@WFAG"), t("QPST@YA"), t("ETGFP"), t("FAG#i[R#iSL"), t("SGZXwTFP64")]
  12.         , n = Function.prototype.call
  13.         ,
  14.         a = [23, 64, 79, 28, 21, 0, 99, 1, 79, 28, 21, 2, 99, 3, 79, 28, 21, 4, 99, 5, 79, 28, 21, 6, 99, 7, 79, 28, 21, 8, 99, 9, 79, 28, 50, 11, 49, 99, 10, 79, 28, 12, 11, 53, 46, 99, 11, 79, 28, 24, 11, 28, 29, 1, 28, 29, 3, 17, 28, 29, 5, 17, 28, 29, 7, 17, 28, 29, 9, 17, 28, 29, 10, 17, 28, 29, 11, 17, 46, 99, 12, 79, 28, 29, 1, 28, 29, 3, 17, 28, 29, 5, 17, 28, 29, 12, 17, 28, 29, 7, 17, 28, 29, 9, 17, 28, 29, 10, 17, 28, 29, 11, 17, 51, 35, 45, 75, 54, 64, 54, 70, 20, 0, 63, 5, 4, 32, 69, 1, 28, 81, 4, 178, 40, 69, 2, 81, 69, 3, 40, 6, 54, 68, 4, 42, 54, 64, 54, 86, 20, 5, 63, 21, 61, 54, 68, 6, 99, 54, 28, 81, 4, 182, 40, 52, 54, 31, 81, 95, 16, 19, 10, 18, 38, 54, 26, 98, 81, 78, 40, 83, 42, 54, 26, 98, 81, 19, 40, 83, 42, 54, 26, 98, 81, 10, 40, 83, 42, 54, 26, 22, 81, 16, 40, 83, 42, 54, 26, 98, 81, 95, 40, 83, 42, 54, 97, 20, 5, 80, 7, 26, 40, 27, 54, 76, 20, 5, 80, 8, 39, 47, 20, 5, 80, 7, 77, 40, 5, 47, 20, 5, 80, 7, 29, 80, 9, 68, 4, 40, 40, 69, 10, 73, 89, 54, 64, 54, 70, 20, 11, 63, 56, 20, 5, 80, 12, 37, 20, 13, 40, 40, 88, 7, 14, 10, 70, 74, 20, 22, 253, 22, -2067, 96, 22, 1830, 96, 60, 52, 70, 17, 70, 98, 51, 0, 20, 97, 51, 1, 53, 25, 2, 75, 73, 19, 70, 65, 15, 49, 53, 91, 70, 74, 20, 22, -1530, 22, 415, 96, 22, 1117, 96, 60, 68, 70, 17, 70, 98, 51, 0, 20, 97, 51, 1, 53, 25, 2, 48, 92, 19, 70, 74, 20, 22, -7373, 22, 4503, 96, 22, 2882, 96, 60, 16, 70, 17, 70, 98, 51, 0, 20, 97, 51, 1, 53, 25, 2, 81, 84, 19, 70, 74, 20, 22, 5169, 22, -9153, 96, 22, 4022, 96, 60, 30, 70, 33, 25, 3, 48, 53, 70, 33, 25, 3, 81, 22, -7348, 22, 4861, 96, 22, 2489, 96, 19, 70, 33, 25, 3, 43, 22, -7830, 22, -2494, 96, 22, 10338, 96, 19, 70, 33, 25, 3, 75, 22, 6556, 22, -649, 96, 22, -5885, 96, 19, 70, 13, 51, 0, 25, 4, 33, 53, 71, 70, 83, 22, 8329, 22, -2927, 96, 22, -5402, 96, 21, 71, 70, 76, 15, 22, 187, 53, 83, 25, 5, 22, -3433, 22, 1157, 96, 22, 2292, 96, 53, 96, 72, 70, 47, 25, 6, 47, 32, 22, -47, 22, -1896, 96, 22, 1951, 96, 86, 53, 89, 57, 79, 77, 67, 12, 0, 77, 56, 62, 4, 30, 23, 45, 87, 9, 0, 45, 15, 62, 95, 16, 2, 51, 30, 44, 0, 51, 4, 24, 1, 7, 69, 24, 64, 5, 42, 77, 78, 0, 98, 77, 78, 1, 65, 6751, 65, -342, 81, 65, -6407, 81, 65, 5336, 65, -6432, 81, 65, 1128, 81, 72, 95, 13, 85, 42, 98, 77, 78, 1, 65, -310, 65, 8475, 81, 65, -8163, 81, 65, 32, 72, 88, 1, 42, 94, 24, 65, 5048, 65, -9090, 81, 65, 4050, 81, 2, 67, 42, 8, 24, 32, 2, 37, 42, 12, 71, 32, 16, 78, 2, 65, -5825, 65, -8303, 81, 65, 14128, 81, 47, 12, 34, 42, 16, 78, 2, 65, -4393, 65, -6070, 81, 65, 10467, 81, 56, 12, 34, 80, 30, 16, 78, 2, 65, -8374, 65, -5679, 81, 65, 14053, 81, 56, 12, 34, 42, 16, 78, 2, 65, 5472, 65, -7245, 81, 65, 1777, 81, 47, 12, 34, 42, 52, 24, 32, 2, 20, 93, 94, 60, 29, 2, 79, 92, 78, 62, 60, 1, 79, 59, 0, 29, -4658, 29, -4430, 87, 29, 9088, 87, 29, 6433, 29, 9036, 87, 29, -15213, 87, 48, 0, 85, 85, 97, 78, 27, 60, 1, 79, 29, 6857, 29, -8577, 87, 29, 1720, 87, 4, 29, -353, 29, -2847, 87, 29, 3456, 87, 42, 37, 99, 2, 7, 71, 62, 71, 30, 63, 0, 29, 12, 35, 32, 93, 1, 18, 8, 35, 178, 48, 93, 2, 8, 93, 3, 48, 85, 71, 36, 3, 62, 53, 4, 17, 92, 53, 5, 17, 35, 2, 53, 6, 17, 24, 71, 36, 2, 62, 53, 7, 17, 92, 53, 8, 17, 27, 71, 35, -1160, 35, -3905, 84, 35, 5067, 84, 21, 45, 9, 21, 45, 10, 14, 35, 5398, 35, 8267, 84, 35, -13661, 84, 78, 48, 84, 81, 71, 53, 11, 83, 71, 35, 6113, 35, -8607, 84, 35, 2494, 84, 22, 71, 41, 63, 61, 59, 21, 45, 9, 21, 45, 10, 14, 35, 4505, 35, -8459, 84, 35, 3957, 84, 78, 48, 31, 84, 83, 71, 3, 49, 35, -7624, 35, 707, 84, 35, 6918, 84, 76, 97, 95, 23, 61, 60, 21, 45, 9, 21, 45, 10, 14, 35, -7093, 35, -9161, 84, 35, 16256, 84, 78, 48, 31, 84, 83, 71, 56, 71, 3, 49, 97, 86, -66, 61, 69, 35, -8937, 35, -657, 84, 35, 9603, 84, 97, 95, 27, 61, 1, 45, 12, 35, -1991, 35, -3690, 84, 35, 5681, 84, 35, 3277, 35, -1882, 84, 35, -1386, 84, 61, 69, 76, 32, 84, 83, 71, 38, 63, 13, 45, 14, 61, 48, 94, 71, 23, 63, 13, 45, 15, 15, 48, 19, 71, 62, 71, 30, 63, 16, 29, 74, 48, 65, 44]
  15.         , o = Og.exports;
  16.  
  17.     var genLocalTK = function (e) {
  18.         for (var t, o, i = n, c = a, s = [], u = 0; ;)
  19.             switch (c[u++]) {
  20.                 case 11:
  21.                     s.push(null);
  22.                     break;
  23.                 case 12:
  24.                     s.push(x);
  25.                     break;
  26.                 case 17:
  27.                     o = s.pop(),
  28.                         s[s.length - 1] += o;
  29.                     break;
  30.                 case 21:
  31.                     s.push(r[c[u++]]);
  32.                     break;
  33.                 case 23:
  34.                     s.push({});
  35.                     break;
  36.                 case 24:
  37.                     s.push(_);
  38.                     break;
  39.                 case 28:
  40.                     s.push(t);
  41.                     break;
  42.                 case 29:
  43.                     s[s.length - 1] = s[s.length - 1][r[c[u++]]];
  44.                     break;
  45.                 case 35:
  46.                     return;
  47.                 case 46:
  48.                     null != s[s.length - 2] ? (s[s.length - 3] = i.call(s[s.length - 3], s[s.length - 2], s[s.length - 1]),
  49.                         s.length -= 2) : (o = s[s.length - 3],
  50.                         s[s.length - 3] = o(s[s.length - 1]),
  51.                         s.length -= 2);
  52.                     break;
  53.                 case 49:
  54.                     null != s[s.length - 1] ? s[s.length - 2] = i.call(s[s.length - 2], s[s.length - 1]) : (o = s[s.length - 2],
  55.                         s[s.length - 2] = o()),
  56.                         s.length--;
  57.                     break;
  58.                 case 50:
  59.                     s.push(j);
  60.                     break;
  61.                 case 51:
  62.                     return s.pop();
  63.                 case 53:
  64.                     s.push(e);
  65.                     break;
  66.                 case 64:
  67.                     t = s[s.length - 1];
  68.                     break;
  69.                 case 79:
  70.                     s.pop();
  71.                     break;
  72.                 case 99:
  73.                     s[s.length - 2][r[c[u++]]] = s[s.length - 1],
  74.                         s[s.length - 2] = s[s.length - 1],
  75.                         s.length--
  76.             }
  77.     };
  78.     var i = o(nm)
  79.         , c = o(cm)
  80.         , s = o(Rk)
  81.         , u = o(zk)
  82.         , l = o(xm)
  83.         , h = o(Om)
  84.         , f = vx
  85.         , g = o(eA.exports)
  86.         , p = o(rA.exports)
  87.         , v = o(tA.exports)
  88.         , d = o($S.exports)
  89.         , b = o(yA)
  90.         , y = S;
  91.     !function (e, t) {
  92.         for (var r = S, n = e(); ;)
  93.             try {
  94.                 if (569306 === (0,
  95.                     i.default)(r(173)) / 1 + (0,
  96.                     i.default)(r(175)) / 2 * (-(0,
  97.                     i.default)(r(188)) / 3) + -(0,
  98.                     i.default)(r(179)) / 4 * (-(0,
  99.                     i.default)(r(177)) / 5) + (0,
  100.                     i.default)(r(174)) / 6 * ((0,
  101.                     i.default)(r(184)) / 7) + -(0,
  102.                     i.default)(r(186)) / 8 + -(0,
  103.                     i.default)(r(180)) / 9 * ((0,
  104.                     i.default)(r(183)) / 10) + -(0,
  105.                     i.default)(r(176)) / 11 * ((0,
  106.                     i.default)(r(181)) / 12))
  107.                     break;
  108.                 n.push(n.shift())
  109.             } catch (e) {
  110.                 n.push(n.shift())
  111.             }
  112.     }(w);
  113.     var k = y(185)
  114.         , m = ["01", "02", "03", "04", "05", "06", "07", "08"];
  115.  
  116.     function w() {
  117.         var e = ["mdaWmdaWmda", "ndK0nZLNr3vswMW", "mta0mZy5owvft0Lhzq", "mta0odjODNngCKO", "ndbvqvzcq1i", "ode3m2DqBxjfta", "mZG3ndyZmhjSvxfsEa", "Bwf4", "nhPZsurozW", "nJCXmJaYovbVwKfNvW", "nJi2nhzjqMnZsq", "sZnYt3fntdbrCsze", "mtbIu0Xbuhi", "mZK2mKrLBwH2zG", "puyPp243qf1prLG2mMjunq", "nJe5nZa3mNjJuK5xrq"];
  118.         return (w = function () {
  119.                 return e
  120.             }
  121.         )()
  122.     }
  123.  
  124.     function _(e) {
  125.         var t = y
  126.             , r = b.default.str(e);
  127.         r >>>= 0;
  128.         var n = t(187) + r.toString(16);
  129.         return n.substr(n.length - 8)
  130.     }
  131.  
  132.     function S(e, t) {
  133.         var r = w();
  134.         return S = function (t, n) {
  135.             var a = r[t -= 173];
  136.             if (void 0 === S.zUShtv) {
  137.                 S.CXUmZy = function (e) {
  138.                     for (var t, r, n = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+/=", a = "", o = "", i = 0, c = 0; r = e.charAt(c++); ~r && (t = i % 4 ? 64 * t + r : r,
  139.                     i++ % 4) ? a += String.fromCharCode(255 & t >> (-2 * i & 6)) : 0)
  140.                         r = (0,
  141.                             s.default)(n).call(n, r);
  142.                     for (var l = 0, h = a.length; l < h; l++) {
  143.                         var f;
  144.                         o += "%" + (0,
  145.                             u.default)(f = "00" + a.charCodeAt(l).toString(16)).call(f, -2)
  146.                     }
  147.                     return decodeURIComponent(o)
  148.                 }
  149.                     ,
  150.                     e = arguments,
  151.                     S.zUShtv = !0
  152.             }
  153.             var o = t + r[0].substring(0, 2)
  154.                 , i = e[o];
  155.             return i ? a = i : (a = S.CXUmZy(a),
  156.                 e[o] = a),
  157.                 a
  158.         }
  159.             ,
  160.             S(e, t)
  161.     }
  162.  
  163.     function E(e) {
  164.         return (0,
  165.             h.default)(Array.prototype).call(e, (function (e) {
  166.                 var t;
  167.                 return (0,
  168.                     u.default)(t = "00" + (255 & e).toString(16)).call(t, -2)
  169.             }
  170.         )).join("")
  171.     }
  172.  
  173.     function C(e) {
  174.         var t = new Uint8Array(e.length);
  175.         return (0,
  176.             l.default)(Array.prototype).call(t, (function (t, r, n) {
  177.                 n[r] = e.charCodeAt(r)
  178.             }
  179.         )),
  180.             E(t)
  181.     }
  182.  
  183.  
  184.     function O(e) {
  185.         return E(T(e))
  186.     }
  187. 	getLocalTK = genLocalTK
  188. }();

直接调用getLocalTK，入参则是上面的get_fingerprint指纹值

5、第五部分，Sign签名


第五部分的Sign签名其实算比较复杂的一部分了，多参数参与了加密，核心算法实现如下：
 

  1. !function () {
  2.     function t(e) {
  3.         for (var t = "", r = 0; r < e.length;) {
  4.             var n = e.charCodeAt(r++);
  5.             t += n > 63 ? String.fromCharCode(24 ^ n) : 35 == n ? e.charAt(r++) : String.fromCharCode(n)
  6.         }
  7.         return t
  8.     }
  9.  
  10.     var r = ["", t("|}~ymtl"), t("kljqv#gq~a"), t("hyjk}"), t("lwZyk}64"), t("GGhyjk}Lws}v"), t("uyl{p"), t("FC123E(C`+EC123E)+"), t("khtql"), t("G|}~ymtlYt#gwjqlpu"), t("{ytt"), "log", t("G|}zm#g"), "", t("TW[YTGYT_WJQLPUGHJ]^Q@"), "+", "x", t("GGyt#gwjqlpu"), t("|}~ymtl"), t("{ytt"), t("|}~ymtl"), t("{ytt"), t("rwqv"), "&", t("lwKljqv#g"), "log", t("G|}zm#g"), "key", ":", t("nytm}"), "", t("|}~ymtl"), t("~wjuyl"), "07", t("GqkVwjuyt"), t("GG#g}vS}a"), t("Glws}v"), t("G~qv#g}jhjqvl"), t("GyhhQ|"), t("yt#gwk"), t("lwKljqv#g"), t("#g}vTw{ytLS"), t("G|}~ymtlLws}v"), t("GG#g}v#D}~ymtlS}a"), t("GG#g}vKq#gv"), t("{ytt"), t("rwqv"), ",", t("]VNQJWVU]VL"), t("GG#g}vKq#gvHyjyuk"), "log", t("G|}zm#g"), "key", t("kq#gvKlj"), t("Gkls"), t("Gkl}"), t("p5kl"), t("GwvKq#gv"), t("{w|}"), t("u}kky#g}"), t("Gn}jkqwv"), "v", t("GGRKGK][MJQLAGN]JKQWV"), t("kmzGn"), t("}`l}v|"), t("]jj[w|}k"), t("_]V]JYL]GKQ_VYLMJ]G^YQT]#D"), t("LWS]VG]UHLA"), "key", t("}vn[wtt}{l"), t("G~qv#g}jhjqvl"), "fp", t("Gzm{s}l"), t("|}~ymtl"), "log", t("G|}zm#g"), t("}v{jahl"), t("hyjk}"), "01", "02", "03", "04", "05", "06", "07", "08", t("rwqv"), "", "iv", t("}v{w|}"), t("{qhp}jl}`l"), t("|}~ymtl"), t("ojyh"), t("v}`l"), t("hj}n"), 0, 5, 10, 13, "end", t("|}~ymtl"), t("GG{p}{sHyjyuk"), t("yzjmhl"), t("j}lmjv"), t("GGj}im}kl#D}hk"), t("GG{wtt}{l"), t("GGuys}Kq#gv"), "log", t("G|}zm#g"), "ms", t("{yl{p"), "t0", t("GwvKq#gv"), t("]jj[w|}k"), t("MVPYV#DT]#DG]JJWJ"), t("{w|}"), t("u}kky#g}"), t("Gn}jkqwv"), "v", t("GGRKGK][MJQLAGN]JKQWV"), t("kmzGn"), t("}`l}v|"), t("klwh")]
  11.         , n = Function.prototype.call
  12.         ,
  13.         o = [75, 1, 29, 51, 66, 29, 41, 0, 21, 29, 91, 68, 76, 397, 15, 79, 29, 41, 0, 3, 96, 40, 96, 4, 96, 56, 96, 90, 96, 53, 29, 16, 30, 1, 44, 2, 6, 30, 1, 44, 3, 88, 29, 85, 30, 4, 22, 75, 44, 5, 3, 76, 6038, 76, 6806, 96, 76, -12828, 96, 76, 4468, 76, -656, 96, 76, -3784, 96, 35, 15, 15, 15, 72, 29, 57, 44, 6, 37, 7, 15, 84, 29, 81, 77, 43, 81, 76, 8106, 76, 2295, 96, 76, -10401, 96, 9, 33, 29, 23, 44, 8, 41, 0, 15, 50, 29, 31, 9, 71, 29, 41, 0, 18, 29, 88, 29, 48, 30, 1, 22, 26, 15, 44, 10, 26, 32, 36, 29, 88, 29, 85, 30, 11, 22, 31, 12, 91, 68, 76, 413, 15, 62, 96, 91, 68, 76, 376, 15, 96, 57, 96, 91, 68, 76, 405, 15, 96, 87, 96, 36, 29, 87, 43, 98, 31, 32, 15, 41, 69, 96, 12, 43, 64, 85, 0, 48, 28, 1, 26, 69, 26, 90, 32, 62, 30, 5, 43, 47, 92, 80, 33, 2, 2, 6, 3, 22, 85, 0, 46, 26, 33, 87, 4, 30, 51, 7, 98, 26, 75, 32, 72, 23, 33, 87, 4, 30, 46, 7, 98, 75, 32, 72, 12, 33, 87, 4, 30, 51, 7, 98, 75, 32, 72, 1, 72, 38, 50, 32, 91, 28, 5, 83, 95, 2, 50, 85, 2, 2, 8, 85, 3, 2, 40, 96, 87, 6, 31, 69, 23, 74, 7495, 74, -6716, 26, 74, -779, 26, 59, 68, 3, 69, 65, 32, 53, 62, 47, 35, 25, 35, 93, 98, 0, 53, 34, 75, 50, 1, 34, 14, 72, 50, 2, 8, 3, 75, 95, 35, 25, 35, 96, 98, 0, 53, 85, 88, 72, 50, 4, 58, 98, 0, 75, 4, 35, 25, 35, 69, 98, 5, 53, 73, 6, 91, 2, 26, 399, 75, 85, 80, 91, 2, 26, 414, 75, 80, 28, 80, 72, 35, 28, 10, 52, 76, 7, 0, 61, 1, 65, 76, 7, 2, 65, 75, 16, 93, 98, 84, 92, 0, 37, 84, 19, 84, 22, 26, 1, 67, 4, 91, 84, 19, 84, 14, 26, 2, 67, 38, 18, 76, 63, 406, 65, 90, 11, 84, 35, 92, 3, 53, 83, 84, 74, 4, 16, 24, 42, 36, 5, 74, 6, 74, 7, 20, 74, 8, 74, 9, 17, 36, 10, 4, 95, 3, 92, 0, 37, 82, 26, 42, 19, 84, 29, 26, 11, 67, 74, 7, 65, 25, 12, 84, 42, 36, 13, 74, 12, 74, 7, 20, 74, 8, 88, 37, 84, 69, 5, 84, 57, 16, 136, 42, 36, 14, 57, 45, 90, 21, 84, 19, 84, 3, 26, 1, 67, 45, 65, 36, 15, 45, 8, 90, 36, 16, 92, 17, 65, 2, 84, 40, 26, 18, 12, 84, 42, 36, 19, 62, 38, 35, 34, 88, 41, 84, 19, 84, 59, 26, 20, 67, 74, 21, 18, 76, 63, 375, 65, 19, 84, 27, 26, 1, 67, 69, 57, 32, 22, 62, 32, 23, 33, 32, 24, 52, 32, 25, 54, 32, 26, 76, 63, 1119, 63, -3077, 53, 63, 1960, 53, 58, 53, 90, 84, 69, 33, 32, 24, 52, 32, 25, 54, 32, 26, 5, 84, 42, 36, 27, 69, 19, 32, 28, 18, 76, 63, 394, 65, 32, 29, 69, 74, 30, 32, 31, 40, 26, 32, 32, 33, 32, 34, 65, 84, 86, 39, 82, 76, 74, 6, 95, 3, 74, 12, 16, 34, 42, 36, 27, 69, 31, 26, 35, 26, 36, 32, 28, 18, 76, 63, 373, 65, 32, 29, 69, 74, 30, 32, 31, 40, 26, 32, 32, 33, 32, 34, 65, 82, 32, 42, 36, 27, 69, 31, 26, 35, 26, 37, 32, 28, 18, 76, 63, 381, 65, 32, 29, 69, 74, 30, 32, 31, 40, 26, 32, 32, 33, 32, 34, 65, 84, 86, 39, 1, 24, 61, 0, 40, 41, 41, 52, 8, 61, 8, 89, 92, 0, 44, 45, 5394, 45, 7249, 87, 45, -12642, 87, 15, 39, 8, 69, 27, 1, 95, 2, 8, 69, 11, 83, 45, 415, 15, 27, 3, 3, 8, 69, 11, 83, 45, 368, 15, 19, 11, 83, 45, 365, 15, 69, 11, 83, 45, 368, 15, 19, 11, 83, 45, 365, 15, 19, 45, 6472, 45, -4012, 87, 45, -2460, 87, 24, 40, 12, 45, 9932, 45, -4858, 87, 45, -5073, 87, 67, 51, 14, 69, 11, 83, 45, 368, 15, 19, 11, 83, 45, 365, 15, 19, 3, 8, 61, 8, 46, 92, 4, 44, 69, 83, 45, -8946, 45, 8447, 87, 45, 501, 87, 10, 36, 8, 61, 8, 16, 92, 5, 44, 27, 6, 11, 83, 45, 421, 15, 31, 87, 12, 8, 42, 92, 4, 20, 7, 31, 70, 92, 4, 20, 8, 11, 83, 45, 389, 15, 15, 74, 70, 92, 4, 20, 8, 50, 8, 61, 13, 9, 94, 84, 13, 10, 94, 45, 2, 13, 11, 94, 45, 3, 13, 12, 94, 45, 4, 13, 13, 94, 45, 5, 13, 14, 94, 45, 6, 13, 15, 94, 45, 7, 13, 16, 94, 20, 17, 13, 18, 15, 15, 33, 19, 10, 18, 8, 62, 92, 4, 20, 20, 79, 92, 21, 15, 5, 82, 46, 24, 58, 24, 35, 24, 65, 24, 23, 24, 72, 86, 0, 42, 1, 75, 13, 11, 21, 1, 87, 21, 2, 87, 89, 91, 89, 28, 10, 91, 91, 60, 15, 36, 76, 194, 75, 75, 23, 0, 17, 1, 35, 186, 5, 2, 12, 3, 58, 4, 122, 5, 181, 6, 181, 43, 19, 25, 75, 47, 17, 1, 25, 85, 25, 80, 23, 7, 61, 32, 97, 25, 44, 3, 8, 98, 94, 51, 25, 79, 21, 91, 77, 58, 9, 75, 2, 5, 17, 0, 25, 76, 137, 75, 3, 9, 68, 10, 98, 78, 88, 44, 3, 11, 32, 25, 44, 3, 12, 32, 29, 25, 44, 3, 13, 79, 12, 78, 28, 25, 75, 3, 9, 68, 10, 85, 25, 7, 23, 14, 61, 83, 15, 31, 21, 2, 374, 94, 85, 25, 80, 23, 7, 61, 32, 74, 34, 56, 68, 16, 56, 78, 25, 85, 25, 46, 23, 7, 61, 4, 98, 90, 70, 78, 88, 75, 2, 10, 17, 1, 25, 75, 75, 3, 17, 47, 94, 17, 18, 25, 75, 3, 9, 68, 10, 44, 3, 19, 4, 89, 23, 20, 23, 21, 99, 22, 31, 21, 2, 401, 94, 75, 23, 18, 56, 99, 23, 4, 83, 24, 99, 25, 63, 23, 26, 99, 27, 99, 28, 94, 25, 98, 78, 88, 75, 3, 29, 32, 88, 55, 66, -195, 30]
  14.         , i = a.exports
  15.         , l = Og.exports;
  16.     var v = l(Rk)
  17.         , d = l(zk)
  18.         , b = l(nm)
  19.         , y = l(cm)
  20.         , m = l(xm)
  21.         , w = l(Om)
  22.         , O = Lx
  23.         , R = l($S.exports)
  24.         , z = l(eA.exports)
  25.         , L = l(tA.exports)
  26.         , I = l(rA.exports)
  27.         , B = l(cA.exports)
  28.         , N = l(R_.exports)
  29.         , G = l(sA.exports)
  30.         , F = l(uA.exports)
  31.         , H = l(hA.exports)
  32.         , W = l(fA.exports)
  33.         , U = vx;
  34.  
  35.     function Z(e, t) {
  36.         var r = V();
  37.         return Z = function (t, n) {
  38.             var a = r[t -= 339];
  39.             if (void 0 === Z.kfjFYr) {
  40.                 Z.VsajSZ = function (e) {
  41.                     for (var t, r, n = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+/=", a = "", o = "", i = 0, c = 0; r = e.charAt(c++); ~r && (t = i % 4 ? 64 * t + r : r,
  42.                     i++ % 4) ? a += String.fromCharCode(255 & t >> (-2 * i & 6)) : 0)
  43.                         r = (0,
  44.                             v.default)(n).call(n, r);
  45.                     for (var s = 0, u = a.length; s < u; s++) {
  46.                         var l;
  47.                         o += "%" + (0,
  48.                             d.default)(l = "00" + a.charCodeAt(s).toString(16)).call(l, -2)
  49.                     }
  50.                     return decodeURIComponent(o)
  51.                 }
  52.                     ,
  53.                     e = arguments,
  54.                     Z.kfjFYr = !0
  55.             }
  56.             var o = t + r[0].substring(0, 2)
  57.                 , i = e[o];
  58.             return i ? a = i : (a = Z.VsajSZ(a),
  59.                 e[o] = a),
  60.                 a
  61.         }
  62.             ,
  63.             Z(e, t)
  64.     }
  65.  
  66.     function V() {
  67.         var e = ["x19Yzxf1zxn0rgvWCYb1C2uGy2fJAguGzNaSigzWoG", "x19JB2XSzwn0igvUDKnVBgXLy3q9", "x19Yzxf1zxn0qwXNB3jPDgHTt25Jzq", "x19Yzxf1zxn0qwXNB3jPDgHTihjLCxvLC3qGC3vJy2vZCYeSignOzwnRig1LBw9YEsbMCdO", "x19HBgDVCML0Ag0", "nJuYodqWB0nXwfPp", "x19Yzxf1zxn0rgvWCW", "x19Nzw5tAwDUugfYyw1Z", "CgfYyw1ZigLZig5VDcbHihbSywLUig9IAMvJDa", "x19Yzxf1zxn0rgvWCYbYzxf1zxn0ihrVA2vUigzHAwXLzcWGzxjYB3i6ia", "CMvXDwvZDcb0B2TLBIbMywLSzwqGA2v5oG", "ihrVA2vUoG", "ExL5Eu1nzgq", "Bg9HzcbYywmGANmGzMfPBce", "x19WyxjZzufSz29YAxrOBq", "x19Yzxf1zxn0qwXNB3jPDgHTigvUDKnVBgXLy3q9", "CgfYyw1ZigLZigvTChr5igfMDgvYigv4y2X1zgLUzYaIDw5ZywzLiIbWyxjHBxm", "x19JAgvJA1bHCMfTCW", "nc43", "Bg9JywXFA2v5xZm", "x19Yzxf1zxn0qwXNB3jPDgHTt25JzsbRzxK6", "lcbYzxrYEsbUzxH0ihrPBwuU", "x19Yzxf1zxn0rgvWCYbMCM9TignHy2HLlcbLBMqU", "lcbJAgvJAYbZDg9YywDLigzWoG", "C2v0DgLUz3mUyxbWswqGBxvZDcbIzsbHig5VBI1LBxb0EsbZDhjPBMC", "x19JB2XSzwn0", "C2LNBG", "CxvLCNLtzwXLy3rVCG", "yNuY", "BdfMBa", "lcbZDg9YywDLrNa6", "zxH0zw5K", "Ahr0Chm6lY9ZDg9YywDLlJm2mgj1EwLTzY5JB20VD2vIy29UDgfPBMvYl21HAw4VANmTC2vJDxjPDhKTDJmTCMfJlMPZp3y9", "BwfPBI5ZAwDUi19Fzgv0zwn0Aw5N", "DxnLig5VCM1HBfrVA2vU", "x19Yzxf1zxn0rgvWCYWGx19WyxjZzufSz29YAxrOBsbYzxn1Bhq6", "z2vUzxjHDguGA2v5igzHAwXLza", "C2LNBIbLBgfWC2vKihrPBwuH", "x19TywTLu2LNBIWGCMvZDwX0oG", "lgv4ChjLC3m9", "mtq0mtC3nKjKwLDQwG", "x19WyxjZzvrVA2vU", "x19Yzxf1zxn0rgvWCYbLBMqU", "z2v0vg9Rzw5F", "Dg9Rzw4GAxmGzw1WDhK", "mcfa", "CMv0DxjUia", "lcbHBgDVoG", "lcbFBg9HzgvKx2nHy2HLCZO", "CgfYyw1ZigLZigvTChr5", "x19Yzxf1zxn0qwXNB3jPDgHTigvUzc4", "y3jLyxrLigLUC3rHBMnLihDPDgGGyxbWswq9", "x002wt9KDMzondbwtuzBwa", "CgfYyw1ZignVBNrHAw5ZihjLC2vYDMvKihbHCMfTig5HBwuU", "DgvZDcbLCNi", "ntC5mdG5B0PlCuTl", "x19TywTLu2LNBG", "C3vJy2vZCW", "x19Yzxf1zxn0qwXNB3jPDgHTihn0yxj0lG", "CYnS", "odDUoceT", "nteZode4mNDTwKjxBq", "x19Nzw5tAwDUlcbWyxjHBxntDhi6", "lcbLpq", "Dw5RBM93BIbLCNjVCI4", "x19PBMLdB25MAwC", "nduXmtiWBhHjDKDU", "Bg9HzcbYywmGANmGC3vJy2vZCYe", "lgTLEt0", "ExL5Eu1nzgrOAg1TC3ntu1m", "mtGXnZm0nKrtDKPRwG", "x19Yzxf1zxn0rgvWCYbZDgfYDc4", "x19Nzw5tAwDU", "lcb0B2TLBJO", "lcbMCdO", "mZe0mdGYsuHeC3rs", "x19Nzw5ezwzHDwX0s2v5igLUChv0pq", "lcbZAwDUzwrtDhi6", "yNuX", "x19Nzw5ezwzHDwX0s2v5", "BwfPBI5ZAwDUi19FCMvXDwvZDerLChm", "x19Yzxf1zxn0qwXNB3jPDgHT", "x19Yzxf1zxn0rgvWCYb1C2uGBMv3igzWlcbMCdO"];
  68.         return (V = function () {
  69.                 return e
  70.             }
  71.         )()
  72.     }
  73.  
  74.     var X = Z;
  75.     (function (e, t) {
  76.             for (var r = Z, n = e(); ;)
  77.                 try {
  78.                     if (296934 === -(0,
  79.                         b.default)(r(392)) / 1 + -(0,
  80.                         b.default)(r(342)) / 2 + -(0,
  81.                         b.default)(r(412)) / 3 + (0,
  82.                         b.default)(r(377)) / 4 + -(0,
  83.                         b.default)(r(403)) / 5 + (0,
  84.                         b.default)(r(407)) / 6 + (0,
  85.                         b.default)(r(398)) / 7)
  86.                         break;
  87.                     n.push(n.shift())
  88.                 } catch (e) {
  89.                     console.log(e)
  90.                     n.push(n.shift())
  91.                 }
  92.         }
  93.     )(V);
  94.  
  95.     var __parseToken = function (e, t, r) {
  96.         return e ? vk(e).call(e, t, r) : ""
  97.     }
  98.         , _defaultAlgorithm = {
  99.         local_key_1: CryptoJS.MD5,
  100.         local_key_2: CryptoJS.SHA256,
  101.         local_key_3: CryptoJS.HmacSHA256
  102.     }
  103.         , algos = {
  104.         MD5: CryptoJS.MD5,
  105.         SHA256: CryptoJS.SHA256,
  106.         SHA512: CryptoJS.SHA512,
  107.         HmacSHA256: CryptoJS.HmacSHA256,
  108.         HmacSHA512: CryptoJS.HmacSHA512,
  109.         HmacMD5: CryptoJS.HmacMD5
  110.     }
  111.         , __algorithm = function (e, t, r) {
  112.             var n = X
  113.                 , a = this._defaultAlgorithm[e];
  114.                 return e === 'local_key_3' ? a(t, r).toString(CryptoJS.enc.Hex) : a(t).toString(CryptoJS.enc.Hex)
  115.         };
  116.     var _this = {
  117.         __parseToken: __parseToken,
  118.         __algorithm: __algorithm,
  119.         _defaultAlgorithm: _defaultAlgorithm,
  120.         algos: algos
  121.     };
  122.  
  123.     var genDefaultKey = function (e, t, a, i) {
  124.         for (var c, s, u, l, h, f, g, p, d, b, y, k, w = n, _ = o, x = [], S = 0; ;)
  125.             switch (_[S++]) {
  126.                 case 1:
  127.                     c = x[x.length - 1];
  128.                     break;
  129.                 case 3:
  130.                     x.push(e);
  131.                     break;
  132.                 case 4:
  133.                     x.push(a);
  134.                     break;
  135.                 case 6:
  136.                     x.push(R);
  137.                     break;
  138.                 case 9:
  139.                     x[x.length - 2] = x[x.length - 2][x[x.length - 1]],
  140.                         x.length--;
  141.                     break;
  142.                 case 15:
  143.                     null != x[x.length - 2] ? (x[x.length - 3] = w.call(x[x.length - 3], x[x.length - 2], x[x.length - 1]),
  144.                         x.length -= 2) : (k = x[x.length - 3],
  145.                         x[x.length - 3] = k(x[x.length - 1]),
  146.                         x.length -= 2);
  147.                     break;
  148.                 case 16:
  149.                     x.push(L);
  150.                     break;
  151.                 case 18:
  152.                     y = x[x.length - 1];
  153.                     break;
  154.                 case 21:
  155.                     u = x[x.length - 1];
  156.                     break;
  157.                 case 22:
  158.                     x.push(void 0);
  159.                     break;
  160.                 case 23:
  161.                     x.push(p);
  162.                     break;
  163.                 case 26:
  164.                     x.push(d);
  165.                     break;
  166.                 case 29:
  167.                     x.pop();
  168.                     break;
  169.                 case 30:
  170.                     x[x.length - 1] = x[x.length - 1][r[_[S++]]];
  171.                     break;
  172.                 case 31:
  173.                     x.push(_this[r[_[S++]]]);
  174.                     break;
  175.                 case 32:
  176.                     x.push((function (t) {
  177.                             var a, i, s, l, f = n, g = o, p = [], d = 162;
  178.                             e: for (; ;)
  179.                                 switch (g[d++]) {
  180.                                     case 2:
  181.                                         p[p.length - 3][p[p.length - 2]] = p[p.length - 1],
  182.                                             p.length -= 2;
  183.                                         break;
  184.                                     case 5:
  185.                                         p[p.length - 2] = p[p.length - 2][p[p.length - 1]],
  186.                                             p.length--;
  187.                                         break;
  188.                                     case 7:
  189.                                         p.push(e);
  190.                                         break;
  191.                                     case 8:
  192.                                         p.push(1);
  193.                                         break;
  194.                                     case 12:
  195.                                         p[p.length - 1] = !p[p.length - 1];
  196.                                         break;
  197.                                     case 15:
  198.                                         p.push(isNaN);
  199.                                         break;
  200.                                     case 23:
  201.                                         p[p.length - 4] = f.call(p[p.length - 4], p[p.length - 3], p[p.length - 2], p[p.length - 1]),
  202.                                             p.length -= 3;
  203.                                         break;
  204.                                     case 26:
  205.                                         s = p.pop(),
  206.                                             p[p.length - 1] += s;
  207.                                         break;
  208.                                     case 28:
  209.                                         p[p.length - 1] = p[p.length - 1][r[13 + g[d++]]];
  210.                                         break;
  211.                                     case 30:
  212.                                         p.push(i);
  213.                                         break;
  214.                                     case 31:
  215.                                         p.push(a);
  216.                                         break;
  217.                                     case 32:
  218.                                         p.pop();
  219.                                         break;
  220.                                     case 33:
  221.                                         p.push(c);
  222.                                         break;
  223.                                     case 40:
  224.                                         a = p[p.length - 1];
  225.                                         break;
  226.                                     case 41:
  227.                                         p.push(null);
  228.                                         break;
  229.                                     case 43:
  230.                                         p.pop() ? ++d : d += g[d];
  231.                                         break;
  232.                                     case 46:
  233.                                         p.push(u);
  234.                                         break;
  235.                                     case 48:
  236.                                         p.push(O);
  237.                                         break;
  238.                                     case 50:
  239.                                         p.push(0);
  240.                                         break;
  241.                                     case 51:
  242.                                         p.push(h);
  243.                                         break;
  244.                                     case 53:
  245.                                         return;
  246.                                     case 59:
  247.                                         s = p.pop(),
  248.                                             p[p.length - 1] = p[p.length - 1] >= s;
  249.                                         break;
  250.                                     case 62:
  251.                                         p.push(b);
  252.                                         break;
  253.                                     case 65:
  254.                                         y = p[p.length - 1];
  255.                                         break;
  256.                                     case 68:
  257.                                         p[p.length - 1] ? (++d,
  258.                                             --p.length) : d += g[d];
  259.                                         break;
  260.                                     case 69:
  261.                                         p.push(t);
  262.                                         break;
  263.                                     case 72:
  264.                                         d += g[d];
  265.                                         break;
  266.                                     case 74:
  267.                                         p.push(g[d++]);
  268.                                         break;
  269.                                     case 75:
  270.                                         u = p[p.length - 1];
  271.                                         break;
  272.                                     case 80:
  273.                                         for (s = p.pop(),
  274.                                                  l = 0; l < g[d + 1]; ++l)
  275.                                             if (s === r[13 + g[d + 2 * l + 2]]) {
  276.                                                 d += g[d + 2 * l + 3];
  277.                                                 continue e
  278.                                             }
  279.                                         d += g[d];
  280.                                         break;
  281.                                     case 83:
  282.                                         p.push(void 0);
  283.                                         break;
  284.                                     case 85:
  285.                                         p.push(r[13 + g[d++]]);
  286.                                         break;
  287.                                     case 87:
  288.                                         p.push(p[p.length - 1]),
  289.                                             p[p.length - 2] = p[p.length - 2][r[13 + g[d++]]];
  290.                                         break;
  291.                                     case 90:
  292.                                         i = p[p.length - 1];
  293.                                         break;
  294.                                     case 91:
  295.                                         p.push(v);
  296.                                         break;
  297.                                     case 92:
  298.                                         p.push(y);
  299.                                         break;
  300.                                     case 95:
  301.                                         p.push(new Array(g[d++]));
  302.                                         break;
  303.                                     case 96:
  304.                                         null != p[p.length - 2] ? (p[p.length - 3] = f.call(p[p.length - 3], p[p.length - 2], p[p.length - 1]),
  305.                                             p.length -= 2) : (s = p[p.length - 3],
  306.                                             p[p.length - 3] = s(p[p.length - 1]),
  307.                                             p.length -= 2);
  308.                                         break;
  309.                                     case 98:
  310.                                         p[p.length - 5] = f.call(p[p.length - 5], p[p.length - 4], p[p.length - 3], p[p.length - 2], p[p.length - 1]),
  311.                                             p.length -= 4
  312.                                 }
  313.                         }
  314.                     ));
  315.                     break;
  316.                 case 33:
  317.                     p = x[x.length - 1];
  318.                     break;
  319.                 case 35:
  320.                     x[x.length - 5] = w.call(x[x.length - 5], x[x.length - 4], x[x.length - 3], x[x.length - 2], x[x.length - 1]),
  321.                         x.length -= 4;
  322.                     break;
  323.                 case 36:
  324.                     x[x.length - 4] = w.call(x[x.length - 4], x[x.length - 3], x[x.length - 2], x[x.length - 1]),
  325.                         x.length -= 3;
  326.                     break;
  327.                 case 37:
  328.                     x.push(new RegExp(r[_[S++]]));
  329.                     break;
  330.                 case 40:
  331.                     x.push(t);
  332.                     break;
  333.                 case 41:
  334.                     x.push(r[_[S++]]);
  335.                     break;
  336.                 case 43:
  337.                     return x.pop();
  338.                 case 44:
  339.                     x.push(x[x.length - 1]),
  340.                         x[x.length - 2] = x[x.length - 2][r[_[S++]]];
  341.                     break;
  342.                 case 48:
  343.                     x.push(m);
  344.                     break;
  345.                 case 50:
  346.                     d = x[x.length - 1];
  347.                     break;
  348.                 case 51:
  349.                     x.push(X);
  350.                     break;
  351.                 case 53:
  352.                     h = x[x.length - 1];
  353.                     break;
  354.                 case 56:
  355.                     x.push(i);
  356.                     break;
  357.                 case 57:
  358.                     x.push(f);
  359.                     break;
  360.                 case 62:
  361.                     x.push(h);
  362.                     break;
  363.                 case 66:
  364.                     s = x[x.length - 1];
  365.                     break;
  366.                 case 68:
  367.                     x.push(null);
  368.                     break;
  369.                 case 71:
  370.                     b = x[x.length - 1];
  371.                     break;
  372.                 case 72:
  373.                     f = x[x.length - 1];
  374.                     break;
  375.                 case 75:
  376.                     x.push(_this);
  377.                     break;
  378.                 case 76:
  379.                     x.push(_[S++]);
  380.                     break;
  381.                 case 77:
  382.                     x.pop() ? ++S : S += _[S];
  383.                     break;
  384.                 case 79:
  385.                     l = x[x.length - 1];
  386.                     break;
  387.                 case 81:
  388.                     x.push(g);
  389.                     break;
  390.                 case 84:
  391.                     g = x[x.length - 1];
  392.                     break;
  393.                 case 85:
  394.                     x.push(U);
  395.                     break;
  396.                 case 87:
  397.                     x.push(u);
  398.                     break;
  399.                 case 88:
  400.                     x.push(0);
  401.                     break;
  402.                 case 90:
  403.                     x.push(l);
  404.                     break;
  405.                 case 91:
  406.                     x.push(s);
  407.                     break;
  408.                 case 96:
  409.                     k = x.pop(),
  410.                         x[x.length - 1] += k;
  411.                     break;
  412.                 case 98:
  413.                     return
  414.             }
  415.     };
  416.     var genSign = function (e, t) {
  417.         for (var a, i, c, s, u = n, l = o, h = [], f = 272; ;)
  418.             switch (l[f++]) {
  419.                 case 2:
  420.                     h.push(null);
  421.                     break;
  422.                 case 4:
  423.                     c = h[h.length - 1];
  424.                     break;
  425.                 case 8:
  426.                     h.push(r[20 + l[f++]]);
  427.                     break;
  428.                 case 10:
  429.                     return h.pop();
  430.                 case 14:
  431.                     h.push((function (e) {
  432.                             for (var t, n = o, a = [], i = 340; ;)
  433.                                 switch (n[i++]) {
  434.                                     case 7:
  435.                                         a[a.length - 1] = a[a.length - 1][r[27 + n[i++]]];
  436.                                         break;
  437.                                     case 16:
  438.                                         return;
  439.                                     case 61:
  440.                                         a.push(r[27 + n[i++]]);
  441.                                         break;
  442.                                     case 65:
  443.                                         t = a.pop(),
  444.                                             a[a.length - 1] += t;
  445.                                         break;
  446.                                     case 75:
  447.                                         return a.pop();
  448.                                     case 76:
  449.                                         a.push(e)
  450.                                 }
  451.                         }
  452.                     ));
  453.                     break;
  454.                 case 25:
  455.                     h.push(0);
  456.                     break;
  457.                 case 26:
  458.                     h.push(l[f++]);
  459.                     break;
  460.                 case 28:
  461.                     h.push(c);
  462.                     break;
  463.                 case 34:
  464.                     h.push(t);
  465.                     break;
  466.                 case 35:
  467.                     h.pop();
  468.                     break;
  469.                 case 47:
  470.                     a = h[h.length - 1];
  471.                     break;
  472.                 case 50:
  473.                     h.push(h[h.length - 1]),
  474.                         h[h.length - 2] = h[h.length - 2][r[20 + l[f++]]];
  475.                     break;
  476.                 case 52:
  477.                     return;
  478.                 case 53:
  479.                     h.push(void 0);
  480.                     break;
  481.                 case 58:
  482.                     h.push(z);
  483.                     break;
  484.                 case 62:
  485.                     h.push(X);
  486.                     break;
  487.                 case 69:
  488.                     h.push(U);
  489.                     break;
  490.                 case 72:
  491.                     h[h.length - 4] = u.call(h[h.length - 4], h[h.length - 3], h[h.length - 2], h[h.length - 1]),
  492.                         h.length -= 3;
  493.                     break;
  494.                 case 73:
  495.                     h.push(_this[r[20 + l[f++]]]);
  496.                     break;
  497.                 case 75:
  498.                     null != h[h.length - 2] ? (h[h.length - 3] = u.call(h[h.length - 3], h[h.length - 2], h[h.length - 1]),
  499.                         h.length -= 2) : (s = h[h.length - 3],
  500.                         h[h.length - 3] = s(h[h.length - 1]),
  501.                         h.length -= 2);
  502.                     break;
  503.                 case 80:
  504.                     s = h.pop(),
  505.                         h[h.length - 1] += s;
  506.                     break;
  507.                 case 85:
  508.                     h.push(i);
  509.                     break;
  510.                 case 88:
  511.                     h.push(e);
  512.                     break;
  513.                 case 91:
  514.                     h.push(a);
  515.                     break;
  516.                 case 93:
  517.                     h.push(w);
  518.                     break;
  519.                 case 95:
  520.                     i = h[h.length - 1];
  521.                     break;
  522.                 case 96:
  523.                     h.push(G);
  524.                     break;
  525.                 case 98:
  526.                     h[h.length - 1] = h[h.length - 1][r[20 + l[f++]]]
  527.             }
  528.     };

先调用genDefaultKey，入参是四个，分别是上面得到的Token、FP、APPID、时间戳+07拿到值，再调用签名函数getSign，入参数则是genDefaultKey的值加params，如下所示：

  1. params = {
  2.     "functionId": "mzhprice_getCustomRealPriceInfoForColor",
  3.     "appid": "search-pc-java",
  4.     "client": "pc",
  5.     "clientVersion": "1.0.0",
  6.     "t": str(int(time.time() * 1000)),
  7.     "body": '{"skuPriceInfoRequestList":[{"skuId":"10105124153052"},{"skuId":"10102973236034"},{"skuId":"10060158269227"},{"skuId":"10085438117915"},{"skuId":"100023408281"},{"skuId":"10034095072591"},{"skuId":"10099066159774"},{"skuId":"10102882832111"},{"skuId":"10081102086006"},{"skuId":"10102882779610"},{"skuId":"10105124220789"},{"skuId":"10102882813512"},{"skuId":"10102882813511"},{"skuId":"10105124218483"},{"skuId":"100114410144"},{"skuId":"10093665009265"},{"skuId":"10039552855611"},{"skuId":"10036842860178"},{"skuId":"11677624998"},{"skuId":"26616715173"}],"area":"19_1659_37260_37346","source":"search_pc","fields":"11101100111001"}',
  8. }

注意！其中body需要经过SHA256加密，实现算法如下所示：
 

  1. function GEN_SHA256(s) {
  2.     var chrsz = 8;
  3.     var hexcase = 0;
  4.  
  5.     function safe_add(x, y) {
  6.         var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  7.         var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  8.         return (msw << 16) | (lsw & 0xFFFF)
  9.     }
  10.  
  11.     function S(X, n) {
  12.         return (X >>> n) | (X << (32 - n))
  13.     }
  14.  
  15.     function R(X, n) {
  16.         return (X >>> n)
  17.     }
  18.  
  19.     function Ch(x, y, z) {
  20.         return ((x & y) ^ ((~x) & z))
  21.     }
  22.  
  23.     function Maj(x, y, z) {
  24.         return ((x & y) ^ (x & z) ^ (y & z))
  25.     }
  26.  
  27.     function Sigma0256(x) {
  28.         return (S(x, 2) ^ S(x, 13) ^ S(x, 22))
  29.     }
  30.  
  31.     function Sigma1256(x) {
  32.         return (S(x, 6) ^ S(x, 11) ^ S(x, 25))
  33.     }
  34.  
  35.     function Gamma0256(x) {
  36.         return (S(x, 7) ^ S(x, 18) ^ R(x, 3))
  37.     }
  38.  
  39.     function Gamma1256(x) {
  40.         return (S(x, 17) ^ S(x, 19) ^ R(x, 10))
  41.     }
  42.  
  43.     function core_sha256(m, l) {
  44.         var K = new Array(0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5, 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3, 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174, 0xE49B69C1, 0xEFBE4786, 0xFC19DC6, 0x240CA1CC, 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA, 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7, 0xC6E00BF3, 0xD5A79147, 0x6CA6351, 0x14292967, 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13, 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85, 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3, 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070, 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5, 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3, 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208, 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2);
  45.         var HASH = new Array(0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A, 0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19);
  46.         var W = new Array(64);
  47.         var a, b, c, d, e, f, g, h, i, j;
  48.         var T1, T2;
  49.         m[l >> 5] |= 0x80 << (24 - l % 32);
  50.         m[((l + 64 >> 9) << 4) + 15] = l;
  51.         for (var i = 0; i < m.length; i += 16) {
  52.             a = HASH[0];
  53.             b = HASH[1];
  54.             c = HASH[2];
  55.             d = HASH[3];
  56.             e = HASH[4];
  57.             f = HASH[5];
  58.             g = HASH[6];
  59.             h = HASH[7];
  60.             for (var j = 0; j < 64; j++) {
  61.                 if (j < 16)
  62.                     W[j] = m[j + i];
  63.                 else
  64.                     W[j] = safe_add(safe_add(safe_add(Gamma1256(W[j - 2]), W[j - 7]), Gamma0256(W[j - 15])), W[j - 16]);
  65.                 T1 = safe_add(safe_add(safe_add(safe_add(h, Sigma1256(e)), Ch(e, f, g)), K[j]), W[j]);
  66.                 T2 = safe_add(Sigma0256(a), Maj(a, b, c));
  67.                 h = g;
  68.                 g = f;
  69.                 f = e;
  70.                 e = safe_add(d, T1);
  71.                 d = c;
  72.                 c = b;
  73.                 b = a;
  74.                 a = safe_add(T1, T2)
  75.             }
  76.             HASH[0] = safe_add(a, HASH[0]);
  77.             HASH[1] = safe_add(b, HASH[1]);
  78.             HASH[2] = safe_add(c, HASH[2]);
  79.             HASH[3] = safe_add(d, HASH[3]);
  80.             HASH[4] = safe_add(e, HASH[4]);
  81.             HASH[5] = safe_add(f, HASH[5]);
  82.             HASH[6] = safe_add(g, HASH[6]);
  83.             HASH[7] = safe_add(h, HASH[7])
  84.         }
  85.         return HASH
  86.     }
  87.  
  88.     function str2binb(str) {
  89.         var bin = Array();
  90.         var mask = (1 << chrsz) - 1;
  91.         for (var i = 0; i < str.length * chrsz; i += chrsz) {
  92.             bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - i % 32)
  93.         }
  94.         return bin
  95.     }
  96.  
  97.     function Utf8Encode(string) {
  98.         string = string.replace(/\r\n/g, "\n");
  99.         var utftext = "";
  100.         for (var n = 0; n < string.length; n++) {
  101.             var c = string.charCodeAt(n);
  102.             if (c < 128) {
  103.                 utftext += String.fromCharCode(c)
  104.             } else if ((c > 127) && (c < 2048)) {
  105.                 utftext += String.fromCharCode((c >> 6) | 192);
  106.                 utftext += String.fromCharCode((c & 63) | 128)
  107.             } else {
  108.                 utftext += String.fromCharCode((c >> 12) | 224);
  109.                 utftext += String.fromCharCode(((c >> 6) & 63) | 128);
  110.                 utftext += String.fromCharCode((c & 63) | 128)
  111.             }
  112.         }
  113.         return utftext
  114.     }
  115.  
  116.     function binb2hex(binarray) {
  117.         var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  118.         var str = "";
  119.         for (var i = 0; i < binarray.length * 4; i++) {
  120.             str += hex_tab.charAt((binarray[i >> 2] >> ((3 - i % 4) * 8 + 4)) & 0xF) + hex_tab.charAt((binarray[i >> 2] >> ((3 - i % 4) * 8)) & 0xF)
  121.         }
  122.         return str
  123.     }
  124.  
  125.     s = Utf8Encode(s);
  126.     return binb2hex(core_sha256(str2binb(s), s.length * chrsz))
  127. };

调用GEN_SHA256把body参数拿出来丢进去最后toString一下

6、第六部分，版本号

7、第七部分，时间戳

接下来的六、七部分当然也就不需要给出思路了，一个版本号一个时间戳，大家自行生成即可！！！

8、第八部分，AES 上面参数经过AES加密生成


实现算法如下所示：

  1. function _aesEncrypt(data) {
  2.     var i = CryptoJS.AES.encrypt(
  3.         data,
  4.         CryptoJS.enc.Utf8.parse('_M6Y?dvfN40VMF[X'), // 密钥
  5.         {
  6.             iv: CryptoJS.enc.Utf8.parse(["01", "02", "03", "04", "05", "06", "07", "08"].join(""))
  7.         }
  8.     );
  9.     return CryptoJS.enc.Base64.encode(i.ciphertext)
  10. }

data是什么？是ENV构造的环境参数，包括版本号、指纹、设备信息的参数。

最后，我们来测试一下校验一下这JS的算法效果，如下所示：

图1（nodejs测试源码环境）


当前纯算法稳定！无任何601，当然算法不对就是601，也不全是！比如价格接口它是有TLS指纹校验的，请求的时候用三方模块处理一下即可！不然的话也会出现601。

技术支持：

UVHvvJozOTg0ODg3MuW+ruS/oe+8mmJ5YzYzNTLmiJZtZXRhYnljZueUteaKpe+8mmJ5YzAx (base64解码)

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/weixin_40725706/article/detail/717305
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号