@lambo-design/shared 1.0.0-beta.237 → 1.0.0-beta.239

package/utils/crypto/sm3.js

@@ -1,235 +1,235 @@
-/**
- * 左补0到指定长度
- */
-function leftPad(input, num) {
-  if (input.length >= num) return input;
-
-  return (new Array(num - input.length + 1)).join('0') + input
-}
-
-/**
- * 二进制转化为十六进制
- */
-function binary2hex(binary) {
-  const binaryLength = 8;
-  let hex = '';
-  for (let i = 0; i < binary.length / binaryLength; i++) {
-    hex += leftPad(parseInt(binary.substr(i * binaryLength, binaryLength), 2).toString(16), 2);
-  }
-  return hex;
-}
-
-/**
- * 十六进制转化为二进制
- */
-function hex2binary(hex) {
-  const hexLength = 2;
-  let binary = '';
-  for (let i = 0; i < hex.length / hexLength; i++) {
-    binary += leftPad(parseInt(hex.substr(i * hexLength, hexLength), 16).toString(2), 8);
-  }
-  return binary;
-}
-
-/**
- * 普通字符串转化为二进制
- */
-function str2binary(str) {
-  let binary = '';
-  for (const ch of str) {
-    binary += leftPad(ch.codePointAt(0).toString(2), 8);
-  }
-  return binary;
-}
-
-/**
- * 循环左移
- */
-function rol(str, n) {
-  return str.substring(n % str.length) + str.substr(0, n % str.length);
-}
-
-/**
- * 二进制运算
- */
-function binaryCal(x, y, method) {
-  const a = x || '';
-  const b = y || '';
-  const result = [];
-  let prevResult;
-
-  for (let i = a.length - 1; i >= 0; i--) { // 大端
-    prevResult = method(a[i], b[i], prevResult);
-    result[i] = prevResult[0];
-  }
-  return result.join('');
-}
-
-/**
- * 二进制异或运算
- */
-function xor(x, y) {
-  return binaryCal(x, y, (a, b) => [(a === b ? '0' : '1')]);
-}
-
-/**
- * 二进制与运算
- */
-function and(x, y) {
-  return binaryCal(x, y, (a, b) => [(a === '1' && b === '1' ? '1' : '0')]);
-}
-
-/**
- * 二进制或运算
- */
-function or(x, y) {
-  return binaryCal(x, y, (a, b) => [(a === '1' || b === '1' ? '1' : '0')]); // a === '0' && b === '0' ? '0' : '1'
-}
-
-/**
- * 二进制与运算
- */
-function add(x, y) {
-  const result = binaryCal(x, y, (a, b, prevResult) => {
-    const carry = prevResult ? prevResult[1] : '0' || '0';
-
-    // a,b不等时,carry不变，结果与carry相反
-    // a,b相等时，结果等于原carry，新carry等于a
-    if (a !== b) return [carry === '0' ? '1' : '0', carry];
-
-    return [carry, a];
-  });
-
-  return result;
-}
-
-/**
- * 二进制非运算
- */
-function not(x) {
-  return binaryCal(x, undefined, a => [a === '1' ? '0' : '1']);
-}
-
-function calMulti(method) {
-  return (...arr) => arr.reduce((prev, curr) => method(prev, curr));
-}
-
-/**
- * 压缩函数中的置换函数 P1(X) = X xor (X <<< 9) xor (X <<< 17)
- */
-function P0(X) {
-  return calMulti(xor)(X, rol(X, 9), rol(X, 17));
-}
-
-/**
- * 消息扩展中的置换函数 P1(X) = X xor (X <<< 15) xor (X <<< 23)
- */
-function P1(X) {
-  return calMulti(xor)(X, rol(X, 15), rol(X, 23));
-}
-
-function FF(X, Y, Z, j) {
-  return j >= 0 && j <= 15 ? calMulti(xor)(X, Y, Z) : calMulti(or)(and(X, Y), and(X, Z), and(Y, Z));
-}
-
-function GG(X, Y, Z, j) {
-  return j >= 0 && j <= 15 ? calMulti(xor)(X, Y, Z) : or(and(X, Y), and(not(X), Z));
-}
-
-function T(j) {
-  return j >= 0 && j <= 15 ? hex2binary('79cc4519') : hex2binary('7a879d8a');
-}
-
-/**
- * 压缩函数
- */
-function CF(V, Bi) {
-  // 消息扩展
-  const wordLength = 32;
-  const W = [];
-  const M = []; // W'
-
-  // 将消息分组B划分为16个字W0， W1，…… ，W15 （字为长度为32的比特串）
-  for (let i = 0; i < 16; i++) {
-    W.push(Bi.substr(i * wordLength, wordLength));
-  }
-
-  // W[j] <- P1(W[j−16] xor W[j−9] xor (W[j−3] <<< 15)) xor (W[j−13] <<< 7) xor W[j−6]
-  for (let j = 16; j < 68; j++) {
-    W.push(calMulti(xor)(
-      P1(calMulti(xor)(W[j - 16], W[j - 9], rol(W[j - 3], 15))),
-      rol(W[j - 13], 7),
-      W[j - 6]
-    ));
-  }
-
-  // W′[j] = W[j] xor W[j+4]
-  for (let j = 0; j < 64; j++) {
-    M.push(xor(W[j], W[j + 4]));
-  }
-
-  // 压缩
-  const wordRegister = []; // 字寄存器
-  for (let j = 0; j < 8; j++) {
-    wordRegister.push(V.substr(j * wordLength, wordLength));
-  }
-
-  let A = wordRegister[0];
-  let B = wordRegister[1];
-  let C = wordRegister[2];
-  let D = wordRegister[3];
-  let E = wordRegister[4];
-  let F = wordRegister[5];
-  let G = wordRegister[6];
-  let H = wordRegister[7];
-
-  // 中间变量
-  let SS1;
-  let SS2;
-  let TT1;
-  let TT2;
-  for (let j = 0; j < 64; j++) {
-    SS1 = rol(calMulti(add)(rol(A, 12), E, rol(T(j), j)), 7);
-    SS2 = xor(SS1, rol(A, 12));
-
-    TT1 = calMulti(add)(FF(A, B, C, j), D, SS2, M[j]);
-    TT2 = calMulti(add)(GG(E, F, G, j), H, SS1, W[j]);
-
-    D = C;
-    C = rol(B, 9);
-    B = A;
-    A = TT1;
-    H = G;
-    G = rol(F, 19);
-    F = E;
-    E = P0(TT2);
-  }
-
-  return xor([A, B, C, D, E, F, G, H].join(''), V);
-}
-
-function sm3(str) {
-  const binary = str2binary(str);
-
-  // 填充
-  const len = binary.length;
-
-  // k是满足len + 1 + k = 448mod512的最小的非负整数
-  let k = len % 512;
-
-  // 如果 448 <= (512 % len) < 512，需要多补充 (len % 448) 比特'0'以满足总比特长度为512的倍数
-  k = k >= 448 ? 512 - (k % 448) - 1 : 448 - k - 1;
-
-  const m = `${binary}1${leftPad('', k)}${leftPad(len.toString(2), 64)}`.toString(); // k个0
-
-  // 迭代压缩
-  const n = (len + k + 65) / 512;
-
-  let V = hex2binary('7380166f4914b2b9172442d7da8a0600a96f30bc163138aae38dee4db0fb0e4e');
-  for (let i = 0; i <= n - 1; i++) {
-    const B = m.substr(512 * i, 512);
-    V = CF(V, B);
-  }
-  return binary2hex(V);
-};
-export default sm3;
+/**
+ * 左补0到指定长度
+ */
+function leftPad(input, num) {
+  if (input.length >= num) return input;
+
+  return (new Array(num - input.length + 1)).join('0') + input
+}
+
+/**
+ * 二进制转化为十六进制
+ */
+function binary2hex(binary) {
+  const binaryLength = 8;
+  let hex = '';
+  for (let i = 0; i < binary.length / binaryLength; i++) {
+    hex += leftPad(parseInt(binary.substr(i * binaryLength, binaryLength), 2).toString(16), 2);
+  }
+  return hex;
+}
+
+/**
+ * 十六进制转化为二进制
+ */
+function hex2binary(hex) {
+  const hexLength = 2;
+  let binary = '';
+  for (let i = 0; i < hex.length / hexLength; i++) {
+    binary += leftPad(parseInt(hex.substr(i * hexLength, hexLength), 16).toString(2), 8);
+  }
+  return binary;
+}
+
+/**
+ * 普通字符串转化为二进制
+ */
+function str2binary(str) {
+  let binary = '';
+  for (const ch of str) {
+    binary += leftPad(ch.codePointAt(0).toString(2), 8);
+  }
+  return binary;
+}
+
+/**
+ * 循环左移
+ */
+function rol(str, n) {
+  return str.substring(n % str.length) + str.substr(0, n % str.length);
+}
+
+/**
+ * 二进制运算
+ */
+function binaryCal(x, y, method) {
+  const a = x || '';
+  const b = y || '';
+  const result = [];
+  let prevResult;
+
+  for (let i = a.length - 1; i >= 0; i--) { // 大端
+    prevResult = method(a[i], b[i], prevResult);
+    result[i] = prevResult[0];
+  }
+  return result.join('');
+}
+
+/**
+ * 二进制异或运算
+ */
+function xor(x, y) {
+  return binaryCal(x, y, (a, b) => [(a === b ? '0' : '1')]);
+}
+
+/**
+ * 二进制与运算
+ */
+function and(x, y) {
+  return binaryCal(x, y, (a, b) => [(a === '1' && b === '1' ? '1' : '0')]);
+}
+
+/**
+ * 二进制或运算
+ */
+function or(x, y) {
+  return binaryCal(x, y, (a, b) => [(a === '1' || b === '1' ? '1' : '0')]); // a === '0' && b === '0' ? '0' : '1'
+}
+
+/**
+ * 二进制与运算
+ */
+function add(x, y) {
+  const result = binaryCal(x, y, (a, b, prevResult) => {
+    const carry = prevResult ? prevResult[1] : '0' || '0';
+
+    // a,b不等时,carry不变，结果与carry相反
+    // a,b相等时，结果等于原carry，新carry等于a
+    if (a !== b) return [carry === '0' ? '1' : '0', carry];
+
+    return [carry, a];
+  });
+
+  return result;
+}
+
+/**
+ * 二进制非运算
+ */
+function not(x) {
+  return binaryCal(x, undefined, a => [a === '1' ? '0' : '1']);
+}
+
+function calMulti(method) {
+  return (...arr) => arr.reduce((prev, curr) => method(prev, curr));
+}
+
+/**
+ * 压缩函数中的置换函数 P1(X) = X xor (X <<< 9) xor (X <<< 17)
+ */
+function P0(X) {
+  return calMulti(xor)(X, rol(X, 9), rol(X, 17));
+}
+
+/**
+ * 消息扩展中的置换函数 P1(X) = X xor (X <<< 15) xor (X <<< 23)
+ */
+function P1(X) {
+  return calMulti(xor)(X, rol(X, 15), rol(X, 23));
+}
+
+function FF(X, Y, Z, j) {
+  return j >= 0 && j <= 15 ? calMulti(xor)(X, Y, Z) : calMulti(or)(and(X, Y), and(X, Z), and(Y, Z));
+}
+
+function GG(X, Y, Z, j) {
+  return j >= 0 && j <= 15 ? calMulti(xor)(X, Y, Z) : or(and(X, Y), and(not(X), Z));
+}
+
+function T(j) {
+  return j >= 0 && j <= 15 ? hex2binary('79cc4519') : hex2binary('7a879d8a');
+}
+
+/**
+ * 压缩函数
+ */
+function CF(V, Bi) {
+  // 消息扩展
+  const wordLength = 32;
+  const W = [];
+  const M = []; // W'
+
+  // 将消息分组B划分为16个字W0， W1，…… ，W15 （字为长度为32的比特串）
+  for (let i = 0; i < 16; i++) {
+    W.push(Bi.substr(i * wordLength, wordLength));
+  }
+
+  // W[j] <- P1(W[j−16] xor W[j−9] xor (W[j−3] <<< 15)) xor (W[j−13] <<< 7) xor W[j−6]
+  for (let j = 16; j < 68; j++) {
+    W.push(calMulti(xor)(
+      P1(calMulti(xor)(W[j - 16], W[j - 9], rol(W[j - 3], 15))),
+      rol(W[j - 13], 7),
+      W[j - 6]
+    ));
+  }
+
+  // W′[j] = W[j] xor W[j+4]
+  for (let j = 0; j < 64; j++) {
+    M.push(xor(W[j], W[j + 4]));
+  }
+
+  // 压缩
+  const wordRegister = []; // 字寄存器
+  for (let j = 0; j < 8; j++) {
+    wordRegister.push(V.substr(j * wordLength, wordLength));
+  }
+
+  let A = wordRegister[0];
+  let B = wordRegister[1];
+  let C = wordRegister[2];
+  let D = wordRegister[3];
+  let E = wordRegister[4];
+  let F = wordRegister[5];
+  let G = wordRegister[6];
+  let H = wordRegister[7];
+
+  // 中间变量
+  let SS1;
+  let SS2;
+  let TT1;
+  let TT2;
+  for (let j = 0; j < 64; j++) {
+    SS1 = rol(calMulti(add)(rol(A, 12), E, rol(T(j), j)), 7);
+    SS2 = xor(SS1, rol(A, 12));
+
+    TT1 = calMulti(add)(FF(A, B, C, j), D, SS2, M[j]);
+    TT2 = calMulti(add)(GG(E, F, G, j), H, SS1, W[j]);
+
+    D = C;
+    C = rol(B, 9);
+    B = A;
+    A = TT1;
+    H = G;
+    G = rol(F, 19);
+    F = E;
+    E = P0(TT2);
+  }
+
+  return xor([A, B, C, D, E, F, G, H].join(''), V);
+}
+
+function sm3(str) {
+  const binary = str2binary(str);
+
+  // 填充
+  const len = binary.length;
+
+  // k是满足len + 1 + k = 448mod512的最小的非负整数
+  let k = len % 512;
+
+  // 如果 448 <= (512 % len) < 512，需要多补充 (len % 448) 比特'0'以满足总比特长度为512的倍数
+  k = k >= 448 ? 512 - (k % 448) - 1 : 448 - k - 1;
+
+  const m = `${binary}1${leftPad('', k)}${leftPad(len.toString(2), 64)}`.toString(); // k个0
+
+  // 迭代压缩
+  const n = (len + k + 65) / 512;
+
+  let V = hex2binary('7380166f4914b2b9172442d7da8a0600a96f30bc163138aae38dee4db0fb0e4e');
+  for (let i = 0; i <= n - 1; i++) {
+    const B = m.substr(512 * i, 512);
+    V = CF(V, B);
+  }
+  return binary2hex(V);
+};
+export default sm3;