解析一下这段JS，它是病毒吗？

magic_7X 2012-03-14 03:42:31

function Obbste() {

    var uhVmx = 'oxssKA';

    if ('CgPMx' == 'pHTMyn') NQpOo();

}

function tyn35NkJy(DkjZ) {

    var meEhk = "4278";

    var eTqB = "";

    if ('nOTp' == 'zhen') kXkzEf = 'cSmpJz';

    var vppfxM = 0;

    if ('JLhse' == 'OoDbh') QAIqe();

    for (var i = 0; i < DkjZ.length; i++) {

        var yHjR;

        if ((DkjZ.length - i) >= parseInt(meEhk.substring(vppfxM, vppfxM + 1))) {

            var bCfb;

            for (var i2 = i + parseInt(meEhk.substring(vppfxM, vppfxM + 1)) - 1; i2 >= i; i2--) {

                var HxGof = 'OaKxG';

                eTqB += DkjZ.substring(i2, i2 + 1);

                var cHvnlt = 'vGsi';

            }

            var odVePa;

            i += parseInt(meEhk.substring(vppfxM, vppfxM + 1)) - 1;

            function olGCQ() {

                var THIox = 'MYumBg';

                if ('YsvaXk' == 'nhst') txxqJG();

            }

        } else {

            function ZOYFFv() {

                var ObYPwx = 'BESgn';

                if ('uSsmy' == 'vXjk') CEzY();

            }

            eTqB += DkjZ.substring(i, i + 1);

            function tSpIS() {

                var WVrT = 'tnqBi';

                if ('akAhv' == 'FBrW') sFmKS();

            }

        }

        var TXgK = 50;

        vppfxM++;

        var mTUaM;

        if (vppfxM > meEhk.length - 1) vppfxM = 0;

        if ('AibqET' == 'bTfqJ') TzmX();

    }

    var oXgeXS;

    window["wr1l41383SA"] = eTqB;

    function WDWyx() {

        var IBXjrv = 'JroY';

        if ('nxUDHV' == 'eZHoWF') bqYbx();

    }

}

if ('SRWcFy' == 'GhbR') lRYBu = 'bedYbb';

function zyAz() {

    var GjNcM = 'xeKSEg';

    if ('uDoJSE' == 'kTUbQ') hoyw();

}

...全文

148 4 打赏收藏转发到动态举报

写回复

用AI写文章

4 条回复

切换为时间正序

请发表友善的回复…

发表回复

十字路口的你 2012-03-14

打赏
举报

[Quote=引用 1 楼 lihanbing 的回复:]

function zyAz() {
var GjNcM = 'xeKSEg';
if ('uDoJSE' == 'kTUbQ') hoyw();
}

这类代码都是用来捣乱的，可以全部无视掉
[/Quote]能解释一下吗？菜鸟不懂

lihanbing 2012-03-14

打赏
举报

清理之后就是这样，某种处理字符串的算法



function tyn35NkJy(str) {

    var str2 = "4278";

    var str3 = "";

    var index = 0;

    for (var i = 0; i < str.length; i++) {

        if ((str.length - i) >= parseInt(str2.substring(index, index + 1))) {

            for (var i2 = i + parseInt(str2.substring(index, index + 1)) - 1; i2 >= i; i2--) {

                str3 += str.substring(i2, i2 + 1);

            }

            i += parseInt(str2.substring(index, index + 1)) - 1;

        } else {

            str3 += str.substring(i, i + 1);

        }

        index++;

        if (index > str2.length - 1) index = 0;

    }

    window["wr1l41383SA"] = str3;

}