文章目录
- 1. SM算法简介
- 2. 百度SM4算法 实现的心酸历程
- 3. SM4 前端javascript代码实现加密解密
- 4. SM4 后端java代码实现
- 5. 测试SM4是否可用
- 6. vue 中使用国密SM4加密解密
1. SM算法简介
SM算法：国密即国家密码局认定的国产密码算法。主要有SM1，SM2，SM3，SM4。密钥长度和分组长度均为128位。
- SM1 为对称加密。其加密强度与AES相当。该算法不公开，调用该算法时，需要通过加密芯片的接口进行调用。
- SM2为非对称加密，基于ECC。该算法已公开。由于该算法基于ECC，故其签名速度与秘钥生成速度都快于RSA。ECC 256位（SM2采用的就是ECC 256位的一种）安全强度比RSA 2048位高，但运算速度快于RSA。
- SM3 消息摘要。可以用MD5作为对比理解。该算法已公开。校验结果为256位。
- SM4 无线局域网标准的分组数据算法。对称加密，密钥长度和分组长度均为128位。
2. 百度SM4算法 实现的心酸历程
我大量尝试了网上其他博主的SM算法相关的博客，但是均是前端可以实现加解密，但是后端返回数据就解密失败。不匹配问题。所以我们需要匹配前端和后端保持一致
相关博客：
vue gm-crypt-nodejs 实现加解密
vue中如何使用SM4国密来加密？
国密SM4，javaScript加密 java解密（不完整，前端js缺少解密方法）
SM4网上有许多java代码，但javaScript代码实现缺很少。以下代码是根据Java代码自己写的JavaScript版本：
本着前端的思维，因为这段时间的工作需要，接触到了SM算法，本篇采用的是SM4 分前端javascript及后端的java两部分。
3. SM4 前端javascript代码实现加密解密
<!DOCTYPE html<html>
<head>
<meta charset="UTF-8">
<title>javaScript加密解密</title>
</head>
<body>
<script type="text/javascript">
(function (r) { if (typeof exports === "object" && typeof module !== "undefined") { module.exports = r() } else { if (typeof define === "function" && define.amd) { define([], r) } else { var e; if (typeof window !== "undefined") { e = window } else { if (typeof global !== "undefined") { e = global } else { if (typeof self !== "undefined") { e = self } else { e = this } } } e.base64js = r() } } })(function () { var r, e, t; return function r(e, t, n) { function o(i, a) { if (!t[i]) { if (!e[i]) { var u = typeof require == "function" && require; if (!a && u) { return u(i, !0) } if (f) { return f(i, !0) } var d = new Error("Cannot find module '" + i + "'"); throw d.code = "MODULE_NOT_FOUND", d } var c = t[i] = { exports: {} }; e[i][0].call(c.exports, function (r) { var t = e[i][1][r]; return o(t ? t : r) }, c, c.exports, r, e, t, n) } return t[i].exports } var f = typeof require == "function" && require; for (var i = 0; i < n.length; i++) { o(n[i]) } return o }({ "/": [function (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 SM4_Context() {
this.mode = 1;
this.isPadding = true;
this.sk = new Array(32);
}
function SM4() {
this.SM4_ENCRYPT = 1;
this.SM4_DECRYPT = 0;
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 FK = [0xa3b1bac6, 0x56aa3350, 0x677d9197, 0xb27022dc];
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];
this.GET_ULONG_BE = function (b, i) {
return (b[i] & 0xff) << 24 | ((b[i + 1] & 0xff) << 16) | ((b[i + 2] & 0xff) << 8) | (b[i + 3] & 0xff) & 0xffffffff;
}
this.PUT_ULONG_BE = function (n, b, i) {
var t1 = (0xFF & (n >> 24));
var t2 = (0xFF & (n >> 16));
var t3 = (0xFF & (n >> 8));
var t4 = (0xFF & (n));
b[i] = t1 > 128 ? t1 - 256 : t1;
b[i + 1] = t2 > 128 ? t2 - 256 : t2;
b[i + 2] = t3 > 128 ? t3 - 256 : t3;
b[i + 3] = t4 > 128 ? t4 - 256 : t4;
}
this.SHL = function (x, n) {
return (x & 0xFFFFFFFF) << n;
}
this.ROTL = function (x, n) {
var s = this.SHL(x, n);
var ss = x >> (32 - n);
return this.SHL(x, n) | x >> (32 - n);
}
this.sm4Lt = function (ka) {
var bb = 0;
var c = 0;
var a = new Array(4);
var b = new Array(4);
this.PUT_ULONG_BE(ka, a, 0);
b[0] = this.sm4Sbox(a[0]);
b[1] = this.sm4Sbox(a[1]);
b[2] = this.sm4Sbox(a[2]);
b[3] = this.sm4Sbox(a[3]);
bb = this.GET_ULONG_BE(b, 0);
c = bb ^ this.ROTL(bb, 2) ^ this.ROTL(bb, 10) ^ this.ROTL(bb, 18) ^ this.ROTL(bb, 24);
return c;
}
this.sm4F = function (x0, x1, x2, x3, rk) {
return x0 ^ this.sm4Lt(x1 ^ x2 ^ x3 ^ rk);
}
this.sm4CalciRK = function (ka) {
var bb = 0;
var rk = 0;
var a = new Array(4);
var b = new Array(4);
this.PUT_ULONG_BE(ka, a, 0);
b[0] = this.sm4Sbox(a[0]);
b[1] = this.sm4Sbox(a[1]);
b[2] = this.sm4Sbox(a[2]);
b[3] = this.sm4Sbox(a[3]);
bb = this.GET_ULONG_BE(b, 0);
rk = bb ^ this.ROTL(bb, 13) ^ this.ROTL(bb, 23);
return rk;
}
this.sm4Sbox = function (inch) {
var i = inch & 0xFF;
var retVal = SboxTable[i];
return retVal > 128 ? retVal - 256 : retVal;
}
this.sm4_setkey_enc = function (ctx, key) {
if (ctx == null) {
alert("ctx is null!");
return false;
}
if (key == null || key.length != 16) {
alert("key error!");
return false;
}
ctx.mode = this.SM4_ENCRYPT;
this.sm4_setkey(ctx.sk, key);
};
//生成解密密钥
this.sm4_setkey_dec = function (ctx, key) {
if (ctx == null) {
Error("ctx is null!");
}
if (key == null || key.length != 16) {
Error("key error!");
}
var i = 0;
ctx.mode = 0;
this.sm4_setkey(ctx.sk, key);
ctx.sk = ctx.sk.reverse();
}
this.sm4_setkey = function (SK, key) {
var MK = new Array(4);
var k = new Array(36);
var i = 0;
MK[0] = this.GET_ULONG_BE(key, 0);
MK[1] = this.GET_ULONG_BE(key, 4);
MK[2] = this.GET_ULONG_BE(key, 8);
MK[3] = this.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 (var i = 0; i < 32; i++) {
k[(i + 4)] = (k[i] ^ this.sm4CalciRK(k[(i + 1)] ^ k[(i + 2)] ^ k[(i + 3)] ^ CK[i]));
SK[i] = k[(i + 4)];
}
}
this.padding = function (input, mode) {
if (input == null) {
return null;
}
var ret = null;
if (mode == this.SM4_ENCRYPT) {
var p = parseInt(16 - input.length % 16);
ret = input.slice(0);
for (var i = 0; i < p; i++) {
ret[input.length + i] = p;
}
} else {
var p = input[input.length - 1];
ret = input.slice(0, input.length - p);
}
return ret;
}
this.sm4_one_round = function (sk, input, output) {
var i = 0;
var ulbuf = new Array(36);
ulbuf[0] = this.GET_ULONG_BE(input, 0);
ulbuf[1] = this.GET_ULONG_BE(input, 4);
ulbuf[2] = this.GET_ULONG_BE(input, 8);
ulbuf[3] = this.GET_ULONG_BE(input, 12);
while (i < 32) {
ulbuf[(i + 4)] = this.sm4F(ulbuf[i], ulbuf[(i + 1)], ulbuf[(i + 2)], ulbuf[(i + 3)], sk[i]);
i++;
}
this.PUT_ULONG_BE(ulbuf[35], output, 0);
this.PUT_ULONG_BE(ulbuf[34], output, 4);
this.PUT_ULONG_BE(ulbuf[33], output, 8);
this.PUT_ULONG_BE(ulbuf[32], output, 12);
}
this.sm4_crypt_ecb = function (ctx, input) {
if (input == null) {
alert("input is null!");
}
if ((ctx.isPadding) && (ctx.mode == this.SM4_ENCRYPT)) {
input = this.padding(input, this.SM4_ENCRYPT);
}
var i = 0;
var length = input.length;
var bous = new Array();
for (; length > 0; length -= 16) {
var out = new Array(16);
var ins = input.slice(i * 16, (16 * (i + 1)));
this.sm4_one_round(ctx.sk, ins, out)
bous = bous.concat(out);
i++;
}
var output = bous;
if (ctx.isPadding && ctx.mode == this.SM4_DECRYPT) {
output = this.padding(output, this.SM4_DECRYPT);
}
for (var i = 0; i < output.length; i++) {
if (output[i] < 0) {
output[i] = output[i] + 256;
}
}
return output;
}
this.sm4_crypt_cbc = function (ctx, iv, input) {
if (iv == null || iv.length != 16) {
alert("iv error!");
}
if (input == null) {
alert("input is null!");
}
if (ctx.isPadding && ctx.mode == this.SM4_ENCRYPT) {
input = this.padding(input, this.SM4_ENCRYPT);
}
var i = 0;
var length = input.length;
var bous = new Array();
if (ctx.mode == this.SM4_ENCRYPT) {
var k = 0;
for (; length > 0; length -= 16) {
var out = new Array(16);
var out1 = new Array(16);
var ins = input.slice(k * 16, (16 * (k + 1)));
for (i = 0; i < 16; i++) {
out[i] = (ins[i] ^ iv[i]);
}
this.sm4_one_round(ctx.sk, out, out1);
iv = out1.slice(0, 16);
bous = bous.concat(out1);
k++;
}
}
else {
var temp = [];
var k = 0;
for (; length > 0; length -= 16) {
var out = new Array(16);
var out1 = new Array(16);
var ins = input.slice(k * 16, (16 * (k + 1)));
temp = ins.slice(0, 16);
sm4_one_round(ctx.sk, ins, out);
for (i = 0; i < 16; i++) {
out1[i] = (out[i] ^ iv[i]);
}
iv = temp.slice(0, 16);
bous = bous.concat(out1);
k++;
}
}
var output = bous;
if (ctx.isPadding && ctx.mode == this.SM4_DECRYPT) {
output = this.padding(output, this.SM4_DECRYPT);
}
for (var i = 0; i < output.length; i++) {
if (output[i] < 0) {
output[i] = output[i] + 256;
}
}
return output;
}
}
function SM4Util() {
this.secretKey = "11HDESAAHIHHUGDZ";
this.iv = "";
this.hexString = false;
//加密_ECB
this.encryptData_ECB = function (plainText) {
try {
var sm4 = new SM4();
var ctx = new SM4_Context();
ctx.isPadding = true;
ctx.mode = sm4.SM4_ENCRYPT;
var keyBytes = stringToByte(this.secretKey);
sm4.sm4_setkey_enc(ctx, keyBytes);
var encrypted = sm4.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, "");
}
return cipherText;
} catch (e) {
console.error(e);
return null;
}
}
//解密_ECB
this.decryptData_ECB = function (cipherText) {
try {
var sm4 = new SM4();
var ctx = new SM4_Context();
ctx.isPadding = true;
ctx.mode = sm4.SM4_ENCRYPT;
var keyBytes = stringToByte(this.secretKey);
sm4.sm4_setkey_dec(ctx, keyBytes);
var decrypted = sm4.sm4_crypt_ecb(ctx, base64js.toByteArray(cipherText));
return byteToString(decrypted);
} catch (e) {
console.error(e);
return null;
}
}
this.encryptData_CBC = function (plainText) {
try {
var sm4 = new SM4();
var ctx = new SM4_Context();
ctx.isPadding = true;
ctx.mode = sm4.SM4_ENCRYPT;
var keyBytes = stringToByte(this.secretKey);
var ivBytes = stringToByte(this.iv);
sm4.sm4_setkey_enc(ctx, keyBytes);
var encrypted = sm4.sm4_crypt_cbc(ctx, ivBytes, stringToByte(plainText));
var cipherText = base64js.fromByteArray(encrypted);
if (cipherText != null && cipherText.trim().length > 0) {
cipherText.replace(/(\s*|\t|\r|\n)/g, "");
}
return cipherText;
}
catch (e) {
console.error(e);
return null;
}
}
stringToByte = function (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;
}
byteToString = function (arr) {
if (typeof arr === 'string') {
return arr;
}
var str = '',
_arr = arr;
for (var i = 0; i < _arr.length; i++) {
var one = _arr[i].toString(2),
v = one.match(/^1+?(?=0)/);
if (v && one.length == 8) {
var bytesLength = v[0].length;
var store = _arr[i].toString(2).slice(7 - bytesLength);
for (var st = 1; st < bytesLength; st++) {
store += _arr[st + i].toString(2).slice(2);
}
str += String.fromCharCode(parseInt(store, 2));
i += bytesLength - 1;
} else {
str += String.fromCharCode(_arr[i]);
}
}
return str;
}
};
var s4 = new SM4Util();
s4.iv = "UISwD9fW6cFh9SNS";
// 加密
console.log(s4.encryptData_ECB("2477.39713035076"));
// 解密
var dedata = s4.decryptData_ECB("4ncw+RSEdPY/gnet0Usv0LEtCGYrxBzm6zSzXrLScUA=");
console.log(dedata);
</script>
</body>
</html>
4. SM4 后端java代码实现
package com.encode.sm4;
import java.math.BigInteger;
public class Util
{
public static byte[] intToBytes(int num)
{
byte[] bytes = new byte[4];
bytes[0] = (byte) (0xff & (num >> 0));
bytes[1] = (byte) (0xff & (num >> 8));
bytes[2] = (byte) (0xff & (num >> 16));
bytes[3] = (byte) (0xff & (num >> 24));
return bytes;
}
public static int byteToInt(byte[] bytes)
{
int num = 0;
int temp;
temp = (0x000000ff & (bytes[0])) << 0;
num = num | temp;
temp = (0x000000ff & (bytes[1])) << 8;
num = num | temp;
temp = (0x000000ff & (bytes[2])) << 16;
num = num | temp;
temp = (0x000000ff & (bytes[3])) << 24;
num = num | temp;
return num;
}
public static byte[] longToBytes(long num)
{
byte[] bytes = new byte[8];
for (int i = 0; i < 8; i++)
{
bytes[i] = (byte) (0xff & (num >> (i * 8)));
}
return bytes;
}
public static byte[] byteConvert32Bytes(BigInteger n)
{
byte tmpd[] = (byte[])null;
if(n == null)
{
return null;
}
if(n.toByteArray().length == 33)
{
tmpd = new byte[32];
System.arraycopy(n.toByteArray(), 1, tmpd, 0, 32);
}
else if(n.toByteArray().length == 32)
{
tmpd = n.toByteArray();
}
else
{
tmpd = new byte[32];
for(int i = 0; i < 32 - n.toByteArray().length; i++)
{
tmpd[i] = 0;
}
System.arraycopy(n.toByteArray(), 0, tmpd, 32 - n.toByteArray().length, n.toByteArray().length);
}
return tmpd;
}
public static BigInteger byteConvertInteger(byte[] b)
{
if (b[0] < 0)
{
byte[] temp = new byte[b.length + 1];
temp[0] = 0;
System.arraycopy(b, 0, temp, 1, b.length);
return new BigInteger(temp);
}
return new BigInteger(b);
}
public static String getHexString(byte[] bytes)
{
return getHexString(bytes, true);
}
public static String getHexString(byte[] bytes, boolean upperCase)
{
String ret = "";
for (int i = 0; i < bytes.length; i++)
{
ret += Integer.toString((bytes[i] & 0xff) + 0x100, 16).substring(1);
}
return upperCase ? ret.toUpperCase() : ret;
}
public static void printHexString(byte[] bytes)
{
for (int i = 0; i < bytes.length; i++)
{
String hex = Integer.toHexString(bytes[i] & 0xFF);
if (hex.length() == 1)
{
hex = '0' + hex;
}
System.out.print("0x" + hex.toUpperCase() + ",");
}
System.out.println("");
}
public static byte[] hexStringToBytes(String hexString)
{
if (hexString == null || hexString.equals(""))
{
return null;
}
hexString = hexString.toUpperCase();
int length = hexString.length() / 2;
char[] hexChars = hexString.toCharArray();
byte[] d = new byte[length];
for (int i = 0; i < length; i++)
{
int pos = i * 2;
d[i] = (byte) (charToByte(hexChars[pos]) << 4 | charToByte(hexChars[pos + 1]));
}
return d;
}
public static byte charToByte(char c)
{
return (byte) "0123456789ABCDEF".indexOf(c);
}
private static final char[] DIGITS_LOWER = {'0', '1', '2', '3', '4', '5',
'6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'};
private static final char[] DIGITS_UPPER = {'0', '1', '2', '3', '4', '5',
'6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'};
public static char[] encodeHex(byte[] data) {
return encodeHex(data, true);
}
public static char[] encodeHex(byte[] data, boolean toLowerCase) {
return encodeHex(data, toLowerCase ? DIGITS_LOWER : DIGITS_UPPER);
}
protected static char[] encodeHex(byte[] data, char[] toDigits) {
int l = data.length;
char[] out = new char[l << 1];
// two characters form the hex value.
for (int i = 0, j = 0; i < l; i++) {
out[j++] = toDigits[(0xF0 & data[i]) >>> 4];
out[j++] = toDigits[0x0F & data[i]];
}
return out;
}
public static String encodeHexString(byte[] data) {
return encodeHexString(data, true);
}
public static String encodeHexString(byte[] data, boolean toLowerCase) {
return encodeHexString(data, toLowerCase ? DIGITS_LOWER : DIGITS_UPPER);
}
protected static String encodeHexString(byte[] data, char[] toDigits) {
return new String(encodeHex(data, toDigits));
}
public static byte[] decodeHex(char[] data) {
int len = data.length;
if ((len & 0x01) != 0) {
throw new RuntimeException("Odd number of characters.");
}
byte[] out = new byte[len >> 1];
// two characters form the hex value.
for (int i = 0, j = 0; j < len; i++) {
int f = toDigit(data[j], j) << 4;
j++;
f = f | toDigit(data[j], j);
j++;
out[i] = (byte) (f & 0xFF);
}
return out;
}
protected static int toDigit(char ch, int index) {
int digit = Character.digit(ch, 16);
if (digit == -1) {
throw new RuntimeException("Illegal hexadecimal character " + ch
+ " at index " + index);
}
return digit;
}
public static String StringToAsciiString(String content) {
String result = "";
int max = content.length();
for (int i = 0; i < max; i++) {
char c = content.charAt(i);
String b = Integer.toHexString(c);
result = result + b;
}
return result;
}
public static String hexStringToString(String hexString, int encodeType) {
String result = "";
int max = hexString.length() / encodeType;
for (int i = 0; i < max; i++) {
char c = (char) hexStringToAlgorism(hexString
.substring(i * encodeType, (i + 1) * encodeType));
result += c;
}
return result;
}
public static int hexStringToAlgorism(String hex) {
hex = hex.toUpperCase();
int max = hex.length();
int result = 0;
for (int i = max; i > 0; i--) {
char c = hex.charAt(i - 1);
int algorism = 0;
if (c >= '0' && c <= '9') {
algorism = c - '0';
} else {
algorism = c - 55;
}
result += Math.pow(16, max - i) * algorism;
}
return result;
}
public static String hexStringToBinary(String hex) {
hex = hex.toUpperCase();
String result = "";
int max = hex.length();
for (int i = 0; i < max; i++) {
char c = hex.charAt(i);
switch (c) {
case '0':
result += "0000";
break;
case '1':
result += "0001";
break;
case '2':
result += "0010";
break;
case '3':
result += "0011";
break;
case '4':
result += "0100";
break;
case '5':
result += "0101";
break;
case '6':
result += "0110";
break;
case '7':
result += "0111";
break;
case '8':
result += "1000";
break;
case '9':
result += "1001";
break;
case 'A':
result += "1010";
break;
case 'B':
result += "1011";
break;
case 'C':
result += "1100";
break;
case 'D':
result += "1101";
break;
case 'E':
result += "1110";
break;
case 'F':
result += "1111";
break;
}
}
return result;
}
public static String AsciiStringToString(String content) {
String result = "";
int length = content.length() / 2;
for (int i = 0; i < length; i++) {
String c = content.substring(i * 2, i * 2 + 2);
int a = hexStringToAlgorism(c);
char b = (char) a;
String d = String.valueOf(b);
result += d;
}
return result;
}
public static String algorismToHexString(int algorism, int maxLength) {
String result = "";
result = Integer.toHexString(algorism);
if (result.length() % 2 == 1) {
result = "0" + result;
}
return patchHexString(result.toUpperCase(), maxLength);
}
public static String byteToString(byte[] bytearray) {
String result = "";
char temp;
int length = bytearray.length;
for (int i = 0; i < length; i++) {
temp = (char) bytearray[i];
result += temp;
}
return result;
}
public static int binaryToAlgorism(String binary) {
int max = binary.length();
int result = 0;
for (int i = max; i > 0; i--) {
char c = binary.charAt(i - 1);
int algorism = c - '0';
result += Math.pow(2, max - i) * algorism;
}
return result;
}
public static String algorismToHEXString(int algorism) {
String result = "";
result = Integer.toHexString(algorism);
if (result.length() % 2 == 1) {
result = "0" + result;
}
result = result.toUpperCase();
return result;
}
static public String patchHexString(String str, int maxLength) {
String temp = "";
for (int i = 0; i < maxLength - str.length(); i++) {
temp = "0" + temp;
}
str = (temp + str).substring(0, maxLength);
return str;
}
public static int parseToInt(String s, int defaultInt, int radix) {
int i = 0;
try {
i = Integer.parseInt(s, radix);
} catch (NumberFormatException ex) {
i = defaultInt;
}
return i;
}
public static int parseToInt(String s, int defaultInt) {
int i = 0;
try {
i = Integer.parseInt(s);
} catch (NumberFormatException ex) {
i = defaultInt;
}
return i;
}
public static byte[] hexToByte(String hex)
throws IllegalArgumentException {
if (hex.length() % 2 != 0) {
throw new IllegalArgumentException();
}
char[] arr = hex.toCharArray();
byte[] b = new byte[hex.length() / 2];
for (int i = 0, j = 0, l = hex.length(); i < l; i++, j++) {
String swap = "" + arr[i++] + arr[i];
int byteint = Integer.parseInt(swap, 16) & 0xFF;
b[j] = new Integer(byteint).byteValue();
}
return b;
}
public static String byteToHex(byte b[]) {
if (b == null) {
throw new IllegalArgumentException(
"Argument b ( byte array ) is null! ");
}
String hs = "";
String stmp = "";
for (int n = 0; n < b.length; n++) {
stmp = Integer.toHexString(b[n] & 0xff);
if (stmp.length() == 1) {
hs = hs + "0" + stmp;
} else {
hs = hs + stmp;
}
}
return hs.toUpperCase();
}
public static byte[] subByte(byte[] input, int startIndex, int length) {
byte[] bt = new byte[length];
for (int i = 0; i < length; i++) {
bt[i] = input[i + startIndex];
}
return bt;
}
}
5. 测试SM4是否可用
为了保住数据安全，前端通过加密后的数据发送给后端，后端返回数据中也会是加密后的数据。
5.1 这是后端接口返回的加密数据
5.2 前端通过解密加密后的数据
可以验证我们的SM4是可以实现加密解密，并且前后端能保持一致性。
6. vue 中使用国密SM4加密解密
6.1 封装成SM4Utils.js 工具类 【把加密解密的方法导出，供外部使用（下面是部分截图）】
6.2 我已经封装好了，下载后放入utils目录中。
下载点击：SM4Util.js 【前端JS sm4加密解密工具类】
6.3 页面引入使用
import { encryptData_ECB, decryptData_ECB } from "../../utils/SM4Util";
在mountd钩子中使用
mounted() {
console.log("解密：" + decryptData_ECB("4ncw+RSEdPY/gnet0Usv0LEtCGYrxBzm6zSzXrLScUA="));
console.log("加密：" + encryptData_ECB("2477.39713035076"));
}
结果：
