mima-kit
Version:
mima-kit is a cryptographic suite implemented in TypeScript. The goal is to provide an easy-to-use cryptographic library. mima-kit 是一个使用 TypeScript 实现的密码学套件。目标是提供一个简单易用的密码学库。
141 lines (140 loc) • 5.45 kB
JavaScript
import { createCipher } from '../../core/cipher';
import { KitError, rotateL32, U8 } from '../../core/utils';
// * Constants
const SBox = new Uint8Array([
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,
]);
const CK = new Uint32Array([
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,
]);
// * Functions
/**
* 非线性变换函数 `τ`.
*
* Nonlinear transformation function `τ`.
*
* @param {number} A - 工作字 / word
*/
function tau(A) {
return ((SBox[(A >> 24) & 0xff] << 24) | (SBox[(A >> 16) & 0xff] << 16) | (SBox[(A >> 8) & 0xff] << 8) | SBox[A & 0xff]);
}
/**
* 合成置换函数 `T`, 由非线性变换函数 `τ` 和线性变换函数 `L` 组成.
*
* Synthetic permutation function `T`, composed of function `τ` and function `L`.
*
* @param {number} A - 工作字 / word
*/
function T(A) {
const B = tau(A);
return B ^ rotateL32(B, 2) ^ rotateL32(B, 10) ^ rotateL32(B, 18) ^ rotateL32(B, 24);
}
/**
* 合成置换函数 `T1`, 由非线性变换函数 `τ` 和线性变换函数 `L1` 组成.
*
* Synthetic permutation function `T1`, composed of function `τ` and function `L1`.
*
* @param {number} A - 工作字 / word
*/
function T1(A) {
const B = tau(A);
return B ^ rotateL32(B, 13) ^ rotateL32(B, 23);
}
/**
* 密钥扩展函数 / Key expansion function
*/
function expandKey(key) {
if (key.length !== 16) {
throw new KitError('SM4 key must be 16 byte');
}
const KView = new DataView(key.buffer, key.byteOffset, key.byteLength);
let K0 = 0xa3b1bac6 ^ KView.getUint32(0, false);
let K1 = 0x56aa3350 ^ KView.getUint32(4, false);
let K2 = 0x677d9197 ^ KView.getUint32(8, false);
let K3 = 0xb27022dc ^ KView.getUint32(12, false);
const rk = new Uint32Array(32);
for (let i = 0; i < 32; i++) {
rk[i] = K0 ^ T1(K1 ^ K2 ^ K3 ^ CK[i]);
K0 = K1;
K1 = K2;
K2 = K3;
K3 = rk[i];
}
return rk;
}
/**
* 轮函数 `F` / Round function `F`
*
* @param {number} X0 - 工作字 / word
* @param {number} X1 - 工作字 / word
* @param {number} X2 - 工作字 / word
* @param {number} X3 - 工作字 / word
* @param {number} rk - 轮密钥 / round key
*/
function F(X0, X1, X2, X3, rk) {
return X0 ^ T(X1 ^ X2 ^ X3 ^ rk);
}
// * SM4 Algorithm
/**
* @param {Uint8Array} M - 输入块 / input block
* @param {Uint32Array} rk - 轮密钥 / round keys
*/
function cipher(M, rk) {
if (M.length !== 16) {
throw new KitError('SM4 block must be 16 byte');
}
const MView = new DataView(M.buffer, M.byteOffset, M.byteLength);
let X0 = MView.getUint32(0, false);
let X1 = MView.getUint32(4, false);
let X2 = MView.getUint32(8, false);
let X3 = MView.getUint32(12, false);
let X_;
for (let i = 0; i < 32; i++) {
X_ = F(X0, X1, X2, X3, rk[i]);
X0 = X1;
X1 = X2;
X2 = X3;
X3 = X_;
}
const R = new U8(16);
const RView = new DataView(R.buffer, R.byteOffset, R.byteLength);
RView.setUint32(0, X3, false);
RView.setUint32(4, X2, false);
RView.setUint32(8, X1, false);
RView.setUint32(12, X0, false);
return R;
}
function _sm4(K) {
const rk = expandKey(K);
const rkReversed = rk.toReversed();
return {
encrypt: (M) => cipher(M, rk),
decrypt: (M) => cipher(M, rkReversed),
};
}
/**
* SM4 分组密码算法 / block cipher algorithm
*/
export const sm4 = createCipher(_sm4, {
ALGORITHM: 'SM4',
BLOCK_SIZE: 16,
KEY_SIZE: 16,
MIN_KEY_SIZE: 16,
MAX_KEY_SIZE: 16,
});