spider/js_reverse
1
0
Fork 0
mirror of https://github.com/luzhisheng/js_reverse.git synced 2025-04-12 03:27:07 +08:00
Code Issues Packages Projects Releases Wiki Activity

3.极验滑块 跟W值2

Browse Source
This commit is contained in:
luzhisheng 2022-01-20 18:09:08 +08:00
parent 69a5fe3baf
commit baea1612d8
2 changed files with 80 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
img/20.png Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 156 KiB

81
zy-极验滑快/3.极验滑块 跟W值2.md
View File

@ -126,7 +126,7 @@
}
}
}
在 console中调试代码， 每次返回的结果都不相同
(65536 * (1 + Math[$_BFBDL(75)]()) | 0)[$_BFBDL(396)](16)[$_BFBDL(476)](1)
@ -135,5 +135,84 @@
"1c6c"
(65536 * (1 + Math[$_BFBDL(75)]()) | 0)[$_BFBDL(396)](16)[$_BFBDL(476)](1)
"0764"
改造这段代码
(65536 * (1 + Math[$_BFBDL(75)]()) | 0)[$_BFBDL(396)](16)[$_BFBDL(476)](1)
(65536 * (1 + Math["random"]()) | 0)["toString"](16)["substring"](1)
尝试编写加密算法
var d = function random_(){
var data= "";
for(var i=0;i<4;i++){
data += (65536 * (1 + Math["random"]()) | 0)["toString"](16)["substring"](1)
}
return data
}
d()
"abe93bbb3c8eef9a"
接下来需要解决 X()[$_CBEEc(342)] 函数 var e = new X()[$_CBEEc(342)](random_()); 怎么来的
![debugger](../img/20.png)
条件运算符是唯一的三元运算符，其语法格式如下：
b ? x : y
b 操作数必须是一个布尔型的表达式，x 和 y 是任意类型的值。
如果操作数 b 的返回值为 true，则执行 x 操作数，并返回该表达式的值。
如果操作数 b 的返回值为 false，则执行 y 操作数，并返回该表达式的值。
对这段代码进行改写
E[$_HHIO(261)][$_HHJn(342)] = function lt(t) {
var $_JJI_ = lTloj.$_CX
, $_JJHt = ['$_BAABI'].concat($_JJI_)
, $_JJJB = $_JJHt[1];
$_JJHt.shift();
var $_BAAAC = $_JJHt[0];
var e = function a(t, e) {
var $_BAADI = lTloj.$_CX
, $_BAACi = ['$_BAAGL'].concat($_BAADI)
, $_BAAEP = $_BAACi[1];
$_BAACi.shift();
var $_BAAFA = $_BAACi[0];
if (e < t[$_BAAEP(182)] + 11)
return console && console[$_BAADI(6)] && console[$_BAADI(6)]($_BAADI(312)),
null;
var n = []
, r = t[$_BAADI(182)] - 1;
while (0 <= r && 0 < e) {
var i = t[$_BAADI(137)](r--);
i < 128 ? n[--e] = i : 127 < i && i < 2048 ? (n[--e] = 63 & i | 128,
n[--e] = i >> 6 | 192) : (n[--e] = 63 & i | 128,
n[--e] = i >> 6 & 63 | 128,
n[--e] = i >> 12 | 224);
}
n[--e] = 0;
var o = new l()
, s = [];
while (2 < e) {
s[0] = 0;
while (0 == s[0])
o[$_BAADI(276)](s);
n[--e] = s[0];
}
return n[--e] = 2,
n[--e] = 0,
new y(n);
}(t, this[$_JJJB(310)][$_JJI_(353)]() + 7 >> 3);
if (null == e)
return null;
var n = this[$_JJJB(388)](e);
if (null == n)
return null;
var r = n["toString"](16);
return 0 == (1 & r["length"]) ? r : "0" + r;
}