Skip to content

examp1o/javascriptObfuscate

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 

Repository files navigation

javascriptObfuscate

javascript obfuscate obfuscator js 混淆

访问地址如下: http://code.365xan.com/index.html

var a='who care?';
(function(){
   alert(a);
})();

混淆后代码

try {
    ! function(n) {
        ! function(n, t, c, u, e, r, i, o, a, f, s, v, h, l, b, d, w, g, k, y, p, x, F, j, m, q, z, A, B, C, D, E) {
            ! function() {
                var t = c;
                ! function() {
                    var c = function(n, t) {
                            return n + t
                        },
                        i = u,
                        v = e,
                        h = function(n, t) {
                            return n !== t
                        },
                        l = function(n, t) {
                            return n % t
                        };
                    (function() {
                        var n = !![];
                        return function(t, c) {
                            var u = n ? function() {
                                if (c) {
                                    var n = c[r](t, arguments);
                                    return c = null, n
                                }
                            } : function() {};
                            return n = ![], u
                        }
                    })()(this, function() {
                        var t = function(n, t) {
                                return c(n, t)
                            },
                            u = function(n, t) {
                                return c(n, t)
                            },
                            e = i,
                            r = v,
                            b = function() {},
                            w = function() {
                                var c;
                                try {
                                    c = n[o](t(u(e, r), a))()
                                } catch (t) {
                                    c = n[f]
                                }
                                return c
                            }();
                        if (w[s])
                            for (var k = 38; h(k, void 0);) {
                                switch (l(k, 7)) {
                                    case 0:
                                        w[s][x] = b, k = 5;
                                        continue;
                                    case 1:
                                        w[s][q] = b, k = 4;
                                        continue;
                                    case 2:
                                        w[s][g] = b, k = d;
                                        continue;
                                    case 3:
                                        w[s][j] = b, k = 1;
                                        continue;
                                    case 4:
                                        w[s][B] = b, k = 6;
                                        continue;
                                    case 5:
                                        w[s][A] = b, k = 2;
                                        continue;
                                    case 6:
                                        w[s][y] = b, k = 0;
                                        continue
                                }
                                break
                            }
                        else w[s] = function(n) {
                            for (var t = 9;

                                function(n, t) {
                                    return n !== t
                                }(t, void 0);) {
                                switch (function(n, t) {
                                    return n % t
                                }(t, 9)) {
                                    case 0:
                                        var c = {};
                                        t = 5;
                                        continue;
                                    case 1:
                                        return c;
                                    case 2:
                                        c[g] = n, t = 1;
                                        continue;
                                    case 3:
                                        c[y] = n, t = 4;
                                        continue;
                                    case 4:
                                        c[x] = n, t = 7;
                                        continue;
                                    case 5:
                                        c[j] = n, t = 6;
                                        continue;
                                    case 6:
                                        c[q] = n, t = 8;
                                        continue;
                                    case 7:
                                        c[A] = n, t = 2;
                                        continue;
                                    case 8:
                                        c[B] = n, t = 3;
                                        continue
                                }
                                break
                            }
                        }(b)
                    })(), n[D](t)
                }()
            }()
        }(this, 0, n(0, 1, 2, 3, 4, 5, 6, 7, 8), n(6, 7, 9, 10, 6, 11, 3, 12, 13, 10, 11, 4, 9, 14, 2, 11, 12, 15, 3), n(16, 17, 18, 4, 2, 11, 19, 9, 6, 10, 4, 9, 2, 6, 12, 20, 6, 7, 9, 10, 6, 11, 3, 9, 1, 14, 19, 20, 15, 12, 3, 15), n(5, 21, 21, 22, 23), 0, n(24, 10, 11, 4, 9, 14, 2, 11), n(15, 25), n(0, 14, 11, 26, 2, 0), n(4, 2, 11, 19, 2, 22, 7), 0, 0, 0, 0, n(10, 11, 26, 7, 13, 14, 11, 7, 26), 0, n(9, 6, 5, 4, 7), 0, n(14, 11, 13, 2), 0, n(7, 6, 6, 2, 6), 0, n(22, 2, 27), 0, n(0, 5, 6, 11), 0, n(7, 28, 4, 7, 21, 9, 14, 2, 11), n(26, 7, 29, 10, 27), 0, n(5, 22, 7, 6, 9), n(30, 30, 30, 30, 30, 30, 30, 30, 30))
    }(function(n) {
        return function() {
            for (var t = arguments, c = "", u = 0, e = t.length; u < e; u++) c += n[t[u]];
            return c
        }
    }(["w", "h", "o", " ", "c", "a", "r", "e", "?", "t", "u", "n", "(", "f", "i", ")", "{", "}", ".", "s", '"', "p", "l", "y", "F", ";", "d", "g", "x", "b", "1"]));
} catch (e) {}

About

javascript obfuscate obfuscator js 混淆

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors