sha算法加密的js代码

###sha.js
sha1 = function () {
    var rotateLeft = function (lValue, iShiftBits) {
        return lValue << iShiftBits | lValue >>> 32 - iShiftBits
    }
        , cvtHex = function (value) {
        var i, v, string = "";
        for (i = 7; i >= 0; i--)
            v = value >>> 4 * i & 15,
                string += v.toString(16);
        return string
    }
        , uTF8Encode = function (string) {
        string = string.replace(/\x0d\x0a/g, "\n");
        for (var output = "", n = 0; n < string.length; n++) {
            var c = string.charCodeAt(n);
            c < 128 ? output += String.fromCharCode(c) : c > 127 && c < 2048 ? (output += String.fromCharCode(c >> 6 | 192),
                output += String.fromCharCode(63 & c | 128)) : (output += String.fromCharCode(c >> 12 | 224),
                output += String.fromCharCode(c >> 6 & 63 | 128),
                output += String.fromCharCode(63 & c | 128))
        }
        return output
    };
    return function (string) {
        var blockstart, i, j, A, B, C, D, E, tempValue, W = new Array(80), H0 = 1732584193, H1 = 4023233417,
            H2 = 2562383102, H3 = 271733878, H4 = 3285377520;
        string = uTF8Encode(string);
        var stringLength = string.length
            , wordArray = new Array;
        for (i = 0; i < stringLength - 3; i += 4)
            j = string.charCodeAt(i) << 24 | string.charCodeAt(i + 1) << 16 | string.charCodeAt(i + 2) << 8 | string.charCodeAt(i + 3),
                wordArray.push(j);
        switch (stringLength % 4) {
            case 0:
                i = 2147483648;
                break;
            case 1:
                i = string.charCodeAt(stringLength - 1) << 24 | 8388608;
                break;
            case 2:
                i = string.charCodeAt(stringLength - 2) << 24 | string.charCodeAt(stringLength - 1) << 16 | 32768;
                break;
            case 3:
                i = string.charCodeAt(stringLength - 3) << 24 | string.charCodeAt(stringLength - 2) << 16 | string.charCodeAt(stringLength - 1) << 8 | 128
        }
        for (wordArray.push(i); wordArray.length % 16 != 14;)
            wordArray.push(0);
        for (wordArray.push(stringLength >>> 29),
                 wordArray.push(stringLength << 3 & 4294967295),
                 blockstart = 0; blockstart < wordArray.length; blockstart += 16) {
            for (i = 0; i < 16; i++)
                W[i] = wordArray[blockstart + i];
            for (i = 16; i <= 79; i++)
                W[i] = rotateLeft(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
            for (A = H0,
                     B = H1,
                     C = H2,
                     D = H3,
                     E = H4,
                     i = 0; i <= 19; i++)
                tempValue = rotateLeft(A, 5) + (B & C | ~B & D) + E + W[i] + 1518500249 & 4294967295,
                    E = D,
                    D = C,
                    C = rotateLeft(B, 30),
                    B = A,
                    A = tempValue;
            for (i = 20; i <= 39; i++)
                tempValue = rotateLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 1859775393 & 4294967295,
                    E = D,
                    D = C,
                    C = rotateLeft(B, 30),
                    B = A,
                    A = tempValue;
            for (i = 40; i <= 59; i++)
                tempValue = rotateLeft(A, 5) + (B & C | B & D | C & D) + E + W[i] + 2400959708 & 4294967295,
                    E = D,
                    D = C,
                    C = rotateLeft(B, 30),
                    B = A,
                    A = tempValue;
            for (i = 60; i <= 79; i++)
                tempValue = rotateLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 3395469782 & 4294967295,
                    E = D,
                    D = C,
                    C = rotateLeft(B, 30),
                    B = A,
                    A = tempValue;
            H0 = H0 + A & 4294967295,
                H1 = H1 + B & 4294967295,
                H2 = H2 + C & 4294967295,
                H3 = H3 + D & 4294967295,
                H4 = H4 + E & 4294967295
        }
        var tempValue = cvtHex(H0) + cvtHex(H1) + cvtHex(H2) + cvtHex(H3) + cvtHex(H4);
        return tempValue.toLowerCase()
    }
}()

调用sha.js加密数据

import execjs

with open('sha.js',encoding="utf-8") as f:
    code = f.read()

js = execjs.compile(code)
result = js.call('sha1',"123456")
print(result)

加密结果:7c4a8d09ca3762af61e59520943dc26494f8941b