爱奇艺authkey算法

1775天前 · 分享 · 1828次阅读

好像很久没有公开文章了...其实还是有写几篇,今天看到别人的博客,突然觉得还是得发点什么证明这个博客没有被废弃!

本文中心:爱奇艺authkey算法

  • 下了断点调试,很快就知道这个参数计算的方法了,然后下面是代码
  • 传入有两个参数,一个是13位时间戳,一个是tvid
  • 实际参与计算还有一个authkey(""),这是个固定值
  • 用法是node authkey.js tm tvid
  • 然而...它其实就是对字符串进行了md5计算
  • 所以最简单的代码就是md5("d41d8cd98f00b204e9800998ecf8427e"+tm+tvid)
function a(e, t) {
    e[t >> 5] |= 128 << t % 32,
    e[14 + (t + 64 >>> 9 << 4)] = t;
    for (var i = 1732584193, a = -271733879, n = -1732584194, u = 271733878, c = 0; c < e.length; c += 16) {
        var f = i
          , p = a
          , h = n
          , _ = u;
        i = r(i, a, n, u, e[c + 0], 7, -680876936),
        u = r(u, i, a, n, e[c + 1], 12, -389564586),
        n = r(n, u, i, a, e[c + 2], 17, 606105819),
        a = r(a, n, u, i, e[c + 3], 22, -1044525330),
        i = r(i, a, n, u, e[c + 4], 7, -176418897),
        u = r(u, i, a, n, e[c + 5], 12, 1200080426),
        n = r(n, u, i, a, e[c + 6], 17, -1473231341),
        a = r(a, n, u, i, e[c + 7], 22, -45705983),
        i = r(i, a, n, u, e[c + 8], 7, 1770035416),
        u = r(u, i, a, n, e[c + 9], 12, -1958414417),
        n = r(n, u, i, a, e[c + 10], 17, -42063),
        a = r(a, n, u, i, e[c + 11], 22, -1990404162),
        i = r(i, a, n, u, e[c + 12], 7, 1804603682),
        u = r(u, i, a, n, e[c + 13], 12, -40341101),
        n = r(n, u, i, a, e[c + 14], 17, -1502002290),
        a = r(a, n, u, i, e[c + 15], 22, 1236535329),
        i = o(i, a, n, u, e[c + 1], 5, -165796510),
        u = o(u, i, a, n, e[c + 6], 9, -1069501632),
        n = o(n, u, i, a, e[c + 11], 14, 643717713),
        a = o(a, n, u, i, e[c + 0], 20, -373897302),
        i = o(i, a, n, u, e[c + 5], 5, -701558691),
        u = o(u, i, a, n, e[c + 10], 9, 38016083),
        n = o(n, u, i, a, e[c + 15], 14, -660478335),
        a = o(a, n, u, i, e[c + 4], 20, -405537848),
        i = o(i, a, n, u, e[c + 9], 5, 568446438),
        u = o(u, i, a, n, e[c + 14], 9, -1019803690),
        n = o(n, u, i, a, e[c + 3], 14, -187363961),
        a = o(a, n, u, i, e[c + 8], 20, 1163531501),
        i = o(i, a, n, u, e[c + 13], 5, -1444681467),
        u = o(u, i, a, n, e[c + 2], 9, -51403784),
        n = o(n, u, i, a, e[c + 7], 14, 1735328473),
        a = o(a, n, u, i, e[c + 12], 20, -1926607734),
        i = s(i, a, n, u, e[c + 5], 4, -378558),
        u = s(u, i, a, n, e[c + 8], 11, -2022574463),
        n = s(n, u, i, a, e[c + 11], 16, 1839030562),
        a = s(a, n, u, i, e[c + 14], 23, -35309556),
        i = s(i, a, n, u, e[c + 1], 4, -1530992060),
        u = s(u, i, a, n, e[c + 4], 11, 1272893353),
        n = s(n, u, i, a, e[c + 7], 16, -155497632),
        a = s(a, n, u, i, e[c + 10], 23, -1094730640),
        i = s(i, a, n, u, e[c + 13], 4, 681279174),
        u = s(u, i, a, n, e[c + 0], 11, -358537222),
        n = s(n, u, i, a, e[c + 3], 16, -722521979),
        a = s(a, n, u, i, e[c + 6], 23, 76029189),
        i = s(i, a, n, u, e[c + 9], 4, -640364487),
        u = s(u, i, a, n, e[c + 12], 11, -421815835),
        n = s(n, u, i, a, e[c + 15], 16, 530742520),
        a = s(a, n, u, i, e[c + 2], 23, -995338651),
        i = d(i, a, n, u, e[c + 0], 6, -198630844),
        u = d(u, i, a, n, e[c + 7], 10, 1126891415),
        n = d(n, u, i, a, e[c + 14], 15, -1416354905),
        a = d(a, n, u, i, e[c + 5], 21, -57434055),
        i = d(i, a, n, u, e[c + 12], 6, 1700485571),
        u = d(u, i, a, n, e[c + 3], 10, -1894986606),
        n = d(n, u, i, a, e[c + 10], 15, -1051523),
        a = d(a, n, u, i, e[c + 1], 21, -2054922799),
        i = d(i, a, n, u, e[c + 8], 6, 1873313359),
        u = d(u, i, a, n, e[c + 15], 10, -30611744),
        n = d(n, u, i, a, e[c + 6], 15, -1560198380),
        a = d(a, n, u, i, e[c + 13], 21, 1309151649),
        i = d(i, a, n, u, e[c + 4], 6, -145523070),
        u = d(u, i, a, n, e[c + 11], 10, -1120210379),
        n = d(n, u, i, a, e[c + 2], 15, 718787259),
        a = d(a, n, u, i, e[c + 9], 21, -343485551),
        i = l(i, f),
        a = l(a, p),
        n = l(n, h),
        u = l(u, _)
    }
    return Array(i, a, n, u)
}
function n(e, t, i, a, n, r) {
    return l(u(l(l(t, e), l(a, r)), n), i)
}
function r(e, t, i, a, r, o, s) {
    return n(t & i | ~t & a, e, t, r, o, s)
}
function o(e, t, i, a, r, o, s) {
    return n(t & a | i & ~a, e, t, r, o, s)
}
function s(e, t, i, a, r, o, s) {
    return n(t ^ i ^ a, e, t, r, o, s)
}
function d(e, t, i, a, r, o, s) {
    return n(i ^ (t | ~a), e, t, r, o, s)
}
function l(e, t) {
    var i = (65535 & e) + (65535 & t);
    return (e >> 16) + (t >> 16) + (i >> 16) << 16 | 65535 & i
}
function u(e, t) {
    return e << t | e >>> 32 - t
}
function c(e) {
    for (var t = Array(), i = (1 << h) - 1, a = 0; a < e.length * h; a += h)
        t[a >> 5] |= (e.charCodeAt(a / h) & i) << a % 32;
    return t
}
function f(e) {
    for (var t = p ? "0123456789ABCDEF" : "0123456789abcdef", i = "", a = 0; a < 4 * e.length; a++)
        i += t.charAt(e[a >> 2] >> a % 4 * 8 + 4 & 15) + t.charAt(e[a >> 2] >> a % 4 * 8 & 15);
    return i
}
var p = 0
  , h = 8;
function authkey(e) {
    return f(a(c(e), e.length * h))
}
// console.log(authkey(authkey("")+"1558939218094"+"2494954900"))
var args = process.argv.slice(2);
tm = args[0]
tvid = args[1]
console.log(authkey("d41d8cd98f00b204e9800998ecf8427e" + tm + tvid));
👍 0

JavaScript

最后修改于1765天前

评论

贴吧 狗头 原神 小黄脸
收起

贴吧

狗头

原神

小黄脸

  1. nilaoda 1737天前

    大佬666

目录

avatar

未末

迷失

126

文章数

275

评论数

7

分类