PageSourceSearch

https://mail.jdz.gov.cn/encrypt/sm4Helper.js?v=1789635370868

js jdz.gov.cn collected 2026-10-02 07:41:22 UTC 11,272 bytes, 359 lines download raw bytes

1/* eslint-disable no-bitwise, no-mixed-operators, complexity */
2var sm4Helper = function(){
3const DECRYPT = 0
4const ROUND = 32
5const BLOCK = 16
6
7const Sbox = [
8  0xd6, 0x90, 0xe9, 0xfe, 0xcc, 0xe1, 0x3d, 0xb7, 0x16, 0xb6, 0x14, 0xc2, 0x28, 0xfb, 0x2c, 0x05,
9  0x2b, 0x67, 0x9a, 0x76, 0x2a, 0xbe, 0x04, 0xc3, 0xaa, 0x44, 0x13, 0x26, 0x49, 0x86, 0x06, 0x99,
10  0x9c, 0x42, 0x50, 0xf4, 0x91, 0xef, 0x98, 0x7a, 0x33, 0x54, 0x0b, 0x43, 0xed, 0xcf, 0xac, 0x62,
11  0xe4, 0xb3, 0x1c, 0xa9, 0xc9, 0x08, 0xe8, 0x95, 0x80, 0xdf, 0x94, 0xfa, 0x75, 0x8f, 0x3f, 0xa6,
12  0x47, 0x07, 0xa7, 0xfc, 0xf3, 0x73, 0x17, 0xba, 0x83, 0x59, 0x3c, 0x19, 0xe6, 0x85, 0x4f, 0xa8,
13  0x68, 0x6b, 0x81, 0xb2, 0x71, 0x64, 0xda, 0x8b, 0xf8, 0xeb, 0x0f, 0x4b, 0x70, 0x56, 0x9d, 0x35,
14  0x1e, 0x24, 0x0e, 0x5e, 0x63, 0x58, 0xd1, 0xa2, 0x25, 0x22, 0x7c, 0x3b, 0x01, 0x21, 0x78, 0x87,
15  0xd4, 0x00, 0x46, 0x57, 0x9f, 0xd3, 0x27, 0x52, 0x4c, 0x36, 0x02, 0xe7, 0xa0, 0xc4, 0xc8, 0x9e,
16  0xea, 0xbf, 0x8a, 0xd2, 0x40, 0xc7, 0x38, 0xb5, 0xa3, 0xf7, 0xf2, 0xce, 0xf9, 0x61, 0x15, 0xa1,
17  0xe0, 0xae, 0x5d, 0xa4, 0x9b, 0x34, 0x1a, 0x55, 0xad, 0x93, 0x32, 0x30, 0xf5, 0x8c, 0xb1, 0xe3,
18  0x1d, 0xf6, 0xe2, 0x2e, 0x82, 0x66, 0xca, 0x60, 0xc0, 0x29, 0x23, 0xab, 0x0d, 0x53, 0x4e, 0x6f,
19  0xd5, 0xdb, 0x37, 0x45, 0xde, 0xfd, 0x8e, 0x2f, 0x03, 0xff, 0x6a, 0x72, 0x6d, 0x6c, 0x5b, 0x51,
20  0x8d, 0x1b, 0xaf, 0x92, 0xbb, 0xdd, 0xbc, 0x7f, 0x11, 0xd9, 0x5c, 0x41, 0x1f, 0x10, 0x5a, 0xd8,
21  0x0a, 0xc1, 0x31, 0x88, 0xa5, 0xcd, 0x7b, 0xbd, 0x2d, 0x74, 0xd0, 0x12, 0xb8, 0xe5, 0xb4, 0xb0,
22  0x89, 0x69, 0x97, 0x4a, 0x0c, 0x96, 0x77, 0x7e, 0x65, 0xb9, 0xf1, 0x09, 0xc5, 0x6e, 0xc6, 0x84,
23  0x18, 0xf0, 0x7d, 0xec, 0x3a, 0xdc, 0x4d, 0x20, 0x79, 0xee, 0x5f, 0x3e, 0xd7, 0xcb, 0x39, 0x48
24]
25
26const CK = [
27  0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269,
28  0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
29  0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249,
30  0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
31  0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229,
32  0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
33  0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209,
34  0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279
35]
36
37/**
38 * 16 进制串转字节数组
39 */
40function hexToArray(str) {
41  const arr = []
42  for (let i = 0, len = str.length; i < len; i += 2) {
43    arr.push(parseInt(str.substr(i, 2), 16))
44  }
45  return arr
46}
47
48/**
49 * 字节数组转 16 进制串
50 */
51// function ArrayToHex(arr) {
52//   return arr.map(item => {
53//     item = item.toString(16)
54//     return item.length === 1 ? '0' + item : item
55//   }).join('')
56// }
57
58/**
59 * utf8 串转字节数组
60 */
61function utf8ToArray(str) {
62  const arr = []
63
64  for (let i = 0, len = str.length; i < len; i++) {
65    const point = str.codePointAt(i)
66
67    if (point <= 0x007f) {
68      // 单字节,标量值:00000000 00000000 0zzzzzzz
69      arr.push(point)
70    } else if (point <= 0x07ff) {
71      // 双字节,标量值:00000000 00000yyy yyzzzzzz
72      arr.push(0xc0 | (point >>> 6)) // 110yyyyy(0xc0-0xdf)
73      arr.push(0x80 | (point & 0x3f)) // 10zzzzzz(0x80-0xbf)
74    } else if (point <= 0xD7FF || (point >= 0xE000 && point <= 0xFFFF)) {
75      // 三字节:标量值:00000000 xxxxyyyy yyzzzzzz
76      arr.push(0xe0 | (point >>> 12)) // 1110xxxx(0xe0-0xef)
77      arr.push(0x80 | ((point >>> 6) & 0x3f)) // 10yyyyyy(0x80-0xbf)
78      arr.push(0x80 | (point & 0x3f)) // 10zzzzzz(0x80-0xbf)
79    } else if (point >= 0x010000 && point <= 0x10FFFF) {
80      // 四字节:标量值:000wwwxx xxxxyyyy yyzzzzzz
81      i++
82      arr.push((0xf0 | (point >>> 18) & 0x1c)) // 11110www(0xf0-0xf7)
83      arr.push((0x80 | ((point >>> 12) & 0x3f))) // 10xxxxxx(0x80-0xbf)
84      arr.push((0x80 | ((point >>> 6) & 0x3f))) // 10yyyyyy(0x80-0xbf)
85      arr.push((0x80 | (point & 0x3f))) // 10zzzzzz(0x80-0xbf)
86    } else {
87      // 五、六字节,暂时不支持
88      arr.push(point)
89      throw new Error('input is not supported')
90    }
91  }
92
93  return arr
94}
95
96/**
97 * 字节数组转 utf8 串
98 */
99function arrayToUtf8(arr) {
100  const str = []
101  for (let i = 0, len = arr.length; i < len; i++) {
102    if (arr[i] >= 0xf0 && arr[i] <= 0xf7) {
103      // 四字节
104      str.push(String.fromCodePoint(((arr[i] & 0x07) << 18) + ((arr[i + 1] & 0x3f) << 12) + ((arr[i + 2] & 0x3f) << 6) + (arr[i + 3] & 0x3f)))
105      i += 3
106    } else if (arr[i] >= 0xe0 && arr[i] <= 0xef) {
107      // 三字节
108      str.push(String.fromCodePoint(((arr[i] & 0x0f) << 12) + ((arr[i + 1] & 0x3f) << 6) + (arr[i + 2] & 0x3f)))
109      i += 2
110    } else if (arr[i] >= 0xc0 && arr[i] <= 0xdf) {
111      // 双字节
112      str.push(String.fromCodePoint(((arr[i] & 0x1f) << 6) + (arr[i + 1] & 0x3f)))
113      i++
114    } else {
115      // 单字节
116      str.push(String.fromCodePoint(arr[i]))
117    }
118  }
119
120  return str.join('')
121}
122
123/**
124 * 32 比特循环左移
125 */
126function rotl(x, y) {
127  return x << y | x >>> (32 - y)
128}
129
130/**
131 * 非线性变换
132 */
133function byteSub(a) {
134  return (Sbox[a >>> 24 & 0xFF] & 0xFF) << 24 |
135    (Sbox[a >>> 16 & 0xFF] & 0xFF) << 16 |
136    (Sbox[a >>> 8 & 0xFF] & 0xFF) << 8 |
137    (Sbox[a & 0xFF] & 0xFF)
138}
139
140/**
141 * 线性变换,加密/解密用
142 */
143function l1(b) {
144  return b ^ rotl(b, 2) ^ rotl(b, 10) ^ rotl(b, 18) ^ rotl(b, 24)
145}
146
147/**
148 * 线性变换,生成轮密钥用
149 */
150function l2(b) {
151  return b ^ rotl(b, 13) ^ rotl(b, 23)
152}
153
154/**
155 * 以一组 128 比特进行加密/解密操作
156 */
157function sms4Crypt(input, output, roundKey) {
158  const x = new Array(4)
159
160  // 字节数组转成字数组(此处 1 字 = 32 比特)
161  const tmp = new Array(4)
162  for (let i = 0; i < 4; i++) {
163    tmp[0] = input[4 * i] & 0xff
164    tmp[1] = input[4 * i + 1] & 0xff
165    tmp[2] = input[4 * i + 2] & 0xff
166    tmp[3] = input[4 * i + 3] & 0xff
167    x[i] = tmp[0] << 24 | tmp[1] << 16 | tmp[2] << 8 | tmp[3]
168  }
169
170  // x[i + 4] = x[i] ^ l1(byteSub(x[i + 1] ^ x[i + 2] ^ x[i + 3] ^ roundKey[i]))
171  for (let r = 0, mid; r < 32; r += 4) {
172    mid = x[1] ^ x[2] ^ x[3] ^ roundKey[r + 0]
173    x[0] ^= l1(byteSub(mid)) // x[4]
174
175    mid = x[2] ^ x[3] ^ x[0] ^ roundKey[r + 1]
176    x[1] ^= l1(byteSub(mid)) // x[5]
177
178    mid = x[3] ^ x[0] ^ x[1] ^ roundKey[r + 2]
179    x[2] ^= l1(byteSub(mid)) // x[6]
180
181    mid = x[0] ^ x[1] ^ x[2] ^ roundKey[r + 3]
182    x[3] ^= l1(byteSub(mid)) // x[7]
183  }
184
185  // 反序变换
186  for (let j = 0; j < 16; j += 4) {
187    output[j] = x[3 - j / 4] >>> 24 & 0xff
188    output[j + 1] = x[3 - j / 4] >>> 16 & 0xff
189    output[j + 2] = x[3 - j / 4] >>> 8 & 0xff
190    output[j + 3] = x[3 - j / 4] & 0xff
191  }
192}
193
194/**
195 * 密钥扩展算法
196 */
197function sms4KeyExt(key, roundKey, cryptFlag) {
198  const x = new Array(4)
199
200  // 字节数组转成字数组(此处 1 字 = 32 比特)
201  const tmp = new Array(4)
202  for (let i = 0; i < 4; i++) {
203    tmp[0] = key[0 + 4 * i] & 0xff
204    tmp[1] = key[1 + 4 * i] & 0xff
205    tmp[2] = key[2 + 4 * i] & 0xff
206    tmp[3] = key[3 + 4 * i] & 0xff
207    x[i] = tmp[0] << 24 | tmp[1] << 16 | tmp[2] << 8 | tmp[3]
208  }
209
210  // 与系统参数做异或
211  x[0] ^= 0xa3b1bac6
212  x[1] ^= 0x56aa3350
213  x[2] ^= 0x677d9197
214  x[3] ^= 0xb27022dc
215
216  // roundKey[i] = x[i + 4] = x[i] ^ l2(byteSub(x[i + 1] ^ x[i + 2] ^ x[i + 3] ^ CK[i]))
217  for (let r = 0, mid; r < 32; r += 4) {
218    mid = x[1] ^ x[2] ^ x[3] ^ CK[r + 0]
219    roundKey[r + 0] = x[0] ^= l2(byteSub(mid)) // x[4]
220
221    mid = x[2] ^ x[3] ^ x[0] ^ CK[r + 1]
222    roundKey[r + 1] = x[1] ^= l2(byteSub(mid)) // x[5]
223
224    mid = x[3] ^ x[0] ^ x[1] ^ CK[r + 2]
225    roundKey[r + 2] = x[2] ^= l2(byteSub(mid)) // x[6]
226
227    mid = x[0] ^ x[1] ^ x[2] ^ CK[r + 3]
228    roundKey[r + 3] = x[3] ^= l2(byteSub(mid)) // x[7]
229  }
230
231  // 解密时使用反序的轮密钥
232  if (cryptFlag === DECRYPT) {
233    for (let r = 0, mid; r < 16; r++) {
234      mid = roundKey[r]
235      roundKey[r] = roundKey[31 - r]
236      roundKey[31 - r] = mid
237    }
238  }
239}
240
241function sm4(inArray, key, cryptFlag, {
242  padding = 'pkcs#7', mode, iv = [], output = 'string'
243} = {}) {
244  if (mode === 'cbc') {
245    // CBC 模式,默认走 ECB 模式
246    if (typeof iv === 'string') iv = hexToArray(iv)
247    if (iv.length !== (128 / 8)) {
248      // iv 不是 128 比特
249      throw new Error('iv is invalid')
250    }
251  }
252
253  // 检查 key
254  if (typeof key === 'string') key = hexToArray(key)
255  if (key.length !== (128 / 8)) {
256    // key 不是 128 比特
257    throw new Error('key is invalid')
258  }
259
260  // 检查输入
261  if (typeof inArray === 'string') {
262    if (cryptFlag !== DECRYPT) {
263      // 加密,输入为 utf8 串
264      inArray = utf8ToArray(inArray)
265    } else {
266      // 解密,输入为 16 进制串
267      inArray = hexToArray(inArray)
268    }
269  } else {
270    inArray = [...inArray]
271  }
272
273  // 新增填充,sm4 是 16 个字节一个分组,所以统一走到 pkcs#7
274  if ((padding === 'pkcs#5' || padding === 'pkcs#7') && cryptFlag !== DECRYPT) {
275    const paddingCount = BLOCK - inArray.length % BLOCK
276    for (let i = 0; i < paddingCount; i++) inArray.push(paddingCount)
277  }
278
279  // 生成轮密钥
280  const roundKey = new Array(ROUND)
281  sms4KeyExt(key, roundKey, cryptFlag)
282
283  const outArray = []
284  let lastVector = iv
285  let restLen = inArray.length
286  let point = 0
287  while (restLen >= BLOCK) {
288    const input = inArray.slice(point, point + 16)
289    const output = new Array(16)
290
291    if (mode === 'cbc') {
292      for (let i = 0; i < BLOCK; i++) {
293        if (cryptFlag !== DECRYPT) {
294          // 加密过程在组加密前进行异或
295          input[i] ^= lastVector[i]
296        }
297      }
298    }
299
300    sms4Crypt(input, output, roundKey)
301
302
303    for (let i = 0; i < BLOCK; i++) {
304      if (mode === 'cbc') {
305        if (cryptFlag === DECRYPT) {
306          // 解密过程在组解密后进行异或
307          output[i] ^= lastVector[i]
308        }
309      }
310
311      outArray[point + i] = output[i]
312    }
313
314    if (mode === 'cbc') {
315      if (cryptFlag !== DECRYPT) {
316        // 使用上一次输出作为加密向量
317        lastVector = output
318      } else {
319        // 使用上一次输入作为解密向量
320        lastVector = input
321      }
322    }
323
324    restLen -= BLOCK
325    point += BLOCK
326  }
327
328  // 去除填充,sm4 是 16 个字节一个分组,所以统一走到 pkcs#7
329  if ((padding === 'pkcs#5' || padding === 'pkcs#7') && cryptFlag === DECRYPT) {
330    const len = outArray.length
331    const paddingCount = outArray[len - 1]
332    for (let i = 1; i <= paddingCount; i++) {
333      if (outArray[len - i] !== paddingCount) throw new Error('padding is invalid')
334    }
335    outArray.splice(len - paddingCount, paddingCount)
336  }
337
338  // 调整输出
339  if (output !== 'array') {
340    if (cryptFlag !== DECRYPT) {
341      // 加密,输出转 16 进制串
342      // return ArrayToHex(outArray)
343    } else {
344      // 解密,输出转 utf8 串
345      return arrayToUtf8(outArray)
346    }
347  } else {
348    return outArray
349  }
350}
351
352
353  this.encrypt = function encrypt(inArray, key, options) {
354    return sm4(inArray, key, 1, options)
355  }
356  this.decrypt = function (inArray, key, options) {
357    return sm4(inArray, key, 0, options)
358  }
359}

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.