qq(q音乐)扫码授权登陆分析及python实现

在js中可以看出C（PT）是直接挂载到windo对象下的最后在html中搜索关键字才找到初始化的位置js如下:

return r(o ^ (t | ~e), n, t, u, p, i) } function t(n) { return function(n) { var t, o = ""; for (t = 0; t < 32 * ; t += 8) o += arCode(n[t >> 5] >>> t % 32 & 255); return o }(function(n, t) { n[t >> 5] |= 128 << t % 32, n[14 + (t + 64 >>> 9 << 4)] = t; var o, e, u, p, i, r = 1732584193, f = -271733879, h = -1732584194, c = 271733878; for (o = 0; o < ; o += 16) r = g(e = r, u = f, p = h, i = c, n[o], 7, -680876936), c = g(c, r, f, h, n[o + 1], 12, -389564586), h = g(h, c, r, f, n[o + 2], 17, 606105819), f = g(f, h, c, r, n[o + 3], 22, -1044525330), r = g(r, f, h, c, n[o + 4], 7, -176418897), c = g(c, r, f, h, n[o + 5], 12, 1200080426), h = g(h, c, r, f, n[o + 6], 17, -1473231341), f = g(f, h, c, r, n[o + 7], 22, -45705983), r = g(r, f, h, c, n[o + 8], 7, 1770035416), c = g(c, r, f, h, n[o + 9], 12, -1958414417), h = g(h, c, r, f, n[o + 10], 17, -42063), f = g(f, h, c, r, n[o + 11], 22, -1990404162), r = g(r, f, h, c, n[o + 12], 7, 1804603682), c = g(c, r, f, h, n[o + 13], 12, -40341101), h = g(h, c, r, f, n[o + 14], 17, -1502002290), r = a(r, f = g(f, h, c, r, n[o + 15], 22, 1236535329), h, c, n[o + 1], 5, -165796510), c = a(c, r, f, h, n[o + 6], 9, -1069501632), h = a(h, c, r, f, n[o + 11], 14, 643717713), f = a(f, h, c, r, n[o], 20, -373897302), r = a(r, f, h, c, n[o + 5], 5, -701558691), c = a(c, r, f, h, n[o + 10], 9, 38016083), h = a(h, c, r, f, n[o + 15], 14, -660478335), f = a(f, h, c, r, n[o + 4], 20, -405537848), r = a(r, f, h, c, n[o + 9], 5, 568446438), c = a(c, r, f, h, n[o + 14], 9, -1019803690), h = a(h, c, r, f, n[o + 3], 14, -187363961), f = a(f, h, c, r, n[o + 8], 20, 1163531501), r = a(r, f, h, c, n[o + 13], 5, -1444681467), c = a(c, r, f, h, n[o + 2], 9, -51403784), h = a(h, c, r, f, n[o + 7], 14, 1735328473), r = s(r, f = a(f, h, c, r, n[o + 12], 20, -1926607734), h, c, n[o + 5], 4, -378558), c = s(c, r, f, h, n[o + 8], 11, -2022574463), h = s(h, c, r, f, n[o + 11], 16, 1839030562), f = s(f, h, c, r, n[o + 14], 23, -35309556), r = s(r, f, h, c, n[o + 1], 4, -1530992060), c = s(c, r, f, h, n[o + 4], 11, 1272893353), h = s(h, c, r, f, n[o + 7], 16, -155497632), f = s(f, h, c, r, n[o + 10], 23, -1094730640), r = s(r, f, h, c, n[o + 13], 4, 681279174), c = s(c, r, f, h, n[o], 11, -358537222), h = s(h, c, r, f, n[o + 3], 16, -722521979), f = s(f, h, c, r, n[o + 6], 23, 76029189), r = s(r, f, h, c, n[o + 9], 4, -640364487), c = s(c, r, f, h, n[o + 12], 11, -421815835), h = s(h, c, r, f, n[o + 15], 16, 530742520), r = v(r, f = s(f, h, c, r, n[o + 2], 23, -995338651), h, c, n[o], 6, -198630844), c = v(c, r, f, h, n[o + 7], 10, 1126891415), h = v(h, c, r, f, n[o + 14], 15, -1416354905), f = v(f, h, c, r, n[o + 5], 21, -57434055), r = v(r, f, h, c, n[o + 12], 6, 1700485571), c = v(c, r, f, h, n[o + 3], 10, -1894986606), h = v(h, c, r, f, n[o + 10], 15, -1051523), f = v(f, h, c, r, n[o + 1], 21, -2054922799),

f = v(f, h, c, r, n[o + 1], 21, -2054922799), r = v(r, f, h, c, n[o + 8], 6, 1873313359), c = v(c, r, f, h, n[o + 15], 10, -30611744), h = v(h, c, r, f, n[o + 6], 15, -1560198380), f = v(f, h, c, r, n[o + 13], 21, 1309151649), r = v(r, f, h, c, n[o + 4], 6, -145523070), c = v(c, r, f, h, n[o + 11], 10, -1120210379), h = v(h, c, r, f, n[o + 2], 15, 718787259), f = v(f, h, c, r, n[o + 9], 21, -343485551), r = l(r, e), f = l(f, u), h = l(h, p), c = l(c, i); return [r, f, h, c] }(function(n) { var t, o = []; for (o[( >> 2) - 1] = void 0, t = 0; t < ; t += 1) o[t] = 0; for (t = 0; t < 8 * ; t += 8) o[t >> 5] |= (255 & deAt(t / 8)) << t % 32; return o }(n), 8 * )) } function o(n) { return t(unescape(encodeURIComponent(n))) } return function(n) { var t, o, e = "abcdef", u = ""; for (o = 0; o < ; o += 1) t = deAt(o), u += (t >>> 4 & 15) + (15 & t); return u }(o(n)) } , function r(f, h, c, l, g) { g = g || [[this], [{}]]; for (var t = [], o = null, n = [function() { return !0 } , function() {} , function() { = c[h++] } , function() { (c[h++]) } , function() { () } , function() { var n = c[h++] , t = g[ - 2 - n]; g[ - 2 - n] = (), (t) } , function() { (g[ - 1]) } , function() { ([(), ()].reverse()) } , function() { ([l, ()]) }

} , function() { ([()]) } , function() { var n = (); (n[0][n[1]]) } , function() { (g[()[0]][0]) } , function() { var n = g[ - 2]; n[0][n[1]] = g[ - 1] } , function() { g[g[ - 2][0]][0] = g[ - 1] } , function() { var n = () , t = (); ([t[0][t[1]], n]) } , function() { var n = (); ([g[()][0], n]) } , function() { var n = (); (delete n[0][n[1]]) } , function() { var n = []; for (var t in ()) (t); (n) } , function() { g[ - 1].length ? (g[ - 1].shift(), !0) : (void 0, !1) } , function() { var n = g[ - 2] , t = PropertyDescriptor(n[0], n[1]) || { configurable: !0, enumerable: !0 }; = g[ - 1], Property(n[0], n[1], t) } , function() { var n = g[ - 2] , t = PropertyDescriptor(n[0], n[1]) || { configurable: !0, enumerable: !0 }; = g[ - 1], Property(n[0], n[1], t) } , function() { h = c[h++] } , function() { var n = c[h++]; g[ - 1] && (h = n) } , function() {

, function() { throw g[ - 1] } , function() { var n = c[h++] , t = n ? (-n) : []; -= n, (().apply(l, t)) } , function() { var n = c[h++] , t = n ? (-n) : []; -= n; var o = (); (o[0][o[1]].apply(o[0], t)) } , function() { var n = c[h++] , t = n ? (-n) : []; -= n, t(null), (new (((), t))) } , function() { var n = c[h++] , t = n ? (-n) : []; -= n, t(null); var o = (); (new ((o[0][o[1]], t))) } , function() { (!()) } , function() { (~()) } , function() { (typeof ()) } , function() { g[ - 2] = g[ - 2] == () } , function() { g[ - 2] = g[ - 2] === () } , function() { g[ - 2] = g[ - 2] > () } , function() { g[ - 2] = g[ - 2] >= () } , function() { g[ - 2] = g[ - 2] << () } , function() { g[ - 2] = g[ - 2] >> () } , function() { g[ - 2] = g[ - 2] >>> () } , function() { g[ - 2] = g[ - 2] + () } , function() { g[ - 2] = g[ - 2] - ()

g[ - 2] = g[ - 2] - () } , function() { g[ - 2] = g[ - 2] * () } , function() { g[ - 2] = g[ - 2] / () } , function() { g[ - 2] = g[ - 2] % () } , function() { g[ - 2] = g[ - 2] | () } , function() { g[ - 2] = g[ - 2] & () } , function() { g[ - 2] = g[ - 2] ^ () } , function() { g[ - 2] = g[ - 2]in () } , function() { g[ - 2] = g[ - 2]instanceof () } , function() { g[g[ - 1][0]] = void 0 === g[g[ - 1][0]] ? [] : g[g[ - 1][0]] } , function() { for (var e = c[h++], u = [], n = c[h++], t = c[h++], p = [], o = 0; o < n; o++) u[c[h++]] = g[c[h++]]; for (var i = 0; i < t; i++) p[i] = c[h++]; (function n() { var t = (0); t[0] = [this], t[1] = [arguments], t[2] = [n]; for (var o = 0; o < && o < ; o++) 0 < p[o] && (t[p[o]] = [arguments[o]]); return r(f, e, c, l, t) }) } , function() { ([c[h++], , c[h++]]) } , function() { () } , function() { return !!o } , function() { o = null } , function() { g[ - 1] += arCode(c[h++]) } , function() { ("") } , function() { (void 0) } , function() {

, function() { (null) } , function() { (!0) } , function() { (!1) } , function() { -= c[h++] } , function() { g[ - 1] = c[h++] } , function() { var n = () , t = g[ - 1]; t[0][t[1]] = g[n[0]][0] } , function() { var n = () , t = g[ - 1]; t[0][t[1]] = n[0][n[1]] } , function() { var n = () , t = g[ - 1]; g[t[0]][0] = g[n[0]][0] } , function() { var n = () , t = g[ - 1]; g[t[0]][0] = n[0][n[1]] } , function() { g[ - 2] = g[ - 2] < () } , function() { g[ - 2] = g[ - 2] <= () } ]; ; ) try { for (; !n[c[h++]](); ) ; if (o) throw o; return () } catch (n) { var e = (); if (void 0 === e) throw n; o = n, h = e[0], = e[1], e[2] && (g[e[2]][0] = o) } var t = n.__getSecuritySign; return t;});function getSign(data){ return this.__getSecuritySign(data);} }(120731, 0, [21, 34, 50, 100, 57, 50, 102, 50, 98, 99, 101, 52, 54, 97, 52, 99, 55, 56, 52, 49, 57, 54, 57, 49, 56, 98, 102, 100, 100, 48, 48, 55, 55, 102, 2, 10