最重要的是看看sign是怎么来的,但是忽然看到appKey还是很复杂的,当然了 sign也不简单,可以看到的是 sign = u 那么u 怎么来的呢
u = 0; u < g.length; u += 16)
c = d,
l = h,
f = v,
p = m,
d = r(d, h, v, m, g[u + 0], 7, 3614090360),
m = r(m, d, h, v, g[u + 1], 12, 3905402710),
v = r(v, m, d, h, g[u + 2], 17, 606105819),
h = r(h, v, m, d, g[u + 3], 22, 3250441966),
d = r(d, h, v, m, g[u + 4], 7, 4118548399),
m = r(m, d, h, v, g[u + 5], 12, 1200080426),
v = r(v, m, d, h, g[u + 6], 17, 2821735955),
h = r(h, v, m, d, g[u + 7], 22, 4249261313),
d = r(d, h, v, m, g[u + 8], 7, 1770035416),
m = r(m, d, h, v, g[u + 9], 12, 2336552879),
v = r(v, m, d, h, g[u + 10], 17, 4294925233),
h = r(h, v, m, d, g[u + 11], 22, 2304563134),
d = r(d, h, v, m, g[u + 12], 7, 1804603682),
m = r(m, d, h, v, g[u + 13], 12, 4254626195),
v = r(v, m, d, h, g[u + 14], 17, 2792965006),
d = i(d, h = r(h, v, m, d, g[u + 15], 22, 1236535329), v, m, g[u + 1], 5, 4129170786),
m = i(m, d, h, v, g[u + 6], 9, 3225465664),
v = i(v, m, d, h, g[u + 11], 14, 643717713),
h = i(h, v, m, d, g[u + 0], 20, 3921069994),
d = i(d, h, v, m, g[u + 5], 5, 3593408605),
m = i(m, d, h, v, g[u + 10], 9, 38016083),
v = i(v, m, d, h, g[u + 15], 14, 3634488961),
h = i(h, v, m, d, g[u + 4], 20, 3889429448),
d = i(d, h, v, m, g[u + 9], 5, 568446438),
m = i(m, d, h, v, g[u + 14], 9, 3275163606),
v = i(v, m, d, h, g[u + 3], 14, 4107603335),
h = i(h, v, m, d, g[u + 8], 20, 1163531501),
d = i(d, h, v, m, g[u + 13], 5, 2850285829),
m = i(m, d, h, v, g[u + 2], 9, 4243563512),
v = i(v, m, d, h, g[u + 7], 14, 1735328473),
d = o(d, h = i(h, v, m, d, g[u + 12], 20, 2368359562), v, m, g[u + 5], 4, 4294588738),
m = o(m, d, h, v, g[u + 8], 11, 2272392833),
v = o(v, m, d, h, g[u + 11], 16, 1839030562),
h = o(h, v, m, d, g[u + 14], 23, 4259657740),
d = o(d, h, v, m, g[u + 1], 4, 2763975236),
m = o(m, d, h, v, g[u + 4], 11, 1272893353),
v = o(v, m, d, h, g[u + 7], 16, 4139469664),
h = o(h, v, m, d, g[u + 10], 23, 3200236656),
d = o(d, h, v, m, g[u + 13], 4, 681279174),
m = o(m, d, h, v, g[u + 0], 11, 3936430074),
v = o(v, m, d, h, g[u + 3], 16, 3572445317),
h = o(h, v, m, d, g[u + 6], 23, 76029189),
d = o(d, h, v, m, g[u + 9], 4, 3654602809),
m = o(m, d, h, v, g[u + 12], 11, 3873151461),
v = o(v, m, d, h, g[u + 15], 16, 530742520),
d = a(d, h = o(h, v, m, d, g[u + 2], 23, 3299628645), v, m, g[u + 0], 6, 4096336452),
m = a(m, d, h, v, g[u + 7], 10, 1126891415),
v = a(v, m, d, h, g[u + 14], 15, 2878612391),
h = a(h, v, m, d, g[u + 5], 21, 4237533241),
d = a(d, h, v, m, g[u + 12], 6, 1700485571),
m = a(m, d, h, v, g[u + 3], 10, 2399980690),
v = a(v, m, d, h, g[u + 10], 15, 4293915773),
h = a(h, v, m, d, g[u + 1], 21, 2240044497),
d = a(d, h, v, m, g[u + 8], 6, 1873313359),
m = a(m, d, h, v, g[u + 15], 10, 4264355552),
v = a(v, m, d, h, g[u + 6], 15, 2734768916),
h = a(h, v, m, d, g[u + 13], 21, 1309151649),
d = a(d, h, v, m, g[u + 4], 6, 4149444226),
m = a(m, d, h, v, g[u + 11], 10, 3174756917),
v = a(v, m, d, h, g[u + 2], 15, 718787259),
h = a(h, v, m, d, g[u + 9], 21, 3951481745),
d = n(d, c),
h = n(h, l),
v = n(v, f),
m = n(m, p);
return (s(d) + s(h) + s(v) + s(m)).toLowerCase()
}
看样子想搞U 必须先搞 G 这个G是个什么鬼玩意哦 我草
48个元素的数组,这东西
哎
!!!!!!!!!!!!
不要慌 不要慌 先来看下这个玩意
g 等于个啥呢,
如下代码
g = function(t) {
for (var e, n = t.length, r = n + 8, i = 16 * ((r - r % 64) / 64 + 1), o = new Array(i - 1), a = 0, s = 0; n > s; )
a = s % 4 * 8,
o[e = (s - s % 4) / 4] = o[e] | t.charCodeAt(s) << a,
s++;
return a = s % 4 * 8,
o[e = (s - s % 4) / 4] = o[e] | 128 << a,
o[i - 2] = n << 3,
o[i - 1] = n >>> 29,
o
}(t = function(t) {
t = t.replace(/\r\n/g, "\n");
for (var e = "", n = 0; n < t.length; n++) {
var r = t.charCodeAt(n);
128 > r ? e += String.fromCharCode(r) : r > 127 && 2048 > r ? (e += String.fromCharCode(r >> 6 | 192),
e += String.fromCharCode(63 & r | 128)) : (e += String.fromCharCode(r >> 12 | 224),
e += String.fromCharCode(r >> 6 & 63 | 128),
e += String.fromCharCode(63 & r | 128))
}
return e
}(t))
步骤拆解:
(t = function(t) {
t = t.replace(/\r\n/g, "\n");
for (var e = "", n = 0; n < t.length; n++) {
var r = t.charCodeAt(n);
128 > r ? e += String.fromCharCode(r) : r > 127 && 2048 > r ? (e += String.fromCharCode(r >> 6 | 192),
e += String.fromCharCode(63 & r | 128)) : (e += String.fromCharCode(r >> 12 | 224),
e += String.fromCharCode(r >> 6 & 63 | 128),
e += String.fromCharCode(63 & r | 128))
}
return e
}(t)
其中 t = b8c21261dec26f0c32e968788e1aaa86&1638781447239&12574478&{"city":"110100","advertiseCode":"1,19,18,31,34","advertiseType":4071,"platform":"8"}
算啦 上node把
这算是出来了
|
先保存下看下下面的代码情况