国密SM4算法前端JavaScript后端Java加密解密完整代码

本文介绍了一种基于SM4加密算法的前后端加密方案,并提供了完整的JavaScript和Java代码实现,包括ECB和CBC两种模式。

1.前言

近期做国密改造,需要前后端采用混合加密,其中SM4算法网上资源很少,即使有也是前台JS和后台JAVA加解密不一致。

最后找到可靠的代码如下:
参考大神链接【资源整合贴,不过后台使用的是.net后台】
参考大神链接【后端代码不全】:国密SM4,javaScript / vue加密解密 java加密解密
参考大神链接【前端代码不全】:SM4 js,java加解密

整合几位大神资源后实现SM4的前后端ECB模式/CBC模式加密解密。

2.前端JavaScript

2.1.代码输出截图:

在这里插入图片描述

2.2.完整代码:

<!DOCTYPE html<html>

<head>
	<meta charset="UTF-8">
	<title>SM4的加密解密</title>
</head>

<body>
	<script type="text/javascript">
		/**
		 * base64js 
		 */
		(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("")
					}
				}, {
   
   }]
			}, {
   
   }, [])("/")
		});


		/**
		 * 国密SM4加密算法
		 */
		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
评论 5
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值