當前位置:編程學習大全網 - 網絡軟體 - 誰會解密下面的代碼? <?php if (!function_exists("T7FC56270E7A70FA81A5935B72EACBE29")) { function …

誰會解密下面的代碼? <?php if (!function_exists("T7FC56270E7A70FA81A5935B72EACBE29")) { function …

<?php

if (!function_exists("A"))

{

function A($O)

{

$O = base64_decode($O);

$A = 0;

$B = 0;

$C = 0;

$C = (ord($O[1]) << 8) + ord($O[2]);

$E = 3;

$F = 0;

$G = 16;

$H = "";

$I = strlen($O);

$J = __FILE__;

$J = file_get_contents($J);

$K = 0;

preg_match(base64_decode("LyhwcmludHxzcHJpbnR8ZWNobykv"), $J, $K); // base64_decode("LyhwcmludHxzcHJpbnR8ZWNobykv")=/(print|sprint|echo)/

for (;$E<$I;)

{

if (count($K)) exit;

if ($G == 0)

{

$C = (ord($O[$E++]) << 8);

$C += ord($O[$E++]);

$G = 16;

}

if ($C & 0x8000)

{

$A = (ord($O[$E++]) << 4);

$A += (ord($O[$E]) >> 4);

if ($A)

{

$B = (ord($O[$E++]) & 0x0F) + 3;

for ($C = 0; $C < $B; $C++) $H[$F+$C] = $H[$F-$A+$C];

$F += $B;

}

else

{

$B = (ord($O[$E++]) << 8);

$B += ord($O[$E++]) + 16;

for ($C = 0; $C < $B; $H[$F+$C++] = $O[$E]); $E++; $F += $B;

}

}

else $H[$F++] = $O[$E++];

$C <<= 1;

$G--;

if ($E == $I)

{

$J = implode("", $H);

$J = "?".">".$J."<"."?";

return $J;

}

}

}

}

$var="壹個64位編碼的字段"

echo A($var);

>

  • 上一篇:壓力大小的公式是什麽?
  • 下一篇:無線路由器使用高增益天線能增加多少米使用範圍?
  • copyright 2024編程學習大全網