flashfxp解密

番茄系统家园 · 2022-03-14 03:01:42

amxku's blog

amxku PS:一个是7j写的,一个是国外的,相比之下,国外的那个东,速度要快一些,7J可能该郁闷了。呵呵,学习学习。 function flashfxp($data)

{
$pass=substr($data, 2); $flashfxp_key = array(y,0,A,0,3,0,6,0,z,0,A,0,4,0,8,0,d,0,E,0,h,0,f,0,r,0,v,0,g,0,h,0,G,0,R,0,g,0,5,0,7,0,h,0,5,0,U,0,l,0,D,0,v,0,3); for ($i=0; $i {
$run = (Hexdec(substr($pass, $i, 2)) ^ Hexdec(DecHex(ord($flashfxp_key[$i])))) - Hexdec(substr($data, $i, 2)); if ($run $run=$run 255; $Num.=chr($run);
} return $Num;
}

国外的一个 function decryptffxp($ciphertext)

{
$magic_buffer="yA36zA48dEhfrvghGRg57h5UlDv3";
$count =0;
$length =strlen($ciphertext); while ($count {
$cts.=chr(hexdec($ciphertext[$count] . $ciphertext[$count 1]));
$count =2;
} $length =strlen($cts);
$count =0;
$mbcount=0; while ($count 1 {
$foo = ord($cts[$count 1]) ^ ord($magic_buffer[$mbcount]); if ($foo - ord($cts[$count]) {
$plaintext.=chr($foo - ord($cts[$count]) 255);
}
else
{
$plaintext.=chr($foo - ord($cts[$count]));
} $count;
$mbcount; if ($mbcount == 28)
{
$mbcount=0;
}
} return $plaintext;
}

免责声明: 凡标注转载/编译字样内容并非本站原创,转载目的在于传递更多信息,并不代表本网赞同其观点和对其真实性负责。如果你觉得本文好,欢迎推荐给朋友阅读;本文链接: https://m.nndssk.com/wlaq/1724709fesJ3.html
猜你喜欢
最新应用
热门应用