某宝的sign算法的JavaScript代码转C++

逆向命运

已于 2024-02-18 23:28:31 修改

阅读量233

点赞数 2

文章标签：算法 javascript c++ c语言汇编 visual studio visual studio code

于 2024-02-18 23:24:08 首次发布

本文链接：https://blog.csdn.net/weixin_40105002/article/details/136160592

版权

uint64_t b(uint64_t a, uint64_t b) 
{
    return (a << b) | (a >> (32 - b));
}

uint64_t c(uint64_t a, uint64_t b) 
{
    uint64_t c, d, e, f, g;
    e = 2147483648 & a;
    f = 2147483648 & b;
    c = 1073741824 & a;
    d = 1073741824 & b;
    g = (1073741823 & a) + (1073741823 & b);

    if (c & d) {
        return 2147483648 ^ g ^ e ^ f;
    }
    else if (c | d) {
        if (1073741824 & g) {
            return 3221225472 ^ g ^ e ^ f;
        }
        else {
            return 1073741824 ^ g ^ e ^ f;
        }
    }
    else {
        return g ^ e ^ f;
    }
}

uint64_t d(uint64_t a, uint64_t b, uint64_t c) {
    return (a & b) | (~a & c);
}

uint64_t e(uint64_t a, uint64_t b, uint64_t c) {
    return (a & c) | (b & ~c);
}


uint64_t f(uint64_t a, uint64_t b, uint64_t c) {
    return a ^ b ^ c;
}

uint64_t g(uint64_t a, uint64_t b, uint64_t c) {
    return b ^ (a | ~c);
}

uint64_t h(uint64_t a, uint64_t e, uint64_t f, uint64_t g, uint64_t h, uint64_t i, uint64_t j) 
{
    auto p1 = d(e, f, g);
    auto p2 = c(p1, h);
    auto p3 = c(p2, j);
    a = c(a, p3);
    auto p4 = b(a, i);
    auto p5 = c(p4, e);
    return p5;
}


uint64_t i(uint64_t a, uint64_t d, uint64_t f, uint64_t g, uint64_t h, uint64_t i, uint64_t j) 
{
    auto p1 = e(d, f, g);
    auto p2 = c(p1, h);
    auto p3 = c(p2, j);
    a = c(a, p3);
    auto p4 = b(a, i);
    auto p5 = c(p4, d);
    return p5;
}

uint64_t j(uint64_t a, uint64_t d, uint64_t e, uint64_t g, uint64_t h, uint64_t i, uint64_t j) {
    a = c(a, c(c(f(d, e, g), h), j));
    return c(b(a, i), d);
}

uint64_t k(uint64_t a, uint64_t d, uint64_t e, uint64_t f, uint64_t h, uint64_t i, uint64_t j) {
    a = c(a, c(c(g(d, e, f), h), j));
    return c(b(a, i), d);
}


std::vector<uint64_t> l(const std::string& a) 
{
    size_t c = a.length();
    size_t d = c + 8;
    size_t e = (d - d % 64) / 64;
    size_t f = 16 * (e + 1);
    std::vector<uint64_t> g(f, 0);
    size_t h = 0;
    size_t i = 0;
    while (c > i) 
    {
        size_t b = (i - i % 4) / 4;
        size_t bitShift = i % 4 * 8;
        g[b] = g[b] | a[i] << bitShift;
        i++;
    }
    size_t b = (i - i % 4) / 4;
    size_t bitShift = i % 4 * 8;
    g[b] = g[b] | 128 << bitShift;
    g[f - 2] = c << 3;
    g[f - 1] = c >> 29;
    return g;
}

std::string m(uint64_t a) 
{
    std::stringstream ss;
    for (int c = 0; c <= 3; c++) 
    {
        uint64_t b = (a >> (8 * c)) & 255;
        ss << std::setw(2) << std::setfill('0') << std::hex << b;
    }
    return ss.str();
}

std::string n(const std::string& a) 
{
    std::string b;
    for (size_t c = 0; c < a.length(); c++) 
    {
        unsigned int d = a[c];
        if (d < 128) {
            b += static_cast<char>(d);
        }
        else if (d > 127 && d < 2048) {
            b += static_cast<char>(d >> 6 | 192);
            b += static_cast<char>((63 & d) | 128);
        }
        else {
            b += static_cast<char>(d >> 12 | 224);
            b += static_cast<char>((d >> 6) & 63 | 128);
            b += static_cast<char>((63 & d) | 128);
        }
    }
    return b;
}


void h(std::string a)
{
    std::vector<uint64_t> x;

    int y = 7;
    int z = 12;
    int A = 17;
    int B = 22;
    int C = 5;
    int D = 9;
    int E = 14;
    int F = 20;
    int G = 4;
    int H = 11;
    int I = 16;
    int J = 23;
    int K = 6;
    int L = 10;
    int M = 15;
    int N = 21;

    std::string aProcessed = n(a);
    x = l(aProcessed);
    uint64_t t = 1732584193;
    uint64_t u = 4023233417;
    uint64_t v = 2562383102;
    uint64_t w = 271733878;

    for (size_t o = 0; o < x.size(); o += 16) 
    {
        uint64_t p = t;
        uint64_t q = u;
        uint64_t r = v;
        uint64_t s = w;
        p = t; 
        q = u;
        r = v;
        s = w;
        t = h(t, u, v, w, x[o + 0], y, 3614090360);
        w = h(w, t, u, v, x[o + 1], z, 3905402710);
        v = h(v, w, t, u, x[o + 2], A, 606105819);
        u = h(u, v, w, t, x[o + 3], B, 3250441966);
        t = h(t, u, v, w, x[o + 4], y, 4118548399);
        w = h(w, t, u, v, x[o + 5], z, 1200080426);
        v = h(v, w, t, u, x[o + 6], A, 2821735955);
        u = h(u, v, w, t, x[o + 7], B, 4249261313);
        t = h(t, u, v, w, x[o + 8], y, 1770035416);
        w = h(w, t, u, v, x[o + 9], z, 2336552879);
        v = h(v, w, t, u, x[o + 10], A, 4294925233);
        u = h(u, v, w, t, x[o + 11], B, 2304563134);
        t = h(t, u, v, w, x[o + 12], y, 1804603682);
        w = h(w, t, u, v, x[o + 13], z, 4254626195);
        v = h(v, w, t, u, x[o + 14], A, 2792965006);
        u = h(u, v, w, t, x[o + 15], B, 1236535329);
        t = i(t, u, v, w, x[o + 1], C, 4129170786);
        w = i(w, t, u, v, x[o + 6], D, 3225465664);
        v = i(v, w, t, u, x[o + 11], E, 643717713);
        u = i(u, v, w, t, x[o + 0], F, 3921069994);
        t = i(t, u, v, w, x[o + 5], C, 3593408605);
        w = i(w, t, u, v, x[o + 10], D, 38016083);
        v = i(v, w, t, u, x[o + 15], E, 3634488961);
        u = i(u, v, w, t, x[o + 4], F, 3889429448);
        t = i(t, u, v, w, x[o + 9], C, 568446438);
        w = i(w, t, u, v, x[o + 14], D, 3275163606);
        v = i(v, w, t, u, x[o + 3], E, 4107603335);
        u = i(u, v, w, t, x[o + 8], F, 1163531501);
        t = i(t, u, v, w, x[o + 13], C, 2850285829);
        w = i(w, t, u, v, x[o + 2], D, 4243563512);
        v = i(v, w, t, u, x[o + 7], E, 1735328473);
        u = i(u, v, w, t, x[o + 12], F, 2368359562);
        t = j(t, u, v, w, x[o + 5], G, 4294588738);
        w = j(w, t, u, v, x[o + 8], H, 2272392833);
        v = j(v, w, t, u, x[o + 11], I, 1839030562);
        u = j(u, v, w, t, x[o + 14], J, 4259657740);
        t = j(t, u, v, w, x[o + 1], G, 2763975236);
        w = j(w, t, u, v, x[o + 4], H, 1272893353);
        v = j(v, w, t, u, x[o + 7], I, 4139469664);
        u = j(u, v, w, t, x[o + 10], J, 3200236656);
        t = j(t, u, v, w, x[o + 13], G, 681279174);
        w = j(w, t, u, v, x[o + 0], H, 3936430074);
        v = j(v, w, t, u, x[o + 3], I, 3572445317);
        u = j(u, v, w, t, x[o + 6], J, 76029189);
        t = j(t, u, v, w, x[o + 9], G, 3654602809);
        w = j(w, t, u, v, x[o + 12], H, 3873151461);
        v = j(v, w, t, u, x[o + 15], I, 530742520);
        u = j(u, v, w, t, x[o + 2], J, 3299628645);
        t = k(t, u, v, w, x[o + 0], K, 4096336452);
        w = k(w, t, u, v, x[o + 7], L, 1126891415);
        v = k(v, w, t, u, x[o + 14], M, 2878612391);
        u = k(u, v, w, t, x[o + 5], N, 4237533241);
        t = k(t, u, v, w, x[o + 12], K, 1700485571);
        w = k(w, t, u, v, x[o + 3], L, 2399980690);
        v = k(v, w, t, u, x[o + 10], M, 4293915773);
        u = k(u, v, w, t, x[o + 1], N, 2240044497);
        t = k(t, u, v, w, x[o + 8], K, 1873313359);
        w = k(w, t, u, v, x[o + 15], L, 4264355552);
        v = k(v, w, t, u, x[o + 6], M, 2734768916);
        u = k(u, v, w, t, x[o + 13], N, 1309151649);
        t = k(t, u, v, w, x[o + 4], K, 4149444226);
        w = k(w, t, u, v, x[o + 11], L, 3174756917);
        v = k(v, w, t, u, x[o + 2], M, 718787259);
        u = k(u, v, w, t, x[o + 9], N, 3951481745);
        t = c(t, p); 
        u = c(u, q); 
        v = c(v, r); 
        w = c(w, s);
    }



    std::string strValue = m(t) + m(u) + m(v) + m(w);

    std::cout << strValue << std::endl;
}

将某宝的sign生成算法JavaScript代码还原成C++代码