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 实现的密码学套件。目标是提供一个简单易用的密码学库。
235 lines (234 loc) • 9.38 kB
JavaScript
import { createCipher } from '../../core/cipher';
import { KitError, U8 } from '../../core/utils';
// * Constants
const SBox = new Uint8Array([
0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, 0xca, 0x82, 0xc9,
0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, 0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f,
0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, 0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07,
0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, 0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3,
0x29, 0xe3, 0x2f, 0x84, 0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58,
0xcf, 0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, 0x51, 0xa3,
0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, 0xcd, 0x0c, 0x13, 0xec, 0x5f,
0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, 0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, 0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac,
0x62, 0x91, 0x95, 0xe4, 0x79, 0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a,
0xae, 0x08, 0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, 0x70,
0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, 0xe1, 0xf8, 0x98, 0x11,
0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, 0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42,
0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16,
]);
const InvSBox = new Uint8Array([
0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb, 0x7c, 0xe3, 0x39,
0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb, 0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2,
0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e, 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76,
0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25, 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc,
0x5d, 0x65, 0xb6, 0x92, 0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d,
0x84, 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06, 0xd0, 0x2c,
0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b, 0x3a, 0x91, 0x11, 0x41, 0x4f,
0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73, 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85,
0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e, 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62,
0x0e, 0xaa, 0x18, 0xbe, 0x1b, 0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd,
0x5a, 0xf4, 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f, 0x60,
0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef, 0xa0, 0xe0, 0x3b, 0x4d,
0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61, 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6,
0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d,
]);
const ROUND = [0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
// * Functions
function GFMultiply(a, b) {
let p = 0;
if (b === 1)
return a;
for (let i = 0; i < 8; i++) {
if (b & 1)
p ^= a;
const carry = a & 0x80;
a <<= 1;
// 0x1B 是不可约多项式 x^8 + x^4 + x^3 + x + 1 的低 8 位
if (carry)
a ^= 0x1b;
b >>= 1;
}
return p & 0xff;
}
function KeyExpansion(K, Nr) {
const Nk = K.byteLength >> 2;
const W = new Uint8Array((Nr + 1) << 4);
W.set(K);
let current = 0;
for (let i = Nk; i < (Nr + 1) << 2; i++) {
const i_1 = (i - 1) << 2;
const temp = W.slice(i_1, i_1 + 4);
if (i % Nk === 0) {
const t0 = temp[0];
temp[0] = SBox[temp[1]] ^ ROUND[current];
temp[1] = SBox[temp[2]];
temp[2] = SBox[temp[3]];
temp[3] = SBox[t0];
current++;
}
else if (Nk > 6 && i % Nk === 4) {
temp[0] = SBox[temp[0]];
temp[1] = SBox[temp[1]];
temp[2] = SBox[temp[2]];
temp[3] = SBox[temp[3]];
}
const i_Nk = (i - Nk) << 2;
const Wi_NK = W.subarray(i_Nk, i_Nk + 4);
for (let j = 0; j < 4; j++) {
temp[j] ^= Wi_NK[j];
}
W.set(temp, i << 2);
}
return W;
}
// * AES Algorithm
function Cipher(M, W, Nr) {
if (M.byteLength !== 16) {
throw new KitError(`AES block must be 16 byte`);
}
const S = U8.from(M);
const AddRoundKey = (W) => {
for (let i = 0; i < S.byteLength; i++) {
S[i] ^= W[i];
}
};
const SubBytes = () => {
for (let i = 0; i < S.byteLength; i++) {
S[i] = SBox[S[i]];
}
};
const ShiftRows = () => {
const S1 = S[1];
S[1] = S[5];
S[5] = S[9];
S[9] = S[13];
S[13] = S1;
const S2 = S[2];
const S6 = S[6];
S[2] = S[10];
S[6] = S[14];
S[10] = S2;
S[14] = S6;
const S15 = S[15];
S[15] = S[11];
S[11] = S[7];
S[7] = S[3];
S[3] = S15;
};
const MixColumn = () => {
for (let i = 0; i < 4; i++) {
const s0 = S[i << 2];
const s1 = S[(i << 2) + 1];
const s2 = S[(i << 2) + 2];
const s3 = S[(i << 2) + 3];
const t0 = GFMultiply(s0, 0x02) ^ GFMultiply(s1, 0x03) ^ GFMultiply(s2, 0x01) ^ GFMultiply(s3, 0x01);
const t1 = GFMultiply(s0, 0x01) ^ GFMultiply(s1, 0x02) ^ GFMultiply(s2, 0x03) ^ GFMultiply(s3, 0x01);
const t2 = GFMultiply(s0, 0x01) ^ GFMultiply(s1, 0x01) ^ GFMultiply(s2, 0x02) ^ GFMultiply(s3, 0x03);
const t3 = GFMultiply(s0, 0x03) ^ GFMultiply(s1, 0x01) ^ GFMultiply(s2, 0x01) ^ GFMultiply(s3, 0x02);
S[i << 2] = t0;
S[(i << 2) + 1] = t1;
S[(i << 2) + 2] = t2;
S[(i << 2) + 3] = t3;
}
};
AddRoundKey(W.subarray(0, 16));
for (let i = 1; i < Nr; i++) {
SubBytes();
ShiftRows();
MixColumn();
AddRoundKey(W.subarray(i << 4, (i + 1) << 4));
}
SubBytes();
ShiftRows();
AddRoundKey(W.subarray(W.length - 16, W.length));
return S;
}
function InvCipher(M, W, Nr) {
if (M.byteLength !== 16) {
throw new KitError(`AES block must be 16 byte`);
}
const S = new U8(M.slice(0));
const AddRoundKey = (W) => {
for (let i = 0; i < S.byteLength; i++) {
S[i] ^= W[i];
}
};
const InvSubBytes = () => {
for (let i = 0; i < S.byteLength; i++) {
S[i] = InvSBox[S[i]];
}
};
const InvShiftRows = () => {
const S13 = S[13];
S[13] = S[9];
S[9] = S[5];
S[5] = S[1];
S[1] = S13;
const S2 = S[2];
const S6 = S[6];
S[2] = S[10];
S[6] = S[14];
S[10] = S2;
S[14] = S6;
const S3 = S[3];
S[3] = S[7];
S[7] = S[11];
S[11] = S[15];
S[15] = S3;
};
const InvMixColumn = () => {
for (let i = 0; i < 4; i++) {
const s0 = S[i << 2];
const s1 = S[(i << 2) + 1];
const s2 = S[(i << 2) + 2];
const s3 = S[(i << 2) + 3];
const t0 = GFMultiply(s0, 0x0e) ^ GFMultiply(s1, 0x0b) ^ GFMultiply(s2, 0x0d) ^ GFMultiply(s3, 0x09);
const t1 = GFMultiply(s0, 0x09) ^ GFMultiply(s1, 0x0e) ^ GFMultiply(s2, 0x0b) ^ GFMultiply(s3, 0x0d);
const t2 = GFMultiply(s0, 0x0d) ^ GFMultiply(s1, 0x09) ^ GFMultiply(s2, 0x0e) ^ GFMultiply(s3, 0x0b);
const t3 = GFMultiply(s0, 0x0b) ^ GFMultiply(s1, 0x0d) ^ GFMultiply(s2, 0x09) ^ GFMultiply(s3, 0x0e);
S[i << 2] = t0;
S[(i << 2) + 1] = t1;
S[(i << 2) + 2] = t2;
S[(i << 2) + 3] = t3;
}
};
AddRoundKey(W.subarray(W.length - 16, W.length));
for (let i = Nr - 1; i > 0; i--) {
InvShiftRows();
InvSubBytes();
AddRoundKey(W.subarray(i << 4, (i + 1) << 4));
InvMixColumn();
}
InvShiftRows();
InvSubBytes();
AddRoundKey(W.subarray(0, 16));
return S;
}
function _aes(K, b) {
if (K.byteLength !== b >> 3) {
throw new KitError(`AES key must be ${b >> 3} byte`);
}
const Nr = b === 128 ? 10 : b === 192 ? 12 : 14;
const W = KeyExpansion(K, Nr);
return {
encrypt: (M) => Cipher(M, W, Nr),
decrypt: (C) => InvCipher(C, W, Nr),
};
}
/**
* 高级加密标准 (AES) 分组密码算法
*
* Advanced Encryption Standard (AES) block cipher algorithm
*
* @param {128 | 192 | 256} b - 密钥长度 / Key size (bit)
*/
export function aes(b) {
return createCipher((K) => _aes(K, b), {
ALGORITHM: `AES-${b}`,
BLOCK_SIZE: 16,
KEY_SIZE: b >> 3,
MIN_KEY_SIZE: b >> 3,
MAX_KEY_SIZE: b >> 3,
});
}