复现加密算法
上次说到根据调用栈找到从明文到密文的位置，如下图：
接下来就要准备开始复现这个加密过程，首先asrsea这个函数，点进去：
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
}
window.asrsea = d
他其实是这么个玩意，传入四个参数，然后里面调了函数名为a, b, c的四个函数进行加密，然后返回字典h，接下来找到完整的函数，就是以下内容，是一个完整的闭包：
!function() {
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
}();
现在得出的结论是：将明文传进入，然后传入几个参数，经过一堆加密后，返回了一个字典，这个字典就是变量bbx4B，里面有encSecKey和encText，都是加密后的内容：
我们可以在控制台里调试传入的加密参数，其实本质上就是有一个函数对传入的参数进行处理后得到一些加密参数，在我们调试之后可以得知加密参数如下：
window.asrsea(明文,
"010001",
"0085ddee518103f1aef177d3031a0b2fbf1595fb7d5c70afabcc3f356e0bdede8b2e40adc751df9ece1a62750ad1d9cdff976ead0a6f992b16a22abf1339e2b644fddfde23271723e113712c03a07c770be3a251d5a49fd1a9745acb8cabafefcd1c65d4d1409f5f0243a4587a6ded88802afc0a57f23f641a26cbacb4fdd6bf3f",
"0CoJUm6Qyw8W8jud")
接下来写一个JS来复现这个算法，coding时间，写出了这个一段代码，测试：
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
}
var ming = '{"csrf_token":"f53e2f4f2c259bd5f3092df1a23747d4"}'
var param1 = "010001"
var param2 = "0085ddee518103f1aef177d3031a0b2fbf1595fb7d5c70afabcc3f356e0bdede8b2e40adc751df9ece1a62750ad1d9cdff976ead0a6f992b16a22abf1339e2b644fddfde23271723e113712c03a07c770be3a251d5a49fd1a9745acb8cabafefcd1c65d4d1409f5f0243a4587a6ded88802afc0a57f23f641a26cbacb4fdd6bf3f"
var param3 = "0CoJUm6Qyw8W8jud"
res = d(ming, param1, param2, param3)
console.log(res.encSecKey)
测试结果如下：
这里需要注意，这是一个js库，后面还会遇到，他的API大概就是下面几行：
CryptoJS.enc.Utf8.parse(b)
CryptoJS.enc.Utf8.parse("0102030405060708")
CryptoJS.enc.Utf8.parse(a)
CryptoJS.AES.encrypt(e, c, {iv: d,mode: CryptoJS.mode.CBC})
所以安装和导入库就好了：
npm install crypto-js
# 然后添加包
# CryptoJS = require("crypto-js")
# 再次运行，报错如下；
这里需要继续去浏览器的JS源码里面找，把需要的代码全部复制过来，现在JS代码如下：
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);
var CryptoJS = require("crypto-js");
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
}
var ming = '{"csrf_token":"f53e2f4f2c259bd5f3092df1a23747d4"}'
var param1 = "010001"
var param2 = "0085ddee518103f1aef177d3031a0b2fbf1595fb7d5c70afabcc3f356e0bdede8b2e40adc751df9ece1a62750ad1d9cdff976ead0a6f992b16a22abf1339e2b644fddfde23271723e113712c03a07c770be3a251d5a49fd1a9745acb8cabafefcd1c65d4d1409f5f0243a4587a6ded88802afc0a57f23f641a26cbacb4fdd6bf3f"
var param3 = "0CoJUm6Qyw8W8jud"
res = d(ming, param1, param2, param3)
console.log(res.encSecKey)
// 稍微封装一下，python里面用
function fn(ming) {
var param1 = "010001"
var param2 = "0085ddee518103f1aef177d3031a0b2fbf1595fb7d5c70afabcc3f356e0bdede8b2e40adc751df9ece1a62750ad1d9cdff976ead0a6f992b16a22abf1339e2b644fddfde23271723e113712c03a07c770be3a251d5a49fd1a9745acb8cabafefcd1c65d4d1409f5f0243a4587a6ded88802afc0a57f23f641a26cbacb4fdd6bf3f"
var param3 = "0CoJUm6Qyw8W8jud"
return d(ming, param1, param2, param3)
}
再次运行就正常了，现在可以开始将这个加密过程放在python里面来进行爬取：
爬取数据
这里需要安装一个库来保证 JS 可以在 python 中执行：
pip install pyexecjs2
```Python
import requests
import execjs
import json
url = "https://music.163.com/weapi/song/enhance/player/url/v1?csrf_token=f53e2f4f2c259bd5f3092df1a23747d"
headers = {
"Accept": "*/*",
"Accept-Encoding": "gzip, deflate, br",
"Accept-Language": "zh-CN,zh;q=0.9",
"Cache-Control": "no-cache",
"Content-Length": "508",
"Content-Type": "application/x-www-form-urlencoded",
"Cookie": "NMTID=00OixGrObBzPkTfskEXszV-skanqOwAAAGVP_T_yw; _iuqxldmzr_=32; _ntes_nnid=7e24dce6254c09698df12548c93aa035,1740534778817; _ntes_nuid=7e24dce6254c09698df12548c93aa035; WEVNSM=1.0.0; WNMCID=hmgrvl.1740534779373.01.0; ntes_utid=tid._.LrikpLbcIXdEAwVERBaGMkur6nIRjUeh._.0; sDeviceId=YD-c%2B5tuRfhE4REQwEBBULWdgu6riMFmQa2; __snaker__id=3jX0xyH6DdpjYgZ1; WM_NI=P1WrYyS1TwYo5XEDZdy7mLZX60X4x7aRodLd7orV1TTIiLSsfFZl8fTz32bGz60MgYlBHmHO19WIDeLStuFLGDnySviVokX8nkY0ee4DrknotuPhIQfgVrFOQG07XHQSbEg%3D; WM_NIKE=9ca17ae2e6ffcda170e2e6eeb8c772b4b68daac543aeef8eb3d45b929e8e82cb70b5e9e592b24687b08f8af92af0fea7c3b92a94ef9993dc7391ef9c98dc65f7888ba5d970bbe9a3add954f6f098d5fb3da38ea185cf70f5b1beb7b4609897a7add279a69a968dbb6e98a6fdd3e14dbaea00aee653b09e888ecb45f3e799aac76f908dbc96c548859ca29ad27eab8aa18cdb34aeb597d1e86ff89cbe8ced65b8aba089cc5ba6b99a93c545939900d8db44938daea6e637e2a3; WM_TID=Z6rr3t32kRVAQVEBURfCZk77%2BjZE4QA%2F; __csrf=f53e2f4f2c259bd5f3092df1a23747d4; MUSIC_U=0037945E06E693B0337AA6DF8C63E42A5971524F200A5CEC9143D7843B4B899066C9BD9805822ACBD7B078102D88192C39CE223AF67A7D4B36B6527B164C7EEA0501366694F49E64A57890437A7A6F4B93C878CBA069C996D43CC65B2DEF3D1B943F2790E946DB2A44F71F3F81CC9C7EBC2998ACE1B9935BB5CAE893896BBE3A29224C09E298EA3E4186790B25274AF5AE3794BD0FF5CF9C9BC49B67D3E5D7CC5F9DD9A6BEF6464FA9D926815AA5ECF3615C3077D6B996A000B5BA7000B23EBF612F1488BD6A65139AEFA88361481A6C1488DE8A178D9D0D12BBAF40979EA937A62BA097DA3E556227ED681B7E31BD38A0C9A4CA391613C770DDB91D2F083BEA9CFE37A6F4A170B348484B803BB2756BBF43B70C739F27616901E09423E274EE7122364EBEADEF47C87A325EC4BB230300109E5C4BCE516F560DE02A4F4DF5F5F70F8838251914DF5876A40B52E7512D19C352C53152ACC15AB94DDBCE7717591A; ntes_kaola_ad=1; gdxidpyhxdE=k2eD4oECSW8XTZ9BvOfx3O5DcvkY1OI4VCqI7TShJDBBsjn%5CRlbp0iqHbTqYKBtSXICN79RkaiGLK%5CZTaWmOoRhmjZmQX6j27w%5C6CEHo0ZScVe810jQ4J6PszbAKKIkUT0qclNlI3JgSlTzKHS024V%2FG%2BKXkC2HnAcfANkB2bixNyLHq%3A1740542608532; JSESSIONID-WYYY=g8KIkdi%2FIivEoyMWynkpipd6AJ9qZ2f5x7441mD3DhhRhg%5CyMEBjJKtWwiAkktJhcef1E3lem3QJ0Fo3%5CcR%5CDKacjAnagAkaKJF85oWPVBpCbg%2BOTPcCo%2Fg4bi%2BIb%2FORhrbWeQ1DecunRQ%2BoR38uMvE9mFfq%2BU31IC9DNfUmU1OSJvm7%3A1740543508546; playerid=79401329",
"Origin": "https://music.163.com",
"Pragma": "no-cache",
"Referer": "https://music.163.com/",
"Sec-Ch-Ua": "\"Chromium\";v=\"122\", \"Not(A:Brand\";v=\"24\", \"Google Chrome\";v=\"122\"",
"Sec-Ch-Ua-Mobile": "?0",
"Sec-Ch-Ua-Platform": "\"Windows\"",
"Sec-Fetch-Dest": "empty",
"Sec-Fetch-Mode": "cors",
"Sec-Fetch-Site": "same-origin",
"User-Agent": "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/122.0.6261.95 Safari/537.36"
}
f = open("neteasy.js", "r", encoding="utf-8")
js_code = f.read()
ming_dic = {
"ids":"[1325905146]",
"level":"standard",
"encodeType":"aac",
"csrf_token":"f53e2f4f2c259bd5f3092df1a23747d4"
}
ming_s = json.dumps(ming_dic, separators=(',', ':'))
js = execjs.compile(js_code)
ret = js.call("fn", ming_s)
form = {
"params":ret["encText"],
"encSecKey":ret["encSecKey"]
}
# print(form)
resp = requests.post(url=url, data=form, headers=headers)
# print(resp)
print(resp.text)
结果：
{
"data": [
{
"id": 1325905146,
"url": "http://m704.music.126.net/20250226141441/3d61b5eec2d141b31810007334fad159/jdyyaac/obj/w5rDlsOJwrLDjj7CmsOj/28481676823/4af4/3b82/de3c/082fc537ce73819afdeb6694703f398a.m4a?vuutv=gPjhNEkAax6I1fSs3RuIJyShR3dfqdut0Mooa/QgVIcUCzKSTMm/ewUtChDBUrfwaR1T6vAUc4NmzB1rYx7G5x2oqF8ECG0oAtK7GRcLHuc=&authSecret=0000019540cdc44b0d030a30843c1e1d",
"br": 96013,
"size": 2618560,
"md5": "082fc537ce73819afdeb6694703f398a",
"code": 200,
"expi": 1200,
"type": "m4a",
"gain": 0.0,
"peak": 0.9748,
"closedGain": 0.0,
"closedPeak": 0.0,
"fee": 8,
"uf": null,
"payed": 1,
"flag": 260,
"canExtend": false,
"freeTrialInfo": null,
"level": "standard",
"encodeType": "aac",
"channelLayout": null,
"freeTrialPrivilege": {
"resConsumable": false,
"userConsumable": false,
"listenType": null,
"cannotListenReason": null,
"playReason": null,
"freeLimitTagType": null
},
"freeTimeTrialPrivilege": {
"resConsumable": false,
"userConsumable": false,
"type": 0,
"remainTime": 0
},
"urlSource": 0,
"rightSource": 0,
"podcastCtrp": null,
"effectTypes": null,
"time": 214984,
"message": null,
"levelConfuse": null,
"musicId": "8169463320"
}
],
"code": 200
}
评论