抓包分析

image-20260120231008907

加密为url的m值,和13题一样

image-20260120231101916

image-20260120231156548

一直下一步

image-20260120231231108

r.open函数进去后

image-20260120231405878

image-20260120231425650

找到最后加密点和加密函数

image-20260120231451944

进行ob转换已经修改后得到的代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
function B(b, f, p) {
return b ^ f << p % 8;
}
function J(b, f, p) {
if ('Vorzg' === 'Vorzg') {
return b ^ f >> p % 8;
} else {
return Q ^ v << d % 8;
}
}
function Y(b, f) {
return (b = b + f - f) ^ f;
}
function x(b) {
ts = new Date().getTime();
dd = b;
var p = function (N) {
let W = 0;
for (let L = 0; L < N.length; L++) {
var O = N.charCodeAt(L);
for (let y = 0; y < 20; y++) {
switch (y % 3) {
case 0:
W = B.apply(null, [W, O, y]);
break;
case 1:
W = J.apply(null, [W, O, y]);
break;
case 2:
W = Y.apply(null, [W, O]);
}
}
}
return W;
}('dasdasdarqwdasdasqwdasda' + ts);
var s = ["?", "m", "="].join("");
var p = p.toString(16);
return function (N) {
var W ='ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
let O = "";
let L;
let y;
let k;
let H;
let D;
let K;
let S;
let I = 0;
for (; I < N.length;) {
L = N.charCodeAt(I++);
y = I < N.length ? N.charCodeAt(I++) : 0;
k = I < N.length ? N.charCodeAt(I++) : 0;
H = L >> 2;
D = (L & 3) << 4 | y >> 4;
K = (y & 15) << 2 | (k >> 6);
S = k & 63;
if (isNaN(y)) {
K = S = 64;
} else if (isNaN(k)) {
S = 64;
}
O = O + W.charAt(H) + W['charAt'](D) + W['charAt'](K) + W.charAt(S);
}
return O;
}(p + ts);
}


console.log(x());

image-20260121220614056image-20260121221134316

更多内容也在公众号更新:码字的秃猴

tuhou