Du kan inte välja fler än 25 ämnen Ämnen måste starta med en bokstav eller siffra, kan innehålla bindestreck ('-') och vara max 35 tecken långa.

sm4.js 11KB

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