最新爬取网易云音乐

闲话少说上代码!我们通过配置代理服务器从而实现借窝下蛋,搭建一个自己的音乐网站,本期爬取的是网易云,未来还会陆续推出qq 酷狗等 话说酷狗真的一点也不酷 属实是小气了。

这么一大坨代码就是进行参数加密的代码,直copy到一个你本地的js文件即可

var arg2 = "010001",
    arg3 = "00e0b509f6259df8642dbc35662901477df22677ec152b5ff68ace615bb7b725152b3ab17a876aea8a5aa76d2e417629ec4ee341f56135fccf695280104e0312ecbda92557c93870114af6c9d05c4f7f0c3685b7a46bee255932575cce10b424d813cfe4875d3e82047b97ddef52741d546b8e289dc6935b3ece0462db0a22b8e7"
arg4 = "0CoJUm6Qyw8W8jud";



// NEJ
(function () {
    window.NEJ = window.NEJ || {};
    NEJ.O = {};
    NEJ.R = [];
    NEJ.F = function () {
        return !1
    }
        ;
    NEJ.P = function (Fv4z) {
        if (!Fv4z || !Fv4z.length)
            return null;
        var bcr1x = window;
        for (var a = Fv4z.split("."), l = a.length, i = a[0] == "window" ? 1 : 0; i < l; bcr1x = bcr1x[a[i]] = bcr1x[a[i]] || {},
            i++)
            ;
        return bcr1x
    }
        ;
    NEJ.Q = function (bM8E, Fv4z) {
        bM8E = bM8E || NEJ.O;
        var bw8o = Fv4z.split(".");
        for (var i = 0, l = bw8o.length; i < l; i++) {
            bM8E = bM8E[bw8o[i]];
            if (!bM8E)
                break
        }
        return bM8E
    }
        ;
    NEJ.C = function () {
        var bBJ0x = function () {
            return NEJ.O.toString.call(arguments[0]) != "[object Function]"
        };
        var bBK0x = function (D8v, bD8v) {
            for (var x in bD8v)
                if (D8v == bD8v[x])
                    return x;
            return null
        };
        var bym0x = {
            cy8q: 0,
            bn8f: 1,
            bB8t: 2,
            bW8O: 3,
            bK8C: 4,
            fs9j: 5,
            lc0x: 6,
            ey9p: 7
        }
            , xB3x = {
                cD8v: 0,
                bp8h: 1,
                bH8z: 2,
                cg8Y: 3,
                bT8L: 4,
                gR9I: 5,
                ma0x: 6,
                fZ9Q: 7
            };
        return function () {
            var fW9N = function () {
                this.bCn0x();
                return this.cy8q.apply(this, arguments)
            };
            fW9N.prototype.bCn0x = NEJ.F;
            fW9N.prototype.cy8q = NEJ.F;
            fW9N.M8E = function (DO4S, bDm0x) {
                if (bBJ0x(DO4S))
                    return;
                if (bDm0x == null || !!bDm0x)
                    NEJ.X(this, DO4S, bBJ0x);
                this.cuO5T = DO4S;
                this.ct8l = DO4S.prototype;
                var bL8D = function () { };
                bL8D.prototype = DO4S.prototype;
                this.prototype = new bL8D;
                var FI4M = this.prototype;
                FI4M.constructor = this;
                var cl8d;
                for (var x in bym0x) {
                    cl8d = bBK0x(bym0x[x], xB3x);
                    if (!cl8d || !this.ct8l[x])
                        continue;
                    FI4M[x] = function (Z8R) {
                        return function () {
                            this[Z8R].apply(this, arguments)
                        }
                    }(cl8d)
                }
                var FL4P = {};
                for (var x in xB3x) {
                    cl8d = bBK0x(xB3x[x], bym0x);
                    if (!cl8d || !this.ct8l[cl8d])
                        continue;
                    FL4P[cl8d] = DO4S;
                    FI4M[x] = function (Z8R) {
                        return function () {
                            var m8e, bL8D = this.bqt9k[Z8R], biq8i = bL8D.prototype[Z8R];
                            this.bqt9k[Z8R] = bL8D.cuO5T || DO4S;
                            if (!!biq8i)
                                m8e = biq8i.apply(this, arguments);
                            this.bqt9k[Z8R] = DO4S;
                            return m8e
                        }
                    }(cl8d)
                }
                FI4M.bCn0x = function () {
                    this.bqt9k = NEJ.X({}, FL4P)
                }
                    ;
                FI4M.cQl8d = FI4M.cD8v;
                return FI4M
            }
                ;
            return fW9N
        }
    }();
    NEJ.X = function (gI9z, bU8M, eh9Y) {
        if (!gI9z || !bU8M)
            return gI9z;
        eh9Y = eh9Y || NEJ.F;
        for (var x in bU8M) {
            if (bU8M.hasOwnProperty(x) && !eh9Y(bU8M[x], x))
                gI9z[x] = bU8M[x]
        }
        return gI9z
    }
        ;
    NEJ.EX = function (gI9z, bU8M) {
        if (!gI9z || !bU8M)
            return gI9z;
        for (var x in gI9z) {
            if (gI9z.hasOwnProperty(x) && bU8M[x] != null)
                gI9z[x] = bU8M[x]
        }
        return gI9z
    }

})();

// CryptoJS
var CryptoJS = CryptoJS || function (u, p) {
    var d = {}
        , l = d.lib = {}
        , s = function () { }
        , t = l.Base = {
            extend: function (a) {
                s.prototype = this;
                var c = new s;
                a && c.mixIn(a);
                c.hasOwnProperty("init") || (c.init = function () {
                    c.$super.init.apply(this, arguments)
                }
                );
                c.init.prototype = c;
                c.$super = this;
                return c
            },
            create: function () {
                var a = this.extend();
                a.init.apply(a, arguments);
                return a
            },
            init: function () { },
            mixIn: function (a) {
                for (var c in a)
                    a.hasOwnProperty(c) && (this[c] = a[c]);
                a.hasOwnProperty("toString") && (this.toString = a.toString)
            },
            clone: function () {
                return this.init.prototype.extend(this)
            }
        }
        , r = l.WordArray = t.extend({
            init: function (a, c) {
                a = this.words = a || [];
                this.sigBytes = c != p ? c : 4 * a.length
            },
            toString: function (a) {
                return (a || v).stringify(this)
            },
            concat: function (a) {
                var c = this.words
                    , e = a.words
                    , j = this.sigBytes;
                a = a.sigBytes;
                this.clamp();
                if (j % 4)
                    for (var k = 0; k < a; k++)
                        c[j + k >>> 2] |= (e[k >>> 2] >>> 24 - 8 * (k % 4) & 255) << 24 - 8 * ((j + k) % 4);
                else if (65535 < e.length)
                    for (k = 0; k < a; k += 4)
                        c[j + k >>> 2] = e[k >>> 2];
                else
                    c.push.apply(c, e);
                this.sigBytes += a;
                return this
            },
            clamp: function () {
                var a = this.words
                    , c = this.sigBytes;
                a[c >>> 2] &= 4294967295 << 32 - 8 * (c % 4);
                a.length = u.ceil(c / 4)
            },
            clone: function () {
                var a = t.clone.call(this);
                a.words = this.words.slice(0);
                return a
            },
            random: function (a) {
                for (var c = [], e = 0; e < a; e += 4)
                    c.push(4294967296 * u.random() | 0);
                return new r.init(c, a)
            }
        })
        , w = d.enc = {}
        , v = w.Hex = {
            stringify: function (a) {
                var c = a.words;
                a = a.sigBytes;
                for (var e = [], j = 0; j < a; j++) {
                    var k = c[j >>> 2] >>> 24 - 8 * (j % 4) & 255;
                    e.push((k >>> 4).toString(16));
                    e.push((k & 15).toString(16))
                }
                return e.join("")
            },
            parse: function (a) {
                for (var c = a.length, e = [], j = 0; j < c; j += 2)
                    e[j >>> 3] |= parseInt(a.substr(j, 2), 16) << 24 - 4 * (j % 8);
                return new r.init(e, c / 2)
            }
        }
        , b = w.Latin1 = {
            stringify: function (a) {
                var c = a.words;
                a = a.sigBytes;
                for (var e = [], j = 0; j < a; j++)
                    e.push(String.fromCharCode(c[j >>> 2] >>> 24 - 8 * (j % 4) & 255));
                return e.join("")
            },
            parse: function (a) {
                for (var c = a.length, e = [], j = 0; j < c; j++)
                    e[j >>> 2] |= (a.charCodeAt(j) & 255) << 24 - 8 * (j % 4);
                return new r.init(e, c)
            }
        }
        , x = w.Utf8 = {
            stringify: function (a) {
                try {
                    return decodeURIComponent(escape(b.stringify(a)))
                } catch (c) {
                    throw Error("Malformed UTF-8 data")
                }
            },
            parse: function (a) {
                return b.parse(unescape(encodeURIComponent(a)))
            }
        }
        , q = l.BufferedBlockAlgorithm = t.extend({
            reset: function () {
                this.i8a = new r.init;
                this.yp3x = 0
            },
            Cj4n: function (a) {
                "string" == typeof a && (a = x.parse(a));
                this.i8a.concat(a);
                this.yp3x += a.sigBytes
            },
            nc1x: function (a) {
                var c = this.i8a
                    , e = c.words
                    , j = c.sigBytes
                    , k = this.blockSize
                    , b = j / (4 * k)
                    , b = a ? u.ceil(b) : u.max((b | 0) - this.Sz9q, 0);
                a = b * k;
                j = u.min(4 * a, j);
                if (a) {
                    for (var q = 0; q < a; q += k)
                        this.sH2x(e, q);
                    q = e.splice(0, a);
                    c.sigBytes -= j
                }
                return new r.init(q, j)
            },
            clone: function () {
                var a = t.clone.call(this);
                a.i8a = this.i8a.clone();
                return a
            },
            Sz9q: 0
        });
    l.Hasher = q.extend({
        cfg: t.extend(),
        init: function (a) {
            this.cfg = this.cfg.extend(a);
            this.reset()
        },
        reset: function () {
            q.reset.call(this);
            this.mh0x()
        },
        update: function (a) {
            this.Cj4n(a);
            this.nc1x();
            return this
        },
        finalize: function (a) {
            a && this.Cj4n(a);
            return this.nQ1x()
        },
        blockSize: 16,
        mW1x: function (a) {
            return function (b, e) {
                return (new a.init(e)).finalize(b)
            }
        },
        yI3x: function (a) {
            return function (b, e) {
                return (new n.HMAC.init(a, e)).finalize(b)
            }
        }
    });
    var n = d.algo = {};
    return d
}(Math);


(function () {
    var u = CryptoJS
        , p = u.lib.WordArray;
    u.enc.Base64 = {
        stringify: function (d) {
            var l = d.words
                , p = d.sigBytes
                , t = this.bD8v;
            d.clamp();
            d = [];
            for (var r = 0; r < p; r += 3)
                for (var w = (l[r >>> 2] >>> 24 - 8 * (r % 4) & 255) << 16 | (l[r + 1 >>> 2] >>> 24 - 8 * ((r + 1) % 4) & 255) << 8 | l[r + 2 >>> 2] >>> 24 - 8 * ((r + 2) % 4) & 255, v = 0; 4 > v && r + .75 * v < p; v++)
                    d.push(t.charAt(w >>> 6 * (3 - v) & 63));
            if (l = t.charAt(64))
                for (; d.length % 4;)
                    d.push(l);
            return d.join("")
        },
        parse: function (d) {
            var l = d.length
                , s = this.bD8v
                , t = s.charAt(64);
            t && (t = d.indexOf(t),
                -1 != t && (l = t));
            for (var t = [], r = 0, w = 0; w < l; w++)
                if (w % 4) {
                    var v = s.indexOf(d.charAt(w - 1)) << 2 * (w % 4)
                        , b = s.indexOf(d.charAt(w)) >>> 6 - 2 * (w % 4);
                    t[r >>> 2] |= (v | b) << 24 - 8 * (r % 4);
                    r++
                }
            return p.create(t, r)
        },
        bD8v: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
    }
}
)();
(function (u) {
    function p(b, n, a, c, e, j, k) {
        b = b + (n & a | ~n & c) + e + k;
        return (b << j | b >>> 32 - j) + n
    }
    function d(b, n, a, c, e, j, k) {
        b = b + (n & c | a & ~c) + e + k;
        return (b << j | b >>> 32 - j) + n
    }
    function l(b, n, a, c, e, j, k) {
        b = b + (n ^ a ^ c) + e + k;
        return (b << j | b >>> 32 - j) + n
    }
    function s(b, n, a, c, e, j, k) {
        b = b + (a ^ (n | ~c)) + e + k;
        return (b << j | b >>> 32 - j) + n
    }
    for (var t = CryptoJS, r = t.lib, w = r.WordArray, v = r.Hasher, r = t.algo, b = [], x = 0; 64 > x; x++)
        b[x] = 4294967296 * u.abs(u.sin(x + 1)) | 0;
    r = r.MD5 = v.extend({
        mh0x: function () {
            this.cU8M = new w.init([1732584193, 4023233417, 2562383102, 271733878])
        },
        sH2x: function (q, n) {
            for (var a = 0; 16 > a; a++) {
                var c = n + a
                    , e = q[c];
                q[c] = (e << 8 | e >>> 24) & 16711935 | (e << 24 | e >>> 8) & 4278255360
            }
            var a = this.cU8M.words
                , c = q[n + 0]
                , e = q[n + 1]
                , j = q[n + 2]
                , k = q[n + 3]
                , z = q[n + 4]
                , r = q[n + 5]
                , t = q[n + 6]
                , w = q[n + 7]
                , v = q[n + 8]
                , A = q[n + 9]
                , B = q[n + 10]
                , C = q[n + 11]
                , u = q[n + 12]
                , D = q[n + 13]
                , E = q[n + 14]
                , x = q[n + 15]
                , f = a[0]
                , m = a[1]
                , g = a[2]
                , h = a[3]
                , f = p(f, m, g, h, c, 7, b[0])
                , h = p(h, f, m, g, e, 12, b[1])
                , g = p(g, h, f, m, j, 17, b[2])
                , m = p(m, g, h, f, k, 22, b[3])
                , f = p(f, m, g, h, z, 7, b[4])
                , h = p(h, f, m, g, r, 12, b[5])
                , g = p(g, h, f, m, t, 17, b[6])
                , m = p(m, g, h, f, w, 22, b[7])
                , f = p(f, m, g, h, v, 7, b[8])
                , h = p(h, f, m, g, A, 12, b[9])
                , g = p(g, h, f, m, B, 17, b[10])
                , m = p(m, g, h, f, C, 22, b[11])
                , f = p(f, m, g, h, u, 7, b[12])
                , h = p(h, f, m, g, D, 12, b[13])
                , g = p(g, h, f, m, E, 17, b[14])
                , m = p(m, g, h, f, x, 22, b[15])
                , f = d(f, m, g, h, e, 5, b[16])
                , h = d(h, f, m, g, t, 9, b[17])
                , g = d(g, h, f, m, C, 14, b[18])
                , m = d(m, g, h, f, c, 20, b[19])
                , f = d(f, m, g, h, r, 5, b[20])
                , h = d(h, f, m, g, B, 9, b[21])
                , g = d(g, h, f, m, x, 14, b[22])
                , m = d(m, g, h, f, z, 20, b[23])
                , f = d(f, m, g, h, A, 5, b[24])
                , h = d(h, f, m, g, E, 9, b[25])
                , g = d(g, h, f, m, k, 14, b[26])
                , m = d(m, g, h, f, v, 20, b[27])
                , f = d(f, m, g, h, D, 5, b[28])
                , h = d(h, f, m, g, j, 9, b[29])
                , g = d(g, h, f, m, w, 14, b[30])
                , m = d(m, g, h, f, u, 20, b[31])
                , f = l(f, m, g, h, r, 4, b[32])
                , h = l(h, f, m, g, v, 11, b[33])
                , g = l(g, h, f, m, C, 16, b[34])
                , m = l(m, g, h, f, E, 23, b[35])
                , f = l(f, m, g, h, e, 4, b[36])
                , h = l(h, f, m, g, z, 11, b[37])
                , g = l(g, h, f, m, w, 16, b[38])
                , m = l(m, g, h, f, B, 23, b[39])
                , f = l(f, m, g, h, D, 4, b[40])
                , h = l(h, f, m, g, c, 11, b[41])
                , g = l(g, h, f, m, k, 16, b[42])
                , m = l(m, g, h, f, t, 23, b[43])
                , f = l(f, m, g, h, A, 4, b[44])
                , h = l(h, f, m, g, u, 11, b[45])
                , g = l(g, h, f, m, x, 16, b[46])
                , m = l(m, g, h, f, j, 23, b[47])
                , f = s(f, m, g, h, c, 6, b[48])
                , h = s(h, f, m, g, w, 10, b[49])
                , g = s(g, h, f, m, E, 15, b[50])
                , m = s(m, g, h, f, r, 21, b[51])
                , f = s(f, m, g, h, u, 6, b[52])
                , h = s(h, f, m, g, k, 10, b[53])
                , g = s(g, h, f, m, B, 15, b[54])
                , m = s(m, g, h, f, e, 21, b[55])
                , f = s(f, m, g, h, v, 6, b[56])
                , h = s(h, f, m, g, x, 10, b[57])
                , g = s(g, h, f, m, t, 15, b[58])
                , m = s(m, g, h, f, D, 21, b[59])
                , f = s(f, m, g, h, z, 6, b[60])
                , h = s(h, f, m, g, C, 10, b[61])
                , g = s(g, h, f, m, j, 15, b[62])
                , m = s(m, g, h, f, A, 21, b[63]);
            a[0] = a[0] + f | 0;
            a[1] = a[1] + m | 0;
            a[2] = a[2] + g | 0;
            a[3] = a[3] + h | 0
        },
        nQ1x: function () {
            var b = this.i8a
                , n = b.words
                , a = 8 * this.yp3x
                , c = 8 * b.sigBytes;
            n[c >>> 5] |= 128 << 24 - c % 32;
            var e = u.floor(a / 4294967296);
            n[(c + 64 >>> 9 << 4) + 15] = (e << 8 | e >>> 24) & 16711935 | (e << 24 | e >>> 8) & 4278255360;
            n[(c + 64 >>> 9 << 4) + 14] = (a << 8 | a >>> 24) & 16711935 | (a << 24 | a >>> 8) & 4278255360;
            b.sigBytes = 4 * (n.length + 1);
            this.nc1x();
            b = this.cU8M;
            n = b.words;
            for (a = 0; 4 > a; a++)
                c = n[a],
                    n[a] = (c << 8 | c >>> 24) & 16711935 | (c << 24 | c >>> 8) & 4278255360;
            return b
        },
        clone: function () {
            var b = v.clone.call(this);
            b.cU8M = this.cU8M.clone();
            return b
        }
    });
    t.MD5 = v.mW1x(r);
    t.HmacMD5 = v.yI3x(r)
}
)(Math);
(function () {
    var u = CryptoJS
        , p = u.lib
        , d = p.Base
        , l = p.WordArray
        , p = u.algo
        , s = p.EvpKDF = d.extend({
            cfg: d.extend({
                keySize: 4,
                hasher: p.MD5,
                iterations: 1
            }),
            init: function (d) {
                this.cfg = this.cfg.extend(d)
            },
            compute: function (d, r) {
                for (var p = this.cfg, s = p.hasher.create(), b = l.create(), u = b.words, q = p.keySize, p = p.iterations; u.length < q;) {
                    n && s.update(n);
                    var n = s.update(d).finalize(r);
                    s.reset();
                    for (var a = 1; a < p; a++)
                        n = s.finalize(n),
                            s.reset();
                    b.concat(n)
                }
                b.sigBytes = 4 * q;
                return b
            }
        });
    u.EvpKDF = function (d, l, p) {
        return s.create(p).compute(d, l)
    }
}
)();

CryptoJS.lib.Cipher || function (u) {
    var p = CryptoJS
        , d = p.lib
        , l = d.Base
        , s = d.WordArray
        , t = d.BufferedBlockAlgorithm
        , r = p.enc.Base64
        , w = p.algo.EvpKDF
        , v = d.Cipher = t.extend({
            cfg: l.extend(),
            createEncryptor: function (e, a) {
                return this.create(this.IV8N, e, a)
            },
            createDecryptor: function (e, a) {
                return this.create(this.brP9G, e, a)
            },
            init: function (e, a, b) {
                this.cfg = this.cfg.extend(b);
                this.Sv9m = e;
                this.J8B = a;
                this.reset()
            },
            reset: function () {
                t.reset.call(this);
                this.mh0x()
            },
            process: function (e) {
                this.Cj4n(e);
                return this.nc1x()
            },
            finalize: function (e) {
                e && this.Cj4n(e);
                return this.nQ1x()
            },
            keySize: 4,
            ivSize: 4,
            IV8N: 1,
            brP9G: 2,
            mW1x: function (e) {
                return {
                    encrypt: function (b, k, d) {
                        return ("string" == typeof k ? c : a).encrypt(e, b, k, d)
                    },
                    decrypt: function (b, k, d) {
                        return ("string" == typeof k ? c : a).decrypt(e, b, k, d)
                    }
                }
            }
        });
    d.StreamCipher = v.extend({
        nQ1x: function () {
            return this.nc1x(!0)
        },
        blockSize: 1
    });
    var b = p.mode = {}
        , x = function (e, a, b) {
            var c = this.sG2x;
            c ? this.sG2x = u : c = this.El4p;
            for (var d = 0; d < b; d++)
                e[a + d] ^= c[d]
        }
        , q = (d.BlockCipherMode = l.extend({
            createEncryptor: function (e, a) {
                return this.Encryptor.create(e, a)
            },
            createDecryptor: function (e, a) {
                return this.Decryptor.create(e, a)
            },
            init: function (e, a) {
                this.vw2x = e;
                this.sG2x = a
            }
        })).extend();
    q.Encryptor = q.extend({
        processBlock: function (e, a) {
            var b = this.vw2x
                , c = b.blockSize;
            x.call(this, e, a, c);
            b.encryptBlock(e, a);
            this.El4p = e.slice(a, a + c)
        }
    });
    q.Decryptor = q.extend({
        processBlock: function (e, a) {
            var b = this.vw2x
                , c = b.blockSize
                , d = e.slice(a, a + c);
            b.decryptBlock(e, a);
            x.call(this, e, a, c);
            this.El4p = d
        }
    });
    b = b.CBC = q;
    q = (p.pad = {}).Pkcs7 = {
        pad: function (a, b) {
            for (var c = 4 * b, c = c - a.sigBytes % c, d = c << 24 | c << 16 | c << 8 | c, l = [], n = 0; n < c; n += 4)
                l.push(d);
            c = s.create(l, c);
            a.concat(c)
        },
        unpad: function (a) {
            a.sigBytes -= a.words[a.sigBytes - 1 >>> 2] & 255
        }
    };
    d.BlockCipher = v.extend({
        cfg: v.cfg.extend({
            mode: b,
            padding: q
        }),
        reset: function () {
            v.reset.call(this);
            var a = this.cfg
                , b = a.iv
                , a = a.mode;
            if (this.Sv9m == this.IV8N)
                var c = a.createEncryptor;
            else
                c = a.createDecryptor,
                    this.Sz9q = 1;
            this.eT9K = c.call(a, this, b && b.words)
        },
        sH2x: function (a, b) {
            this.eT9K.processBlock(a, b)
        },
        nQ1x: function () {
            var a = this.cfg.padding;
            if (this.Sv9m == this.IV8N) {
                a.pad(this.i8a, this.blockSize);
                var b = this.nc1x(!0)
            } else
                b = this.nc1x(!0),
                    a.unpad(b);
            return b
        },
        blockSize: 4
    });
    var n = d.CipherParams = l.extend({
        init: function (a) {
            this.mixIn(a)
        },
        toString: function (a) {
            return (a || this.formatter).stringify(this)
        }
    })
        , b = (p.format = {}).OpenSSL = {
            stringify: function (a) {
                var b = a.ciphertext;
                a = a.salt;
                return (a ? s.create([1398893684, 1701076831]).concat(a).concat(b) : b).toString(r)
            },
            parse: function (a) {
                a = r.parse(a);
                var b = a.words;
                if (1398893684 == b[0] && 1701076831 == b[1]) {
                    var c = s.create(b.slice(2, 4));
                    b.splice(0, 4);
                    a.sigBytes -= 16
                }
                return n.create({
                    ciphertext: a,
                    salt: c
                })
            }
        }
        , a = d.SerializableCipher = l.extend({
            cfg: l.extend({
                format: b
            }),
            encrypt: function (a, b, c, d) {
                d = this.cfg.extend(d);
                var l = a.createEncryptor(c, d);
                b = l.finalize(b);
                l = l.cfg;
                return n.create({
                    ciphertext: b,
                    key: c,
                    iv: l.iv,
                    algorithm: a,
                    mode: l.mode,
                    padding: l.padding,
                    blockSize: a.blockSize,
                    formatter: d.format
                })
            },
            decrypt: function (a, b, c, d) {
                d = this.cfg.extend(d);
                b = this.Hk7d(b, d.format);
                return a.createDecryptor(c, d).finalize(b.ciphertext)
            },
            Hk7d: function (a, b) {
                return "string" == typeof a ? b.parse(a, this) : a
            }
        })
        , p = (p.kdf = {}).OpenSSL = {
            execute: function (a, b, c, d) {
                d || (d = s.random(8));
                a = w.create({
                    keySize: b + c
                }).compute(a, d);
                c = s.create(a.words.slice(b), 4 * c);
                a.sigBytes = 4 * b;
                return n.create({
                    key: a,
                    iv: c,
                    salt: d
                })
            }
        }
        , c = d.PasswordBasedCipher = a.extend({
            cfg: a.cfg.extend({
                kdf: p
            }),
            encrypt: function (b, c, d, l) {
                l = this.cfg.extend(l);
                d = l.kdf.execute(d, b.keySize, b.ivSize);
                l.iv = d.iv;
                b = a.encrypt.call(this, b, c, d.key, l);
                b.mixIn(d);
                return b
            },
            decrypt: function (b, c, d, l) {
                l = this.cfg.extend(l);
                c = this.Hk7d(c, l.format);
                d = l.kdf.execute(d, b.keySize, b.ivSize, c.salt);
                l.iv = d.iv;
                return a.decrypt.call(this, b, c, d.key, l)
            }
        })
}();
(function () {
    for (var u = CryptoJS, p = u.lib.BlockCipher, d = u.algo, l = [], s = [], t = [], r = [], w = [], v = [], b = [], x = [], q = [], n = [], a = [], c = 0; 256 > c; c++)
        a[c] = 128 > c ? c << 1 : c << 1 ^ 283;
    for (var e = 0, j = 0, c = 0; 256 > c; c++) {
        var k = j ^ j << 1 ^ j << 2 ^ j << 3 ^ j << 4
            , k = k >>> 8 ^ k & 255 ^ 99;
        l[e] = k;
        s[k] = e;
        var z = a[e]
            , F = a[z]
            , G = a[F]
            , y = 257 * a[k] ^ 16843008 * k;
        t[e] = y << 24 | y >>> 8;
        r[e] = y << 16 | y >>> 16;
        w[e] = y << 8 | y >>> 24;
        v[e] = y;
        y = 16843009 * G ^ 65537 * F ^ 257 * z ^ 16843008 * e;
        b[k] = y << 24 | y >>> 8;
        x[k] = y << 16 | y >>> 16;
        q[k] = y << 8 | y >>> 24;
        n[k] = y;
        e ? (e = z ^ a[a[a[G ^ z]]],
            j ^= a[a[j]]) : e = j = 1
    }
    var H = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54]
        , d = d.AES = p.extend({
            mh0x: function () {
                for (var a = this.J8B, c = a.words, d = a.sigBytes / 4, a = 4 * ((this.bbI1x = d + 6) + 1), e = this.bsr9i = [], j = 0; j < a; j++)
                    if (j < d)
                        e[j] = c[j];
                    else {
                        var k = e[j - 1];
                        j % d ? 6 < d && 4 == j % d && (k = l[k >>> 24] << 24 | l[k >>> 16 & 255] << 16 | l[k >>> 8 & 255] << 8 | l[k & 255]) : (k = k << 8 | k >>> 24,
                            k = l[k >>> 24] << 24 | l[k >>> 16 & 255] << 16 | l[k >>> 8 & 255] << 8 | l[k & 255],
                            k ^= H[j / d | 0] << 24);
                        e[j] = e[j - d] ^ k
                    }
                c = this.bsw9n = [];
                for (d = 0; d < a; d++)
                    j = a - d,
                        k = d % 4 ? e[j] : e[j - 4],
                        c[d] = 4 > d || 4 >= j ? k : b[l[k >>> 24]] ^ x[l[k >>> 16 & 255]] ^ q[l[k >>> 8 & 255]] ^ n[l[k & 255]]
            },
            encryptBlock: function (a, b) {
                this.Es4w(a, b, this.bsr9i, t, r, w, v, l)
            },
            decryptBlock: function (a, c) {
                var d = a[c + 1];
                a[c + 1] = a[c + 3];
                a[c + 3] = d;
                this.Es4w(a, c, this.bsw9n, b, x, q, n, s);
                d = a[c + 1];
                a[c + 1] = a[c + 3];
                a[c + 3] = d
            },
            Es4w: function (a, b, c, d, e, j, l, f) {
                for (var m = this.bbI1x, g = a[b] ^ c[0], h = a[b + 1] ^ c[1], k = a[b + 2] ^ c[2], n = a[b + 3] ^ c[3], p = 4, r = 1; r < m; r++)
                    var q = d[g >>> 24] ^ e[h >>> 16 & 255] ^ j[k >>> 8 & 255] ^ l[n & 255] ^ c[p++]
                        , s = d[h >>> 24] ^ e[k >>> 16 & 255] ^ j[n >>> 8 & 255] ^ l[g & 255] ^ c[p++]
                        , t = d[k >>> 24] ^ e[n >>> 16 & 255] ^ j[g >>> 8 & 255] ^ l[h & 255] ^ c[p++]
                        , n = d[n >>> 24] ^ e[g >>> 16 & 255] ^ j[h >>> 8 & 255] ^ l[k & 255] ^ c[p++]
                        , g = q
                        , h = s
                        , k = t;
                q = (f[g >>> 24] << 24 | f[h >>> 16 & 255] << 16 | f[k >>> 8 & 255] << 8 | f[n & 255]) ^ c[p++];
                s = (f[h >>> 24] << 24 | f[k >>> 16 & 255] << 16 | f[n >>> 8 & 255] << 8 | f[g & 255]) ^ c[p++];
                t = (f[k >>> 24] << 24 | f[n >>> 16 & 255] << 16 | f[g >>> 8 & 255] << 8 | f[h & 255]) ^ c[p++];
                n = (f[n >>> 24] << 24 | f[g >>> 16 & 255] << 16 | f[h >>> 8 & 255] << 8 | f[k & 255]) ^ c[p++];
                a[b] = q;
                a[b + 1] = s;
                a[b + 2] = t;
                a[b + 3] = n
            },
            keySize: 8
        });
    u.AES = p.mW1x(d)
}
)();

(function () {
    var u = CryptoJS
        , p = u.lib.WordArray;
    u.enc.Base64 = {
        stringify: function (d) {
            var l = d.words
                , p = d.sigBytes
                , t = this.bD8v;
            d.clamp();
            d = [];
            for (var r = 0; r < p; r += 3)
                for (var w = (l[r >>> 2] >>> 24 - 8 * (r % 4) & 255) << 16 | (l[r + 1 >>> 2] >>> 24 - 8 * ((r + 1) % 4) & 255) << 8 | l[r + 2 >>> 2] >>> 24 - 8 * ((r + 2) % 4) & 255, v = 0; 4 > v && r + .75 * v < p; v++)
                    d.push(t.charAt(w >>> 6 * (3 - v) & 63));
            if (l = t.charAt(64))
                for (; d.length % 4;)
                    d.push(l);
            return d.join("")
        },
        parse: function (d) {
            var l = d.length
                , s = this.bD8v
                , t = s.charAt(64);
            t && (t = d.indexOf(t),
                -1 != t && (l = t));
            for (var t = [], r = 0, w = 0; w < l; w++)
                if (w % 4) {
                    var v = s.indexOf(d.charAt(w - 1)) << 2 * (w % 4)
                        , b = s.indexOf(d.charAt(w)) >>> 6 - 2 * (w % 4);
                    t[r >>> 2] |= (v | b) << 24 - 8 * (r % 4);
                    r++
                }
            return p.create(t, r)
        },
        bD8v: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
    }
}
)();




(function () {
    var c8g = NEJ.P
        , ew9n = c8g("nej.g")
        , u8m = c8g("nej.j")
        , j8b = c8g("nej.u")
        , St9k = c8g("nm.x.ek");
    St9k.emj = {
        "色": "00e0b",
        "流感": "509f6",
        "这边": "259df",
        "弱": "8642d",
        "嘴唇": "bc356",
        "亲": "62901",
        "开心": "477df",
        "呲牙": "22677",
        "憨笑": "ec152",
        "猫": "b5ff6",
        "皱眉": "8ace6",
        "幽灵": "15bb7",
        "蛋糕": "b7251",
        "发怒": "52b3a",
        "大哭": "b17a8",
        "兔子": "76aea",
        "星星": "8a5aa",
        "钟情": "76d2e",
        "牵手": "41762",
        "公鸡": "9ec4e",
        "爱意": "e341f",
        "禁止": "56135",
        "狗": "fccf6",
        "亲亲": "95280",
        "叉": "104e0",
        "礼物": "312ec",
        "晕": "bda92",
        "呆": "557c9",
        "生病": "38701",
        "钻石": "14af6",
        "拜": "c9d05",
        "怒": "c4f7f",
        "示爱": "0c368",
        "汗": "5b7a4",
        "小鸡": "6bee2",
        "痛苦": "55932",
        "撇嘴": "575cc",
        "惶恐": "e10b4",
        "口罩": "24d81",
        "吐舌": "3cfe4",
        "心碎": "875d3",
        "生气": "e8204",
        "可爱": "7b97d",
        "鬼脸": "def52",
        "跳舞": "741d5",
        "男孩": "46b8e",
        "奸笑": "289dc",
        "猪": "6935b",
        "圈": "3ece0",
        "便便": "462db",
        "外星": "0a22b",
        "圣诞": "8e7",
        "流泪": "01000",
        "强": "1",
        "爱心": "0CoJU",
        "女孩": "m6Qyw",
        "惊恐": "8W8ju",
        "大笑": "d"
    };
    St9k.md = ["色", "流感", "这边", "弱", "嘴唇", "亲", "开心", "呲牙", "憨笑", "猫", "皱眉", "幽灵", "蛋糕", "发怒", "大哭", "兔子", "星星", "钟情", "牵手", "公鸡", "爱意", "禁止", "狗", "亲亲", "叉", "礼物", "晕", "呆", "生病", "钻石", "拜", "怒", "示爱", "汗", "小鸡", "痛苦", "撇嘴", "惶恐", "口罩", "吐舌", "心碎", "生气", "可爱", "鬼脸", "跳舞", "男孩", "奸笑", "猪", "圈", "便便", "外星", "圣诞"]
}
)();


var bsF9w = function (cxM5R) {
    var m8e = [];
    j8b.bg8Y(cxM5R, function (cxL5Q) {
        m8e.push(St9k.emj[cxL5Q])
    });
    return m8e.join("")
};


function RSAKeyPair(a, b, c) {
    this.e = biFromHex(a),
        this.d = biFromHex(b),
        this.m = biFromHex(c),
        this.chunkSize = 2 * biHighIndex(this.m),
        this.radix = 16,
        this.barrett = new BarrettMu(this.m)
}
function twoDigit(a) {
    return (10 > a ? "0" : "") + String(a)
}
function encryptedString(a, b) {
    for (var f, g, h, i, j, k, l, c = new Array, d = b.length, e = 0; d > e;)
        c[e] = b.charCodeAt(e),
            e++;
    for (; 0 != c.length % a.chunkSize;)
        c[e++] = 0;
    for (f = c.length,
        g = "",
        e = 0; f > e; e += a.chunkSize) {
        for (j = new BigInt,
            h = 0,
            i = e; i < e + a.chunkSize; ++h)
            j.digits[h] = c[i++],
                j.digits[h] += c[i++] << 8;
        k = a.barrett.powMod(j, a.e),
            l = 16 == a.radix ? biToHex(k) : biToString(k, a.radix),
            g += l + " "
    }
    return g.substring(0, g.length - 1)
}
function decryptedString(a, b) {
    var e, f, g, h, c = b.split(" "), d = "";
    for (e = 0; e < c.length; ++e)
        for (h = 16 == a.radix ? biFromHex(c[e]) : biFromString(c[e], a.radix),
            g = a.barrett.powMod(h, a.d),
            f = 0; f <= biHighIndex(g); ++f)
            d += String.fromCharCode(255 & g.digits[f], g.digits[f] >> 8);
    return 0 == d.charCodeAt(d.length - 1) && (d = d.substring(0, d.length - 1)),
        d
}
function setMaxDigits(a) {
    maxDigits = a,
        ZERO_ARRAY = new Array(maxDigits);
    for (var b = 0; b < ZERO_ARRAY.length; b++)
        ZERO_ARRAY[b] = 0;
    bigZero = new BigInt,
        bigOne = new BigInt,
        bigOne.digits[0] = 1
}
function BigInt(a) {
    this.digits = "boolean" == typeof a && 1 == a ? null : ZERO_ARRAY.slice(0),
        this.isNeg = !1
}
function biFromDecimal(a) {
    for (var d, e, f, b = "-" == a.charAt(0), c = b ? 1 : 0; c < a.length && "0" == a.charAt(c);)
        ++c;
    if (c == a.length)
        d = new BigInt;
    else {
        for (e = a.length - c,
            f = e % dpl10,
            0 == f && (f = dpl10),
            d = biFromNumber(Number(a.substr(c, f))),
            c += f; c < a.length;)
            d = biAdd(biMultiply(d, lr10), biFromNumber(Number(a.substr(c, dpl10)))),
                c += dpl10;
        d.isNeg = b
    }
    return d
}
function biCopy(a) {
    var b = new BigInt(!0);
    return b.digits = a.digits.slice(0),
        b.isNeg = a.isNeg,
        b
}
function biFromNumber(a) {
    var c, b = new BigInt;
    for (b.isNeg = 0 > a,
        a = Math.abs(a),
        c = 0; a > 0;)
        b.digits[c++] = a & maxDigitVal,
            a >>= biRadixBits;
    return b
}
function reverseStr(a) {
    var c, b = "";
    for (c = a.length - 1; c > -1; --c)
        b += a.charAt(c);
    return b
}
function biToString(a, b) {
    var d, e, c = new BigInt;
    for (c.digits[0] = b,
        d = biDivideModulo(a, c),
        e = hexatrigesimalToChar[d[1].digits[0]]; 1 == biCompare(d[0], bigZero);)
        d = biDivideModulo(d[0], c),
            digit = d[1].digits[0],
            e += hexatrigesimalToChar[d[1].digits[0]];
    return (a.isNeg ? "-" : "") + reverseStr(e)
}
function biToDecimal(a) {
    var c, d, b = new BigInt;
    for (b.digits[0] = 10,
        c = biDivideModulo(a, b),
        d = String(c[1].digits[0]); 1 == biCompare(c[0], bigZero);)
        c = biDivideModulo(c[0], b),
            d += String(c[1].digits[0]);
    return (a.isNeg ? "-" : "") + reverseStr(d)
}
function digitToHex(a) {
    var b = 15
        , c = "";
    for (i = 0; 4 > i; ++i)
        c += hexToChar[a & b],
            a >>>= 4;
    return reverseStr(c)
}
function biToHex(a) {
    var d, b = "";
    for (biHighIndex(a),
        d = biHighIndex(a); d > -1; --d)
        b += digitToHex(a.digits[d]);
    return b
}
function charToHex(a) {
    var h, b = 48, c = b + 9, d = 97, e = d + 25, f = 65, g = 90;
    return h = a >= b && c >= a ? a - b : a >= f && g >= a ? 10 + a - f : a >= d && e >= a ? 10 + a - d : 0
}
function hexToDigit(a) {
    var d, b = 0, c = Math.min(a.length, 4);
    for (d = 0; c > d; ++d)
        b <<= 4,
            b |= charToHex(a.charCodeAt(d));
    return b
}
function biFromHex(a) {
    var d, e, b = new BigInt, c = a.length;
    for (d = c,
        e = 0; d > 0; d -= 4,
        ++e)
        b.digits[e] = hexToDigit(a.substr(Math.max(d - 4, 0), Math.min(d, 4)));
    return b
}
function biFromString(a, b) {
    var g, h, i, j, c = "-" == a.charAt(0), d = c ? 1 : 0, e = new BigInt, f = new BigInt;
    for (f.digits[0] = 1,
        g = a.length - 1; g >= d; g--)
        h = a.charCodeAt(g),
            i = charToHex(h),
            j = biMultiplyDigit(f, i),
            e = biAdd(e, j),
            f = biMultiplyDigit(f, b);
    return e.isNeg = c,
        e
}
function biDump(a) {
    return (a.isNeg ? "-" : "") + a.digits.join(" ")
}
function biAdd(a, b) {
    var c, d, e, f;
    if (a.isNeg != b.isNeg)
        b.isNeg = !b.isNeg,
            c = biSubtract(a, b),
            b.isNeg = !b.isNeg;
    else {
        for (c = new BigInt,
            d = 0,
            f = 0; f < a.digits.length; ++f)
            e = a.digits[f] + b.digits[f] + d,
                c.digits[f] = 65535 & e,
                d = Number(e >= biRadix);
        c.isNeg = a.isNeg
    }
    return c
}
function biSubtract(a, b) {
    var c, d, e, f;
    if (a.isNeg != b.isNeg)
        b.isNeg = !b.isNeg,
            c = biAdd(a, b),
            b.isNeg = !b.isNeg;
    else {
        for (c = new BigInt,
            e = 0,
            f = 0; f < a.digits.length; ++f)
            d = a.digits[f] - b.digits[f] + e,
                c.digits[f] = 65535 & d,
                c.digits[f] < 0 && (c.digits[f] += biRadix),
                e = 0 - Number(0 > d);
        if (-1 == e) {
            for (e = 0,
                f = 0; f < a.digits.length; ++f)
                d = 0 - c.digits[f] + e,
                    c.digits[f] = 65535 & d,
                    c.digits[f] < 0 && (c.digits[f] += biRadix),
                    e = 0 - Number(0 > d);
            c.isNeg = !a.isNeg
        } else
            c.isNeg = a.isNeg
    }
    return c
}
function biHighIndex(a) {
    for (var b = a.digits.length - 1; b > 0 && 0 == a.digits[b];)
        --b;
    return b
}
function biNumBits(a) {
    var e, b = biHighIndex(a), c = a.digits[b], d = (b + 1) * bitsPerDigit;
    for (e = d; e > d - bitsPerDigit && 0 == (32768 & c); --e)
        c <<= 1;
    return e
}
function biMultiply(a, b) {
    var d, h, i, k, c = new BigInt, e = biHighIndex(a), f = biHighIndex(b);
    for (k = 0; f >= k; ++k) {
        for (d = 0,
            i = k,
            j = 0; e >= j; ++j,
            ++i)
            h = c.digits[i] + a.digits[j] * b.digits[k] + d,
                c.digits[i] = h & maxDigitVal,
                d = h >>> biRadixBits;
        c.digits[k + e + 1] = d
    }
    return c.isNeg = a.isNeg != b.isNeg,
        c
}
function biMultiplyDigit(a, b) {
    var c, d, e, f;
    for (result = new BigInt,
        c = biHighIndex(a),
        d = 0,
        f = 0; c >= f; ++f)
        e = result.digits[f] + a.digits[f] * b + d,
            result.digits[f] = e & maxDigitVal,
            d = e >>> biRadixBits;
    return result.digits[1 + c] = d,
        result
}
function arrayCopy(a, b, c, d, e) {
    var g, h, f = Math.min(b + e, a.length);
    for (g = b,
        h = d; f > g; ++g,
        ++h)
        c[h] = a[g]
}
function biShiftLeft(a, b) {
    var e, f, g, h, c = Math.floor(b / bitsPerDigit), d = new BigInt;
    for (arrayCopy(a.digits, 0, d.digits, c, d.digits.length - c),
        e = b % bitsPerDigit,
        f = bitsPerDigit - e,
        g = d.digits.length - 1,
        h = g - 1; g > 0; --g,
        --h)
        d.digits[g] = d.digits[g] << e & maxDigitVal | (d.digits[h] & highBitMasks[e]) >>> f;
    return d.digits[0] = d.digits[g] << e & maxDigitVal,
        d.isNeg = a.isNeg,
        d
}
function biShiftRight(a, b) {
    var e, f, g, h, c = Math.floor(b / bitsPerDigit), d = new BigInt;
    for (arrayCopy(a.digits, c, d.digits, 0, a.digits.length - c),
        e = b % bitsPerDigit,
        f = bitsPerDigit - e,
        g = 0,
        h = g + 1; g < d.digits.length - 1; ++g,
        ++h)
        d.digits[g] = d.digits[g] >>> e | (d.digits[h] & lowBitMasks[e]) << f;
    return d.digits[d.digits.length - 1] >>>= e,
        d.isNeg = a.isNeg,
        d
}
function biMultiplyByRadixPower(a, b) {
    var c = new BigInt;
    return arrayCopy(a.digits, 0, c.digits, b, c.digits.length - b),
        c
}
function biDivideByRadixPower(a, b) {
    var c = new BigInt;
    return arrayCopy(a.digits, b, c.digits, 0, c.digits.length - b),
        c
}
function biModuloByRadixPower(a, b) {
    var c = new BigInt;
    return arrayCopy(a.digits, 0, c.digits, 0, b),
        c
}
function biCompare(a, b) {
    if (a.isNeg != b.isNeg)
        return 1 - 2 * Number(a.isNeg);
    for (var c = a.digits.length - 1; c >= 0; --c)
        if (a.digits[c] != b.digits[c])
            return a.isNeg ? 1 - 2 * Number(a.digits[c] > b.digits[c]) : 1 - 2 * Number(a.digits[c] < b.digits[c]);
    return 0
}
function biDivideModulo(a, b) {
    var f, g, h, i, j, k, l, m, n, o, p, q, r, s, c = biNumBits(a), d = biNumBits(b), e = b.isNeg;
    if (d > c)
        return a.isNeg ? (f = biCopy(bigOne),
            f.isNeg = !b.isNeg,
            a.isNeg = !1,
            b.isNeg = !1,
            g = biSubtract(b, a),
            a.isNeg = !0,
            b.isNeg = e) : (f = new BigInt,
                g = biCopy(a)),
            new Array(f, g);
    for (f = new BigInt,
        g = a,
        h = Math.ceil(d / bitsPerDigit) - 1,
        i = 0; b.digits[h] < biHalfRadix;)
        b = biShiftLeft(b, 1),
            ++i,
            ++d,
            h = Math.ceil(d / bitsPerDigit) - 1;
    for (g = biShiftLeft(g, i),
        c += i,
        j = Math.ceil(c / bitsPerDigit) - 1,
        k = biMultiplyByRadixPower(b, j - h); -1 != biCompare(g, k);)
        ++f.digits[j - h],
            g = biSubtract(g, k);
    for (l = j; l > h; --l) {
        for (m = l >= g.digits.length ? 0 : g.digits[l],
            n = l - 1 >= g.digits.length ? 0 : g.digits[l - 1],
            o = l - 2 >= g.digits.length ? 0 : g.digits[l - 2],
            p = h >= b.digits.length ? 0 : b.digits[h],
            q = h - 1 >= b.digits.length ? 0 : b.digits[h - 1],
            f.digits[l - h - 1] = m == p ? maxDigitVal : Math.floor((m * biRadix + n) / p),
            r = f.digits[l - h - 1] * (p * biRadix + q),
            s = m * biRadixSquared + (n * biRadix + o); r > s;)
            --f.digits[l - h - 1],
                r = f.digits[l - h - 1] * (p * biRadix | q),
                s = m * biRadix * biRadix + (n * biRadix + o);
        k = biMultiplyByRadixPower(b, l - h - 1),
            g = biSubtract(g, biMultiplyDigit(k, f.digits[l - h - 1])),
            g.isNeg && (g = biAdd(g, k),
                --f.digits[l - h - 1])
    }
    return g = biShiftRight(g, i),
        f.isNeg = a.isNeg != e,
        a.isNeg && (f = e ? biAdd(f, bigOne) : biSubtract(f, bigOne),
            b = biShiftRight(b, i),
            g = biSubtract(b, g)),
        0 == g.digits[0] && 0 == biHighIndex(g) && (g.isNeg = !1),
        new Array(f, g)
}
function biDivide(a, b) {
    return biDivideModulo(a, b)[0]
}
function biModulo(a, b) {
    return biDivideModulo(a, b)[1]
}
function biMultiplyMod(a, b, c) {
    return biModulo(biMultiply(a, b), c)
}
function biPow(a, b) {
    for (var c = bigOne, d = a; ;) {
        if (0 != (1 & b) && (c = biMultiply(c, d)),
            b >>= 1,
            0 == b)
            break;
        d = biMultiply(d, d)
    }
    return c
}
function biPowMod(a, b, c) {
    for (var d = bigOne, e = a, f = b; ;) {
        if (0 != (1 & f.digits[0]) && (d = biMultiplyMod(d, e, c)),
            f = biShiftRight(f, 1),
            0 == f.digits[0] && 0 == biHighIndex(f))
            break;
        e = biMultiplyMod(e, e, c)
    }
    return d
}
function BarrettMu(a) {
    this.modulus = biCopy(a),
        this.k = biHighIndex(this.modulus) + 1;
    var b = new BigInt;
    b.digits[2 * this.k] = 1,
        this.mu = biDivide(b, this.modulus),
        this.bkplus1 = new BigInt,
        this.bkplus1.digits[this.k + 1] = 1,
        this.modulo = BarrettMu_modulo,
        this.multiplyMod = BarrettMu_multiplyMod,
        this.powMod = BarrettMu_powMod
}
function BarrettMu_modulo(a) {
    var i, b = biDivideByRadixPower(a, this.k - 1), c = biMultiply(b, this.mu), d = biDivideByRadixPower(c, this.k + 1), e = biModuloByRadixPower(a, this.k + 1), f = biMultiply(d, this.modulus), g = biModuloByRadixPower(f, this.k + 1), h = biSubtract(e, g);
    for (h.isNeg && (h = biAdd(h, this.bkplus1)),
        i = biCompare(h, this.modulus) >= 0; i;)
        h = biSubtract(h, this.modulus),
            i = biCompare(h, this.modulus) >= 0;
    return h
}
function BarrettMu_multiplyMod(a, b) {
    var c = biMultiply(a, b);
    return this.modulo(c)
}
function BarrettMu_powMod(a, b) {
    var d, e, c = new BigInt;
    for (c.digits[0] = 1,
        d = a,
        e = b; ;) {
        if (0 != (1 & e.digits[0]) && (c = this.multiplyMod(c, d)),
            e = biShiftRight(e, 1),
            0 == e.digits[0] && 0 == biHighIndex(e))
            break;
        d = this.multiplyMod(d, d)
    }
    return c
}
var maxDigits, ZERO_ARRAY, bigZero, bigOne, dpl10, lr10, hexatrigesimalToChar, hexToChar, highBitMasks, lowBitMasks, biRadixBase = 2, biRadixBits = 16, bitsPerDigit = biRadixBits, biRadix = 65536, biHalfRadix = biRadix >>> 1, biRadixSquared = biRadix * biRadix, maxDigitVal = biRadix - 1, maxInteger = 9999999999999998;
setMaxDigits(20),
    dpl10 = 15,
    lr10 = biFromNumber(1e15),
    hexatrigesimalToChar = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"),
    hexToChar = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f"),
    highBitMasks = new Array(0, 32768, 49152, 57344, 61440, 63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535),
    lowBitMasks = new Array(0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535);

function a(a) {
    var d, e, b = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789", c = "";
    for (d = 0; a > d; d += 1)
        e = Math.random() * b.length,
            e = Math.floor(e),
            c += b.charAt(e);
    return c
}
function b(a, b) {
    var c = CryptoJS.enc.Utf8.parse(b)
        , d = CryptoJS.enc.Utf8.parse("0102030405060708")
        , e = CryptoJS.enc.Utf8.parse(a)
        , f = CryptoJS.AES.encrypt(e, c, {
            iv: d,
            mode: CryptoJS.mode.CBC
        });
    return f.toString()
}
function c(a, b, c) {
    var d, e;
    return setMaxDigits(131),
        d = new RSAKeyPair(b, "", c),
        e = encryptedString(d, a)
}
function d(d, e, f, g) {
    var h = {}
        , i = a(16);
    return h.encText = b(d, g),
        h.encText = b(h.encText, i),
        h.encSecKey = c(i, e, f),
        h
}
function e(a, b, d, e) {
    var f = {};
    return f.encText = c(a + e, b, d),
        f
}
window.asrsea = d,
window.ecnonasr = e


function getParmas(obj) {
    return {
        params: obj.encText,
        encSecKey: obj.encSecKey
    }
}


2 随便写一个html文件 先跑起来再说

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>
    <input type="text">
    <audio controls src=""></audio>
    <button class="getSearch">获取</button>
    <button class="getLrc">获取歌词</button>
    <button class="getMusic">获取音乐</button>
    <script>
        let input = document.querySelector('input');
        let button = document.querySelector('.getSearch');
        let getLrc = document.querySelector('.getLrc');
        let getMusic = document.querySelector('.getMusic');
        var id;
        // 获取搜索结果
        button.addEventListener('click', function () {
            window.arg1 = JSON.stringify({ s: `${input.value}`, limit: 8, csrf_token: "" })
            console.log(arg1)
            let obj = asrsea(arg1, arg2, arg3, arg4);
            let data = getParmas(obj);
            data['Content-Type'] = 'application/x-www-form-urlencoded';
            data.url = 'https://music.163.com/weapi/search/suggest/web?csrf_token=';
            data.Referer = `https://music.163.com/search/`,
                fetch('http://127.0.0.1:3007/api/wwy', {
                    method: "POST",
                    headers: {
                        "Content-Type": "application/json",
                    },
                    body: JSON.stringify(data)
                }).then(res => res.json()).then(res => {
                    id = res.result.songs[0].id;
                    console.log(id)
                })
        })
        // 获取歌词
        getLrc.onclick = () => {
            window.arg1 = JSON.stringify({ id: `${id}`, lv: -1, tv: -1, csrf_token: "" });
            let obj = asrsea(arg1, arg2, arg3, arg4);
            let data = getParmas(obj);
            data.url = 'https://music.163.com/weapi/song/lyric?csrf_token=';
            data['Content-Type'] = 'application/x-www-form-urlencoded';
            data.Referer = `https://music.163.com/song?id=${id}`,
                fetch('http://127.0.0.1:3007/api/wwy', {
                    method: "POST",
                    headers: {
                        "Content-Type": "application/json",
                    },
                    body: JSON.stringify(data)
                }).then(res => res.json()).then(res => {
                    console.log(res.lrc)
                })
        }

        // 获取音乐
        getMusic.onclick = () => {
            window.arg1 = JSON.stringify({"ids":[id],"level":"standard","encodeType":"aac","csrf_token":""});
            let obj = asrsea(arg1, arg2, arg3, arg4);
            let data = getParmas(obj);
            data.url = 'https://music.163.com/weapi/song/enhance/player/url/v1?csrf_token=';
            data['Content-Type'] = 'application/x-www-form-urlencoded';
            data.Referer = `https://music.163.com/`,
                fetch('http://127.0.0.1:3007/api/wwy', {
                    method: "POST",
                    headers: {
                        "Content-Type": "application/json",
                    },
                    body: JSON.stringify(data)
                }).then(res => res.json()).then(res => {
                    console.log(res.data[0].url)
                    document.querySelector('audio').src=res.data[0].url;
                })
        }

    </script>
    <script src="wwy.js"></script>
</body>

</html>

当然你想要获取任何其他接口都是通用的,不过你需要找到接口和所需加密的内容 比如 window.arg1 和data.url 你也可以封装成一个通用函数 以便后续使用

3 最关键的代理服务器

const express = require('express')
const app = express();
const axios =require('axios');
const bodyParser = require('body-parser');
const cors = require('cors')
const router = express.Router();
app.use(cors());
app.use(bodyParser.json({ extended: true }));


router.post('/api/wwy',(req,res)=>{
    let {params,encSecKey,url,Referer}=req.body;
    console.log(req.body)
    axios({
        method:"post",
        url,
        headers:{
            Referer,
            'Content-Type':req.body['Content-Type']
        },
        data:{params,encSecKey}
    }).then(resp=>{
        res.end(JSON.stringify(resp.data))
        console.log(resp.data)
    }).catch(e=>{
        console.log(e)
    })

});

app.use(router);

app.listen(3007, () => {
    console.log('http://127.0.0.1:3007')
})

本期就不做内容上的讲解和分析过程了

最后呢附上package.json文件

{
  "name": "nodejs",
  "version": "1.0.0",
  "description": "",
  "main": "app.js",
  "scripts": {
    "test": "echo \"Error: no test specified\" && exit 1",
    "dev": "cross-env NODE_ENV=dev nodemon ./bin/www.js"
  },
  "keywords": [],
  "author": "",
  "license": "ISC",
  "dependencies": {
    "axios": "^1.4.0",
    "body-parser": "^1.20.2",
    "cors": "^2.8.5",
    "cross-env": "^7.0.3",
    "express": "^4.18.2",
    "express-ws": "^5.0.2",
    "fs-extra": "^11.1.1",
    "mysql": "^2.18.1",
    "uuid": "^9.0.0",
    "ws": "^8.13.0"
  }
}

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值