易语言调用JS

summeralone

const crypto = require('crypto');
const sm4 = require('sm-crypto').sm4;
const base64js = require('base64-js');
const {Base64} = require("js-base64");

function context() {
    this.mode = 1;
    this.sk = new Array(32);
    this.isPadding = true;
}

function GET_ULONG_BE(b, i) {
    var n = (((b & 0xff) << 24) | ((b[i + 1] & 0xff) << 16) | ((b[i + 2] & 0xff) << 8) | (b[i + 3] & 0xff));
    return n;
};

function PUT_ULONG_BE(n, b, i) {
    b = (0xff & (n >> 24));
    b[i + 1] = (0xff & (n >> 16));
    b[i + 2] = (0xff & (n >> 8));
    b[i + 3] = (0xff & n);
}

function int_byte(a){
    return a;
}

function SHL(x, n) {
    return x << n;
}

function ROTL(x, n) {
    return SHL(x, n) | (x >>> (32 - n));
}

function SWAP(sk, i) {
    t = sk;
    sk = sk[(31 - i)];
    sk[(31 - i)] = t;
}

var sboxTable = [
    0xd6, 0x90, 0xe9, 0xfe, 0xcc, 0xe1, 0x3d, 0xb7, 0x16, 0xb6, 0x14, 0xc2, 0x28, 0xfb, 0x2c, 0x05,
    0x2b, 0x67, 0x9a, 0x76, 0x2a, 0xbe, 0x04, 0xc3, 0xaa, 0x44, 0x13, 0x26, 0x49, 0x86, 0x06, 0x99,
    0x9c, 0x42, 0x50, 0xf4, 0x91, 0xef, 0x98, 0x7a, 0x33, 0x54, 0x0b, 0x43, 0xed, 0xcf, 0xac, 0x62,
    0xe4, 0xb3, 0x1c, 0xa9, 0xc9, 0x08, 0xe8, 0x95, 0x80, 0xdf, 0x94, 0xfa, 0x75, 0x8f, 0x3f, 0xa6,
    0x47, 0x07, 0xa7, 0xfc, 0xf3, 0x73, 0x17, 0xba, 0x83, 0x59, 0x3c, 0x19, 0xe6, 0x85, 0x4f, 0xa8,
    0x68, 0x6b, 0x81, 0xb2, 0x71, 0x64, 0xda, 0x8b, 0xf8, 0xeb, 0x0f, 0x4b, 0x70, 0x56, 0x9d, 0x35,
    0x1e, 0x24, 0x0e, 0x5e, 0x63, 0x58, 0xd1, 0xa2, 0x25, 0x22, 0x7c, 0x3b, 0x01, 0x21, 0x78, 0x87,
    0xd4, 0x00, 0x46, 0x57, 0x9f, 0xd3, 0x27, 0x52, 0x4c, 0x36, 0x02, 0xe7, 0xa0, 0xc4, 0xc8, 0x9e,
    0xea, 0xbf, 0x8a, 0xd2, 0x40, 0xc7, 0x38, 0xb5, 0xa3, 0xf7, 0xf2, 0xce, 0xf9, 0x61, 0x15, 0xa1,
    0xe0, 0xae, 0x5d, 0xa4, 0x9b, 0x34, 0x1a, 0x55, 0xad, 0x93, 0x32, 0x30, 0xf5, 0x8c, 0xb1, 0xe3,
    0x1d, 0xf6, 0xe2, 0x2e, 0x82, 0x66, 0xca, 0x60, 0xc0, 0x29, 0x23, 0xab, 0x0d, 0x53, 0x4e, 0x6f,
    0xd5, 0xdb, 0x37, 0x45, 0xde, 0xfd, 0x8e, 0x2f, 0x03, 0xff, 0x6a, 0x72, 0x6d, 0x6c, 0x5b, 0x51,
    0x8d, 0x1b, 0xaf, 0x92, 0xbb, 0xdd, 0xbc, 0x7f, 0x11, 0xd9, 0x5c, 0x41, 0x1f, 0x10, 0x5a, 0xd8,
    0x0a, 0xc1, 0x31, 0x88, 0xa5, 0xcd, 0x7b, 0xbd, 0x2d, 0x74, 0xd0, 0x12, 0xb8, 0xe5, 0xb4, 0xb0,
    0x89, 0x69, 0x97, 0x4a, 0x0c, 0x96, 0x77, 0x7e, 0x65, 0xb9, 0xf1, 0x09, 0xc5, 0x6e, 0xc6, 0x84,
    0x18, 0xf0, 0x7d, 0xec, 0x3a, 0xdc, 0x4d, 0x20, 0x79, 0xee, 0x5f, 0x3e, 0xd7, 0xcb, 0x39, 0x48];

var CK = [
    0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269,
    0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
    0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249,
    0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
    0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229,
    0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
    0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209,
    0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279];

var FK = [0xa3b1bac6, 0x56aa3350, 0x677d9197, 0xb27022dc];

function sm4Sbox(inch) {
    var i = inch & 0xff;
    var retVal = sboxTable;
    return retVal;
}

function sm4Lt(ka) {
    var bb = 0;
    var c = 0;
    var a = new Array(4);
    var b = new Array(4);
    PUT_ULONG_BE(ka, a, 0);
    b[0] = sm4Sbox(a[0]);
    b[1] = sm4Sbox(a[1]);
    b[2] = sm4Sbox(a[2]);
    b[3] = sm4Sbox(a[3]);
    bb = GET_ULONG_BE(b, 0);
    c = bb ^ ROTL(bb, 2) ^ ROTL(bb, 10) ^ ROTL(bb, 18) ^ ROTL(bb, 24);
    return c;
}

function sm4F(x0, x1, x2, x3, rk) {
    return x0 ^ sm4Lt(x1 ^ x2 ^ x3 ^ rk);
}


function sm4CalciRK(ka) {
    var bb = 0;
    var rk = 0;
    var a = new Array(4);
    var b = new Array(4);
    PUT_ULONG_BE(ka, a, 0);
    b[0] = sm4Sbox(a[0]);
    b[1] = sm4Sbox(a[1]);
    b[2] = sm4Sbox(a[2]);
    b[3] = sm4Sbox(a[3]);
    bb = GET_ULONG_BE(b, 0);
    rk = bb ^ ROTL(bb, 13) ^ ROTL(bb, 23);
    return rk;
}

function sm4_setkey(SK, key) {
    var MK = new Array(4);
    var k = new Array(36);
    var i = 0;
    MK[0] = GET_ULONG_BE(key, 0);
    MK[1] = GET_ULONG_BE(key, 4);
    MK[2] = GET_ULONG_BE(key, 8);
    MK[3] = GET_ULONG_BE(key, 12);
    k[0] = MK[0] ^ FK[0];
    k[1] = MK[1] ^ FK[1];
    k[2] = MK[2] ^ FK[2];
    k[3] = MK[3] ^ FK[3];
    for (; i < 32; i++) {
        k[(i + 4)] = (k ^ sm4CalciRK(k[(i + 1)] ^ k[(i + 2)] ^ k[(i + 3)] ^ CK));
        SK = k[(i + 4)];
    }
}

function sm4_rounds(sk, input, output) {
    i = 0;
    ulbuf = new Array(36);
    ulbuf[0] = GET_ULONG_BE(input, 0);
    ulbuf[1] = GET_ULONG_BE(input, 4);
    ulbuf[2] = GET_ULONG_BE(input, 8);
    ulbuf[3] = GET_ULONG_BE(input, 12);
    while (i < 32) {
        ulbuf[(i + 4)] = sm4F(ulbuf, ulbuf[(i + 1)], ulbuf[(i + 2)], ulbuf[(i + 3)], sk);
        i++;
    }
    PUT_ULONG_BE(ulbuf[35], output, 0);
    PUT_ULONG_BE(ulbuf[34], output, 4);
    PUT_ULONG_BE(ulbuf[33], output, 8);
    PUT_ULONG_BE(ulbuf[32], output, 12);
}

function padding(input, mode) {
    if (input == undefined) {
        return null;
    }
    var ret = [];
    ret = ret.concat(input);
    if (mode == 1) {
        var p = 16 - input.length % 16;
        p = p % 16;
        for (i = 0; i < p; i++) {
            ret[input.length + i] = 0;
        }
    } else {
        while(ret[ret.length - 1] === 0) ret.pop()
    }
    return ret;
}

function sm4_setkey_enc(ctx, key) {

    if (ctx == undefined) {
        Error("ctx is null!");
    }

    if (key == undefined || key.length != 16) {
        Error("key error!");
    }
    ctx.mode = 1;
    sm4_setkey(ctx.sk, key);
}

function sm4_setkey_dec(ctx, key) {
    if (ctx == null) {
        Error("ctx is null!");
    }

    if (key == null || key.length != 16) {
        Error("key error!");
    }

    var i = 0;
    if(ctx !== null && ctx !== 'undefined'){
        ctx.mode = 0;
    }
    sm4_setkey(ctx.sk, key);
    ctx.sk = ctx.sk.reverse();
}

function sm4_crypt_ecb(ctx, input) {

    if (input == null | input == '') {
        Error("input is null!");
    }
    if ((ctx.isPadding) && (ctx.mode == 1)) {
        input = padding(input, 1);
    }

    var length = input.length;
    var bous = [];
    for (var t = 0; t < length; t += 16) {
        var inn = [];
        var out = [];
        inn.push(input[t + 0], input[t + 1], input[t + 2], input[t + 3], input[t + 4],
            input[t + 5], input[t + 6], input[t + 7], input[t + 8], input[t + 9], input[t + 10],
            input[t + 11], input[t + 12], input[t + 13], input[t + 14], input[t + 15]);
        // alert("inn-size"+inn.length);
        sm4_rounds(ctx.sk, inn, out);
        // alert("out-size"+out.length)
        bous = bous.concat(out);
    }
    // alert("bous-size"+bous.length);
    if (ctx.isPadding && ctx.mode == 0) {
        bous = padding(bous, 0);
    }

    return bous;
}

function hexStrToBytes(hexStr) {
    if(hexStr.length % 2 != 0){
        hexStr = '0' + hexStr;
    }
    var bytes = new Array(hexStr.length / 2);
    for (var i = 0; i < hexStr.length ; i += 2) {
        bytes[i/2] = parseInt(hexStr.substring(i,i+2),16) & 0xff
    }
    return bytes
}

function stringToByte(str) {
    var bytes = new Array();
    var len, c;
    len = str.length;
    for(var i = 0; i < len; i++) {
        c = str.charCodeAt(i);
        if(c >= 0x010000 && c <= 0x10FFFF) {
            bytes.push(((c >> 18) & 0x07) | 0xF0);
            bytes.push(((c >> 12) & 0x3F) | 0x80);
            bytes.push(((c >> 6) & 0x3F) | 0x80);
            bytes.push((c & 0x3F) | 0x80);
        } else if(c >= 0x000800 && c <= 0x00FFFF) {
            bytes.push(((c >> 12) & 0x0F) | 0xE0);
            bytes.push(((c >> 6) & 0x3F) | 0x80);
            bytes.push((c & 0x3F) | 0x80);
        } else if(c >= 0x000080 && c <= 0x0007FF) {
            bytes.push(((c >> 6) & 0x1F) | 0xC0);
            bytes.push((c & 0x3F) | 0x80);
        } else {
            bytes.push(c & 0xFF);
        }
    }
    return bytes;


}


function base(r, e, t) {
    t.byteLength = c;
    t.toByteArray = v;
    t.fromByteArray = s;
    var n = [];
    var o = [];
    var f = typeof Uint8Array !== "undefined" ? Uint8Array : Array;
    var i = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
    for (var a = 0, u = i.length; a < u; ++a) {
        n[a] = i[a];
        o[i.charCodeAt(a)] = a
    }
    o["-".charCodeAt(0)] = 62;
    o["_".charCodeAt(0)] = 63;

    function d(r) {
        var e = r.length;
        if (e % 4 > 0) {
            throw new Error("Invalid string. Length must be a multiple of 4")
        }
        return r[e - 2] === "=" ? 2 : r[e - 1] === "=" ? 1 : 0
    }

    function c(r) {
        return r.length * 3 / 4 - d(r)
    }

    function v(r) {
        var e, t, n, i, a;
        var u = r.length;
        i = d(r);
        a = new f(u * 3 / 4 - i);
        t = i > 0 ? u - 4 : u;
        var c = 0;
        for (e = 0; e < t; e += 4) {
            n = o[r.charCodeAt(e)] << 18 | o[r.charCodeAt(e + 1)] << 12 | o[r.charCodeAt(e + 2)] << 6 | o[r.charCodeAt(e + 3)];
            a[c++] = n >> 16 & 255;
            a[c++] = n >> 8 & 255;
            a[c++] = n & 255
        }
        if (i === 2) {
            n = o[r.charCodeAt(e)] << 2 | o[r.charCodeAt(e + 1)] >> 4;
            a[c++] = n & 255
        } else {
            if (i === 1) {
                n = o[r.charCodeAt(e)] << 10 | o[r.charCodeAt(e + 1)] << 4 | o[r.charCodeAt(e + 2)] >> 2;
                a[c++] = n >> 8 & 255;
                a[c++] = n & 255
            }
        }
        return a
    }

    function l(r) {
        return n[r >> 18 & 63] + n[r >> 12 & 63] + n[r >> 6 & 63] + n[r & 63]
    }

    function h(r, e, t) {
        var n;
        var o = [];
        for (var f = e; f < t; f += 3) {
            n = (r[f] << 16) + (r[f + 1] << 8) + r[f + 2];
            o.push(l(n))
        }
        return o.join("")
    }

    function s(r) {
        var e;
        var t = r.length;
        var o = t % 3;
        var f = "";
        var i = [];
        var a = 16383;
        for (var u = 0, d = t - o; u < d; u += a) {
            i.push(h(r, u, u + a > d ? d : u + a))
        }
        if (o === 1) {
            e = r[t - 1];
            f += n[e >> 2];
            f += n[e << 4 & 63];
            f += "=="
        } else {
            if (o === 2) {
                e = (r[t - 2] << 8) + r[t - 1];
                f += n[e >> 10];
                f += n[e >> 4 & 63];
                f += n[e << 2 & 63];
                f += "="
            }
        }
        i.push(f);
        return i.join("")
    }
}

function Sm4utils(key) {
    this.seckey = key;
    this.encryptData_ECB = encryptData_ECB;

    // this.hexString = false;
    function encryptData_ECB(plainText) {
        var ctx = new context();
        ctx.isPadding = true;
        ctx.mode = 1;
        var keyBytes;
        try {
            if (this.seckey == null) {
                throw "key 不规范"
            }
            // keyBytes = stringToByte(this.seckey);
            keyBytes = hexStrToBytes(this.seckey);
        } catch (e) {
            Error(e.message);
        }
        // alert("key"+keyBytes.length)
        sm4_setkey_enc(ctx, keyBytes);

        var encrypted = sm4_crypt_ecb(ctx, stringToByte(plainText));

        var cipherText = base64js.fromByteArray(encrypted);

        if (cipherText != null && cipherText.trim().length > 0) {
            cipherText.replace(/(\s*|\t|\r|\n)/g, "");
        }
        // alert(cipherText);
        return cipherText;
    }

}

function sm4Encrypt(message, key) {
    const cipherText = sm4.encrypt(message, key, { mode: 'ecb' });
    // const cipherText = sm4.encrypt(message, key);
    const base64Text = Base64.encode(cipherText);
    return base64Text;
}




function hmacSha1(message, key) {
    const hmac = crypto.createHmac('sha1', key);
    hmac.update(message);
    const digest = hmac.digest('base64');
    return digest;
}

// 示例1用法
const message = "ts=123&ttl=343&uid=111&userName=222";
const key = "BBA";
const hmac = hmacSha1(message, key);
console.log(hmac);

// 示例2用法
const message2 = "555555";
const key2 = "999999";
encrypt_sm4 = new Sm4utils(key2)
const cipherText = encrypt_sm4.encryptData_ECB(message2);
console.log(cipherText);
以上为JS内容
示例1和示例2需要转为易语言,给个例子,谢谢



补充内容 (2023-7-5 15:27):
或者不调用JS,直接用易语言写出算法也行

都由我来赎

OpenSSL3.0实现国密SM2(非对称加解密/签名)SM3散列SM4对称加解密
https://bbs.125.la/forum.php?mod=viewthread&tid=14730086
(出处: 精易论坛)

懒虫Obj

hmacSha1 sm4 这2个算法openssl

summeralone

懒虫Obj 发表于 2023-7-5 15:40
hmacSha1 sm4 这2个算法openssl

大佬,帮忙写个例子看下,或者有没有什么模块可以用