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.58 kB
JavaScript
import { KitError, rotateL32, U8, wrap } from '../../core/utils';
// * Constants
const S0 = new Uint8Array([
0x3e, 0x72, 0x5b, 0x47, 0xca, 0xe0, 0x00, 0x33, 0x04, 0xd1, 0x54, 0x98, 0x09, 0xb9, 0x6d, 0xcb,
0x7b, 0x1b, 0xf9, 0x32, 0xaf, 0x9d, 0x6a, 0xa5, 0xb8, 0x2d, 0xfc, 0x1d, 0x08, 0x53, 0x03, 0x90,
0x4d, 0x4e, 0x84, 0x99, 0xe4, 0xce, 0xd9, 0x91, 0xdd, 0xb6, 0x85, 0x48, 0x8b, 0x29, 0x6e, 0xac,
0xcd, 0xc1, 0xf8, 0x1e, 0x73, 0x43, 0x69, 0xc6, 0xb5, 0xbd, 0xfd, 0x39, 0x63, 0x20, 0xd4, 0x38,
0x76, 0x7d, 0xb2, 0xa7, 0xcf, 0xed, 0x57, 0xc5, 0xf3, 0x2c, 0xbb, 0x14, 0x21, 0x06, 0x55, 0x9b,
0xe3, 0xef, 0x5e, 0x31, 0x4f, 0x7f, 0x5a, 0xa4, 0x0d, 0x82, 0x51, 0x49, 0x5f, 0xba, 0x58, 0x1c,
0x4a, 0x16, 0xd5, 0x17, 0xa8, 0x92, 0x24, 0x1f, 0x8c, 0xff, 0xd8, 0xae, 0x2e, 0x01, 0xd3, 0xad,
0x3b, 0x4b, 0xda, 0x46, 0xeb, 0xc9, 0xde, 0x9a, 0x8f, 0x87, 0xd7, 0x3a, 0x80, 0x6f, 0x2f, 0xc8,
0xb1, 0xb4, 0x37, 0xf7, 0x0a, 0x22, 0x13, 0x28, 0x7c, 0xcc, 0x3c, 0x89, 0xc7, 0xc3, 0x96, 0x56,
0x07, 0xbf, 0x7e, 0xf0, 0x0b, 0x2b, 0x97, 0x52, 0x35, 0x41, 0x79, 0x61, 0xa6, 0x4c, 0x10, 0xfe,
0xbc, 0x26, 0x95, 0x88, 0x8a, 0xb0, 0xa3, 0xfb, 0xc0, 0x18, 0x94, 0xf2, 0xe1, 0xe5, 0xe9, 0x5d,
0xd0, 0xdc, 0x11, 0x66, 0x64, 0x5c, 0xec, 0x59, 0x42, 0x75, 0x12, 0xf5, 0x74, 0x9c, 0xaa, 0x23,
0x0e, 0x86, 0xab, 0xbe, 0x2a, 0x02, 0xe7, 0x67, 0xe6, 0x44, 0xa2, 0x6c, 0xc2, 0x93, 0x9f, 0xf1,
0xf6, 0xfa, 0x36, 0xd2, 0x50, 0x68, 0x9e, 0x62, 0x71, 0x15, 0x3d, 0xd6, 0x40, 0xc4, 0xe2, 0x0f,
0x8e, 0x83, 0x77, 0x6b, 0x25, 0x05, 0x3f, 0x0c, 0x30, 0xea, 0x70, 0xb7, 0xa1, 0xe8, 0xa9, 0x65,
0x8d, 0x27, 0x1a, 0xdb, 0x81, 0xb3, 0xa0, 0xf4, 0x45, 0x7a, 0x19, 0xdf, 0xee, 0x78, 0x34, 0x60,
]);
const S1 = new Uint8Array([
0x55, 0xc2, 0x63, 0x71, 0x3b, 0xc8, 0x47, 0x86, 0x9f, 0x3c, 0xda, 0x5b, 0x29, 0xaa, 0xfd, 0x77,
0x8c, 0xc5, 0x94, 0x0c, 0xa6, 0x1a, 0x13, 0x00, 0xe3, 0xa8, 0x16, 0x72, 0x40, 0xf9, 0xf8, 0x42,
0x44, 0x26, 0x68, 0x96, 0x81, 0xd9, 0x45, 0x3e, 0x10, 0x76, 0xc6, 0xa7, 0x8b, 0x39, 0x43, 0xe1,
0x3a, 0xb5, 0x56, 0x2a, 0xc0, 0x6d, 0xb3, 0x05, 0x22, 0x66, 0xbf, 0xdc, 0x0b, 0xfa, 0x62, 0x48,
0xdd, 0x20, 0x11, 0x06, 0x36, 0xc9, 0xc1, 0xcf, 0xf6, 0x27, 0x52, 0xbb, 0x69, 0xf5, 0xd4, 0x87,
0x7f, 0x84, 0x4c, 0xd2, 0x9c, 0x57, 0xa4, 0xbc, 0x4f, 0x9a, 0xdf, 0xfe, 0xd6, 0x8d, 0x7a, 0xeb,
0x2b, 0x53, 0xd8, 0x5c, 0xa1, 0x14, 0x17, 0xfb, 0x23, 0xd5, 0x7d, 0x30, 0x67, 0x73, 0x08, 0x09,
0xee, 0xb7, 0x70, 0x3f, 0x61, 0xb2, 0x19, 0x8e, 0x4e, 0xe5, 0x4b, 0x93, 0x8f, 0x5d, 0xdb, 0xa9,
0xad, 0xf1, 0xae, 0x2e, 0xcb, 0x0d, 0xfc, 0xf4, 0x2d, 0x46, 0x6e, 0x1d, 0x97, 0xe8, 0xd1, 0xe9,
0x4d, 0x37, 0xa5, 0x75, 0x5e, 0x83, 0x9e, 0xab, 0x82, 0x9d, 0xb9, 0x1c, 0xe0, 0xcd, 0x49, 0x89,
0x01, 0xb6, 0xbd, 0x58, 0x24, 0xa2, 0x5f, 0x38, 0x78, 0x99, 0x15, 0x90, 0x50, 0xb8, 0x95, 0xe4,
0xd0, 0x91, 0xc7, 0xce, 0xed, 0x0f, 0xb4, 0x6f, 0xa0, 0xcc, 0xf0, 0x02, 0x4a, 0x79, 0xc3, 0xde,
0xa3, 0xef, 0xea, 0x51, 0xe6, 0x6b, 0x18, 0xec, 0x1b, 0x2c, 0x80, 0xf7, 0x74, 0xe7, 0xff, 0x21,
0x5a, 0x6a, 0x54, 0x1e, 0x41, 0x31, 0x92, 0x35, 0xc4, 0x33, 0x07, 0x0a, 0xba, 0x7e, 0x0e, 0x34,
0x88, 0xb1, 0x98, 0x7c, 0xf3, 0x3d, 0x60, 0x6c, 0x7b, 0xca, 0xd3, 0x1f, 0x32, 0x65, 0x04, 0x28,
0x64, 0xbe, 0x85, 0x9b, 0x2f, 0x59, 0x8a, 0xd7, 0xb0, 0x25, 0xac, 0xaf, 0x12, 0x03, 0xe2, 0xf2,
]);
const D = new Uint16Array([
0x44d7, 0x26bc, 0x626b, 0x135e, 0x5789, 0x35e2, 0x7135, 0x09af, 0x4d78, 0x2f13, 0x6bc4, 0x1af1,
0x5e26, 0x3c4d, 0x789a, 0x47ac,
]);
// * Functions
function mulPow2n(v, n) {
return ((v << n) | (v >>> (31 - n))) & 0x7fffffff;
}
function addMod31(a, b) {
const c = a + b;
return (c & 0x7fffffff) + (c >>> 31);
}
const L1 = (X) => X ^ rotateL32(X, 2) ^ rotateL32(X, 10) ^ rotateL32(X, 18) ^ rotateL32(X, 24);
const L2 = (X) => X ^ rotateL32(X, 8) ^ rotateL32(X, 14) ^ rotateL32(X, 22) ^ rotateL32(X, 30);
function BR(S, X) {
X[0] = ((S[15] & 0x7fff8000) << 1) | (S[14] & 0xffff);
X[1] = ((S[11] & 0x0000ffff) << 16) | (S[9] >>> 15);
X[2] = ((S[7] & 0x0000ffff) << 16) | (S[5] >>> 15);
X[3] = ((S[2] & 0x0000ffff) << 16) | (S[0] >>> 15);
}
function F(X0, X1, X2, R) {
const W = (X0 ^ R[0]) + R[1];
const W1 = (R[0] + X1) & 0xffffffff;
const W2 = R[1] ^ X2;
const r0 = L1((W1 << 16) | (W2 >>> 16));
R[0] =
(S0[r0 >>> 24] << 24) |
(S1[(r0 >>> 16) & 0xff] << 16) |
(S0[(r0 >>> 8) & 0xff] << 8) |
S1[r0 & 0xff];
const r1 = L2((W2 << 16) | (W1 >>> 16));
R[1] =
(S0[r1 >>> 24] << 24) |
(S1[(r1 >>> 16) & 0xff] << 16) |
(S0[(r1 >>> 8) & 0xff] << 8) |
S1[r1 & 0xff];
return W;
}
/**
* 线性反馈移位寄存器有两种运行模式：初始化模式和工作模式，当输入 `u` 时为初始化模式，否则为工作模式
*
* @param {Uint32Array} S - 线性反馈移位寄存器(LFSR)
* @param {number} u - 初始化模式下的输入
*/
function next(S, u) {
let s16, v;
s16 = S[0];
v = mulPow2n(S[0], 8);
s16 = addMod31(s16, v);
v = mulPow2n(S[4], 20);
s16 = addMod31(s16, v);
v = mulPow2n(S[10], 21);
s16 = addMod31(s16, v);
v = mulPow2n(S[13], 17);
s16 = addMod31(s16, v);
v = mulPow2n(S[15], 15);
s16 = addMod31(s16, v);
s16 = u ? addMod31(s16, u) : s16;
s16 = s16 || 0x7fffffff;
for (let i = 0; i < 15; i++) {
S[i] = S[i + 1];
}
S[15] = s16;
}
// * ZUC Algorithm (presudo-random generator)
/**
* 3GPP ZUC 算法用于生成密钥流，每次调用返回一个 32 位的密钥流.
*
* 3GPP ZUC algorithm is used to generate a key stream, each call returns a 32-bit key stream.
*
* ```ts
* const K = new Uint8Array(16)
* const iv = new Uint8Array(16)
* const prg = zuc(K, iv)
* prg() // 32-bit number
* ```
*/
export function zuc(K, iv) {
if (K.byteLength !== 16) {
throw new KitError('ZUC requires a key of 16 bytes');
}
if (iv.byteLength !== 16) {
throw new KitError('ZUC requires an IV of 16 bytes');
}
const LFSR = new Uint32Array(16);
const X = new Uint32Array(4);
const R = new Uint32Array(2);
(function init() {
for (let i = 0; i < 16; i++) {
LFSR[i] = (K[i] << 23) | (D[i] << 8) | iv[i];
}
for (let i = 0; i < 32; i++) {
BR(LFSR, X);
const W = F(X[0], X[1], X[2], R);
next(LFSR, W >>> 1);
}
BR(LFSR, X);
F(X[0], X[1], X[2], R);
next(LFSR);
})();
return () => {
BR(LFSR, X);
const W = F(X[0], X[1], X[2], R) ^ X[3];
next(LFSR);
return W;
};
}
// * EEA3 & EIA3
function createEEA_IV(count, bearer, direction) {
const iv = new Uint8Array(16);
iv.set(count, 0);
iv[4] = (bearer << 3) | (direction << 2);
iv.set(iv.subarray(0, 5), 8);
return iv;
}
function createEIA_IV(count, bearer, direction) {
const iv = new Uint8Array(16);
iv.set(count, 0);
iv[4] = bearer << 3;
iv.set(iv.subarray(0, 5), 8);
iv[8] ^= direction << 7;
iv[14] ^= direction << 7;
return iv;
}
function getWord(Z, bit_offset) {
const ti = bit_offset % 8;
const byte_offset = bit_offset >>> 3;
const W = ti === 0
? Z.getUint32(byte_offset, false)
: (Z.getUint32(byte_offset, false) << ti) |
(Z.getUint32(byte_offset + 4, false) >>> (32 - ti));
return W & 0xffffffff;
}
/**
* 3GPP ZUC 加密算法 / Encryption algorithm
*/
export const eea3 = wrap((param) => {
const { BEARER, DIRECTION, KEY, M } = param;
let { COUNTER, LENGTH } = param;
// 转换参数
COUNTER =
typeof COUNTER === 'number'
? new Uint8Array([COUNTER >> 24, COUNTER >> 16, COUNTER >> 8, COUNTER])
: COUNTER;
// 生成密钥流
LENGTH = M.byteLength << 3;
const WORD_COUNT = (LENGTH + 31) >> 5;
const EEA_KeyStream = new Uint8Array(WORD_COUNT << 2);
const KSView = new DataView(EEA_KeyStream.buffer, EEA_KeyStream.byteOffset, EEA_KeyStream.byteLength);
const EEA_IV = createEEA_IV(COUNTER, BEARER, DIRECTION);
const prg = zuc(KEY, EEA_IV);
for (let i = 0; i < WORD_COUNT; i++) {
KSView.setUint32(i << 2, prg(), false);
}
// 加密
return new U8(M.map((_, i) => _ ^ EEA_KeyStream[i]));
}, {
ALGORITHM: 'ZUC-EEA3',
KEY_SIZE: 16,
});
/**
* 3GPP ZUC 完整性算法 / Integrity algorithm
*/
export const eia3 = wrap((param) => {
const { BEARER, DIRECTION, KEY, M } = param;
let { COUNTER, LENGTH } = param;
// 转换参数
COUNTER =
typeof COUNTER === 'number'
? new Uint8Array([COUNTER >> 24, COUNTER >> 16, COUNTER >> 8, COUNTER])
: COUNTER;
// 生成密钥流
const N = LENGTH + 64;
const WORD_COUNT = (N + 31) >> 5;
const EIA_KeyStream = new Uint8Array(WORD_COUNT << 2);
const KSView = new DataView(EIA_KeyStream.buffer, EIA_KeyStream.byteOffset, EIA_KeyStream.byteLength);
const EIA_IV = createEIA_IV(COUNTER, BEARER, DIRECTION);
const prg = zuc(KEY, EIA_IV);
for (let i = 0; i < WORD_COUNT; i++) {
KSView.setUint32(i << 2, prg(), false);
}
// 计算 MAC
let t = 0;
for (let i = 0; i < LENGTH; i++) {
const bit = M[i >>> 3] & (1 << (7 - (i % 8)));
if (bit) {
t ^= getWord(KSView, i);
}
}
t ^= getWord(KSView, LENGTH);
t ^= KSView.getUint32(EIA_KeyStream.byteLength - 4);
return new U8([t >> 24, t >> 16, t >> 8, t]);
}, {
ALGORITHM: 'ZUC-EIA3',
KEY_SIZE: 16,
});