聊聊如何复现微信小程序的签名算法源码并重现签名请求

// test.js
"use strict";
var r = function (r, o) {
        return r << o | r >>> 32 - o
    },
    o = function (r) {
        var o, e = "";
        for (o = 7; o >= 0; o--) e += (r >>> 4 * o & 15).toString(16);
        return e
    };

function sha1(e) {
    var t, a, h, n, C, c, f, d, s, u = new Array(80),
        i = 1732584193,
        A = 4023233417,
        g = 2562383102,
        m = 271733878,
        p = 3285377520,
        S = (e = function (r) {
            r = r.replace(/\x0d\x0a/g, "\n");
            for (var o = "", e = 0; e < r.length; e++) {
                var t = r.charCodeAt(e);
                t < 128 ? o += String.fromCharCode(t) : t > 127 && t < 2048 ? (o += String.fromCharCode(t >> 6 | 192), o += String.fromCharCode(63 & t | 128)) : (o += String.fromCharCode(t >> 12 | 224), o += String.fromCharCode(t >> 6 & 63 | 128), o += String.fromCharCode(63 & t | 128))
            }
            return o
        }(e)).length,
        l = new Array;
    for (a = 0; a < S - 3; a += 4) h = e.charCodeAt(a) << 24 | e.charCodeAt(a + 1) << 16 | e.charCodeAt(a + 2) << 8 | e.charCodeAt(a + 3), l.push(h);
    switch (S % 4) {
        case 0:
            a = 2147483648;
            break;
        case 1:
            a = e.charCodeAt(S - 1) << 24 | 8388608;
            break;
        case 2:
            a = e.charCodeAt(S - 2) << 24 | e.charCodeAt(S - 1) << 16 | 32768;
            break;
        case 3:
            a = e.charCodeAt(S - 3) << 24 | e.charCodeAt(S - 2) << 16 | e.charCodeAt(S - 1) << 8 | 128
    }
    for (l.push(a); l.length % 16 != 14;) l.push(0);
    for (l.push(S >>> 29), l.push(S << 3 & 4294967295), t = 0; t < l.length; t += 16) {
        for (a = 0; a < 16; a++) u[a] = l[t + a];
        for (a = 16; a <= 79; a++) u[a] = r(u[a - 3] ^ u[a - 8] ^ u[a - 14] ^ u[a - 16], 1);
        for (n = i, C = A, c = g, f = m, d = p, a = 0; a <= 19; a++) s = r(n, 5) + (C & c | ~C & f) + d + u[a] + 1518500249 & 4294967295, d = f, f = c, c = r(C, 30), C = n, n = s;
        for (a = 20; a <= 39; a++) s = r(n, 5) + (C ^ c ^ f) + d + u[a] + 1859775393 & 4294967295, d = f, f = c, c = r(C, 30), C = n, n = s;
        for (a = 40; a <= 59; a++) s = r(n, 5) + (C & c | C & f | c & f) + d + u[a] + 2400959708 & 4294967295, d = f, f = c, c = r(C, 30), C = n, n = s;
        for (a = 60; a <= 79; a++) s = r(n, 5) + (C ^ c ^ f) + d + u[a] + 3395469782 & 4294967295, d = f, f = c, c = r(C, 30), C = n, n = s;
        i = i + n & 4294967295, A = A + C & 4294967295, g = g + c & 4294967295, m = m + f & 4294967295, p = p + d & 4294967295
    }
    return (s = o(i) + o(A) + o(g) + o(m) + o(p)).toLowerCase()
}


let params = {
    "classid": 5,
    "keyword": "",
    "describe": "获取商品分类",
    "openId": "o_cBd5WsY53n9hib-zFNqQqKzvtY",
    "profileId": "13754470098",
    "promotionid": "0",
    "touristTelphone": "",
    "isTourist": "",
    "timestamp": "1736654776",
    "sign": "049da2ed71e3fa2f90b02d00b11f7f35e6190379"
}


function n(e) {
    var n = r1(e);
    return n.length > 0 ? sha1(n) : ""
}


function _typeof(o) {
    return module.exports = _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) {
        return typeof o
    } : function (o) {
        return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o
    }, _typeof(o)
}

function r1(t) {
    t.sign && delete t.sign;
    var r = [];
    for (var n in t) r.push(n);
    var s = r.sort(),
        i = "";
    for (n = 0; n < s.length; n++) {
        var a = s[n],
            u = t[a];
        o1(u) || ("object" === _typeof(u) && (u = JSON.stringify(u)), i = i + "&" + a + "=" + u)
    }
    return i.length > 0 && (i = i.substring(1)), i
}

function o1(e) {
    return null == e || "" === e || "" === function (e) {
        if ("string" != typeof e) return e;
        return e.replace(/(^\s*)|(\s*$)/g, "")
    }(e) || "null" === e
}

//console.log(n(params))

//新增一个导出函数（node方式）
module.exports.init = function (arg1) {
    //调用函数，并返回
    console.log(n(arg1));
}

import os

params = {
    "classid": 5,
    "keyword": "",
    "describe": "获取商品分类",
    "openId": "o_cBd5WsY53n9hib-zFNqQqKzvtY",
    "profileId": "13754470098",
    "promotionid": "0",
    "touristTelphone": "",
    "isTourist": "",
    "timestamp": "1736654776",
    "sign": "049da2ed71e3fa2f90b02d00b11f7f35e6190379"
}

// test 为组合签名算法的js文件 如上述示例
cmd = 'node -e "require(\\"%s\\").init(%s)"' % ('./test', params)

pipeline = os.popen(cmd)

# 读取结果
result = pipeline.read()

print('结果是:', result)