# -*- coding: utf-8 -*- """ 霸王猫专用国密 SM4 适配器 精确复现前端 sm4.js 中的符号扩展与有符号整数溢出行为 (Bug 兼容版) """ import base64 # S 盒 SBOX = [ 214, 144, 233, 254, 204, 225, 61, 183, 22, 182, 20, 194, 40, 251, 44, 5, 43, 103, 154, 118, 42, 190, 4, 195, 170, 68, 19, 38, 73, 134, 6, 153, 156, 66, 80, 244, 145, 239, 152, 122, 51, 84, 11, 67, 237, 207, 172, 98, 228, 179, 28, 169, 201, 8, 232, 149, 128, 223, 148, 250, 117, 143, 63, 166, 71, 7, 167, 252, 243, 115, 23, 186, 131, 89, 60, 25, 230, 133, 79, 168, 104, 107, 129, 178, 113, 100, 218, 139, 248, 235, 15, 75, 112, 86, 157, 53, 30, 36, 14, 94, 99, 88, 209, 162, 37, 34, 124, 59, 1, 33, 120, 135, 212, 0, 70, 87, 159, 211, 39, 82, 76, 54, 2, 231, 160, 196, 200, 158, 234, 191, 138, 210, 64, 199, 56, 181, 163, 247, 242, 206, 249, 97, 21, 161, 224, 174, 93, 164, 155, 52, 26, 85, 173, 147, 50, 48, 245, 140, 177, 227, 29, 246, 226, 46, 130, 102, 202, 96, 192, 41, 35, 171, 13, 83, 78, 111, 213, 219, 55, 69, 222, 253, 142, 47, 3, 255, 106, 114, 109, 108, 91, 81, 141, 27, 175, 146, 187, 221, 188, 127, 17, 217, 92, 65, 31, 16, 90, 216, 10, 193, 49, 136, 165, 205, 123, 189, 45, 116, 208, 18, 184, 229, 180, 176, 137, 105, 151, 74, 12, 150, 119, 126, 101, 185, 241, 9, 197, 110, 198, 132, 24, 240, 125, 236, 58, 220, 77, 32, 121, 238, 95, 62, 215, 203, 57, 72 ] # FK 系统参数 FK = [2746333894, 1453994832, 1736282519, 2993693404] # CK 固定参数 CK = [ 462357, 472066609, 943670861, 1415275113, 1886879365, 2358483617, 2830087869, 3301692121, 3773296373, 4228057617, 404694573, 876298825, 1347903077, 1819507329, 2291111581, 2762715833, 3234320085, 3705924337, 4177462797, 337322537, 808926789, 1280531041, 1752135293, 2223739545, 2695343797, 3166948049, 3638552301, 4110090761, 269950501, 741554753, 1213159005, 1684763257 ] def to_int32(x: int) -> int: """强制模拟 JavaScript 32 位有符号整数""" x = x & 0xFFFFFFFF return x - 0x100000000 if x >= 0x80000000 else x class BrmCipherEngine: def __init__(self, secret_key: str = "11HDESa456HHugDz"): self.secret_key = secret_key def _get_ulong_be(self, b, i): val = ((255 & b[i]) << 24) | ((255 & b[i + 1]) << 16) | ((255 & b[i + 2]) << 8) | (255 & b[i + 3]) return to_int32(val) def _put_ulong_be(self, a, b, offset): # 模拟 JS 中有符号右移与 Java byte 强转 n = 255 & (a >> 24) r = 255 & (a >> 16) o = 255 & (a >> 8) i = 255 & a b[offset] = n - 256 if n > 128 else n b[offset + 1] = r - 256 if r > 128 else r b[offset + 2] = o - 256 if o > 128 else o b[offset + 3] = i - 256 if i > 128 else i def _shl(self, a, e): return to_int32(to_int32(4294967295 & a) << e) def _rotl(self, a, e): """核心 Bug 复现点:a >> (32 - e) 进行的是有符号算术右移""" s = self._shl(a, e) ss = a >> (32 - e) # Python 负数右移自动补符号位,与 JS >> 完全一致 return to_int32(s | ss) def _sm4_sbox(self, e): t = SBOX[255 & e] return t - 256 if t > 128 else t def _sm4_lt(self, a): t = [0] * 4 n = [0] * 4 self._put_ulong_be(a, t, 0) n[0] = self._sm4_sbox(t[0]) n[1] = self._sm4_sbox(t[1]) n[2] = self._sm4_sbox(t[2]) n[3] = self._sm4_sbox(t[3]) e = self._get_ulong_be(n, 0) res = e ^ self._rotl(e, 2) ^ self._rotl(e, 10) ^ self._rotl(e, 18) ^ self._rotl(e, 24) return to_int32(res) def _sm4_f(self, a, e, t, n, r): return to_int32(a ^ self._sm4_lt(to_int32(e ^ t ^ n ^ r))) def _sm4_calci_rk(self, a): t = [0] * 4 n = [0] * 4 self._put_ulong_be(a, t, 0) n[0] = self._sm4_sbox(t[0]) n[1] = self._sm4_sbox(t[1]) n[2] = self._sm4_sbox(t[2]) n[3] = self._sm4_sbox(t[3]) e = self._get_ulong_be(n, 0) res = e ^ self._rotl(e, 13) ^ self._rotl(e, 23) return to_int32(res) def _set_key(self, key_bytes): sk = [0] * 32 r = [0] * 4 o = [0] * 36 r[0] = self._get_ulong_be(key_bytes, 0) r[1] = self._get_ulong_be(key_bytes, 4) r[2] = self._get_ulong_be(key_bytes, 8) r[3] = self._get_ulong_be(key_bytes, 12) o[0] = to_int32(r[0] ^ to_int32(FK[0])) o[1] = to_int32(r[1] ^ to_int32(FK[1])) o[2] = to_int32(r[2] ^ to_int32(FK[2])) o[3] = to_int32(r[3] ^ to_int32(FK[3])) for i in range(32): mid = to_int32(o[i + 1] ^ o[i + 2] ^ o[i + 3] ^ to_int32(CK[i])) o[i + 4] = to_int32(o[i] ^ self._sm4_calci_rk(mid)) sk[i] = o[i + 4] return sk def _one_round(self, sk, inp, out): r = [0] * 36 r[0] = self._get_ulong_be(inp, 0) r[1] = self._get_ulong_be(inp, 4) r[2] = self._get_ulong_be(inp, 8) r[3] = self._get_ulong_be(inp, 12) for n in range(32): r[n + 4] = self._sm4_f(r[n], r[n + 1], r[n + 2], r[n + 3], sk[n]) self._put_ulong_be(r[35], out, 0) self._put_ulong_be(r[34], out, 4) self._put_ulong_be(r[33], out, 8) self._put_ulong_be(r[32], out, 12) def encrypt_ecb_base64(self, plaintext: str) -> str: """ECB 加密,PKCS7 补码,输出 Base64""" if not plaintext: return "" key_bytes = self.secret_key.encode("utf-8") sk = self._set_key(key_bytes) data_bytes = plaintext.encode("utf-8") pad_len = 16 - (len(data_bytes) % 16) padded = list(data_bytes) + [pad_len] * pad_len cipher_list = [] for i in range(0, len(padded), 16): block_in = padded[i:i + 16] block_out = [0] * 16 self._one_round(sk, block_in, block_out) cipher_list.extend(block_out) # 模拟 JS 中: a[t] < 0 && (a[t] = a[t] + 256) raw_bytes = bytes([b + 256 if b < 0 else b for b in cipher_list]) return base64.b64encode(raw_bytes).decode("ascii") def calc_location_and_sign(self, lat: str, lng: str): """ 根据前端 46fa 模块逻辑生成三合一参数: latitude: encrypt(lat) longitude: encrypt(lng) sign: encrypt(lat + '&cxd&' + lng) """ lat_str = str(lat).strip() lng_str = str(lng).strip() enc_lat = self.encrypt_ecb_base64(lat_str) enc_lng = self.encrypt_ecb_base64(lng_str) enc_sign = self.encrypt_ecb_base64(f"{lat_str}&cxd&{lng_str}") return enc_lat, enc_lng, enc_sign # 导出全局单例 CIPHER = BrmCipherEngine()