祖冲之序列密码

CodeStarr

已于 2023-02-16 16:38:57 修改

阅读量1.6k

点赞数 3

分类专栏： # 密码算法 Cryptography 文章标签：密码学

于 2023-02-16 10:03:39 首次发布

本文链接：https://blog.csdn.net/Ga4ra/article/details/129055438

版权

Cryptography 同时被 2 个专栏收录

30 篇文章 1 订阅

订阅专栏

密码算法

20 篇文章 0 订阅

订阅专栏

文章目录

1. 简介
2. 算法描述
附录A
- S盒
附录B
- 模2^31^-1加法的实现
实现

1. 简介

祖冲之序列密码算法(简称ZUC 算法)是由我国自主设计的密码算法，包括

祖冲之算法
加密算法128-EEA3
完整性算法128-EIA3。

2. 算法描述

2.1 整体结构

ZUC算法分为上中下三层：

上层：线性反馈移位寄存器LFSR
中层：比特重组BR
下层：非线性函数F

[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-qKNtkv8q-1676512923543)(ZUC.assets/zuc.png)]

2.2 LFSR

LFSR包括 16个 31比特寄存器单元变量如,s0 ,… ,s15。

LFSR的运行模式有2种 :

初始化模式
工作模式

初始化模式

/*
u = F() & 0xFFFFFFFE = F() >> 1
*/

#define    LFSRWithInitialisationMode(u)			\
	V = LFSR[0];					\
	ADD31(V, ROT31(LFSR[0], 8));			\
	ADD31(V, ROT31(LFSR[4], 20));			\
	ADD31(V, ROT31(LFSR[10], 21));			\
	ADD31(V, ROT31(LFSR[13], 17));			\
	ADD31(V, ROT31(LFSR[15], 15));			\
	ADD31(V, (u));					\
	{int j; for (j=0; j<15;j++) LFSR[j]=LFSR[j+1];}	\
	LFSR[15] = V

工作模式

#define LFSRWithWorkMode()				\
	{						\
	int j;						\
	uint64_t a = LFSR[0];				\
	a += ((uint64_t)LFSR[0]) << 8;			\
	a += ((uint64_t)LFSR[4]) << 20;			\
	a += ((uint64_t)LFSR[10]) << 21;		\
	a += ((uint64_t)LFSR[13]) << 17;		\
	a += ((uint64_t)LFSR[15]) << 15;		\
	a = (a & 0x7fffffff) + (a >> 31);		\
	V = (uint32_t)((a & 0x7fffffff) + (a >> 31));	\
	for (j = 0; j < 15; j++)			\
		LFSR[j] = LFSR[j+1];			\
	LFSR[15] = V;					\
	}

2.3 BR

BitReconstruction(X0, X1, X2, X3)
{
	X0 = ((LFSR[15] & 0x7FFF8000) << 1) | (LFSR[14] & 0xFFFF);
    X1 = ((LFSR[11] & 0xFFFF) << 16) | (LFSR[9] >> 15);
	X2 = ((LFSR[7] & 0xFFFF) << 16) | (LFSR[5] >> 15);
    X3 = ((LFSR[2] & 0xFFFF) << 16) | (LFSR[0] >> 15);
}

2.4 F

uint32_t F(
    uint32_t x0
    , uint32_t x1
    , uint32_t x2
);



#define F(X0,X1,X2)					\
	(X0 ^ R1) + R2;					\
	W1 = R1 + X1;					\
	W2 = R2 ^ X2;					\
	U = L1((W1 << 16) | (W2 >> 16));		\
	V = L2((W2 << 16) | (W1 >> 16));		\
	R1 = MAKEU32(	S0[U >> 24],			\
			S1[(U >> 16) & 0xFF],		\
			S0[(U >> 8) & 0xFF],		\
			S1[U & 0xFF]);			\
	R2 = MAKEU32(	S0[V >> 24],			\
			S1[(V >> 16) & 0xFF],		\
			S0[(V >> 8) & 0xFF],		\
			S1[V & 0xFF])

依赖的线性变换L1和L2：

#define L1(X)			\
	((X) ^			\
	ROT32((X),  2) ^	\
	ROT32((X), 10) ^	\
	ROT32((X), 18) ^	\
	ROT32((X), 24))

#define L2(X)			\
	((X) ^			\
	ROT32((X),  8) ^	\
	ROT32((X), 14) ^	\
	ROT32((X), 22) ^	\
	ROT32((X), 30))

S0为S盒变换，定义于附录A

2.5 密钥装入

将16 bytes初始密钥k和16 bytes的初始向量iv扩展为LFSR寄存器初始状态。

注意LFSR寄存器是31比特，共16个。

// 已知16个15比特常量
static const uint32_t D[16] = {
	0x44D7,0x26BC,0x626B,0x135E,0x5789,0x35E2,0x7135,0x09AF,
	0x4D78,0x2F13,0x6BC4,0x1AF1,0x5E26,0x3C4D,0x789A,0x47AC,
};

#define MAKEU31(k,d,iv) 				\
	(((uint32_t)(k) << 23) |			\
	 ((uint32_t)(d) <<  8) |			\
	  (uint32_t)(iv))
for (i = 0; i < 16; i++) {
    LFSR[i] = MAKEU31(key[i], D[i], iv[i]);
}

2.6 算法运行

// 1. 初始化阶段
// 密钥装入

uint32_t R1 = 0;
uint32_t R2 = 0;
uint32_t X0, X1, X2, X4;

for (i = 0; i < 32; i++) {
    BitReconstruction(X0, X1, X2, X4);
    W = F(X0, X1, X2);
    LFSRWithInitialisationMode(W >> 1);
}


// 2. 工作阶段
BitReconstruction(X0, X1, X2, X4);
F(X0, X1, X2);	// 丢弃输出
LFSRWithWorkMode();

密钥输出阶段（其实也属于工作阶段）：

void zuc_generate_keystream(state *state, size_t nwords, uint32_t *keystream)
{
    // 单位 4字节(1 word)
    for (i = 0; i < nwords; i ++) {
        BitReconstruction(X0, X1, X2, X3);
        keystream[i] = X3 ^ F(X0, X1, X2);
        LFSRWithWorkMode();
    }
}

附录A

S盒

32比特S盒S由4个小的8× 8的S盒并置而成

S = (S0, S1, S2, S3);
SO == S2;
S1 == S3;

S0和S1如下：

static const uint8_t S0[256] = {
	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,
};

static const uint8_t S1[256] = {
	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,
};

每个小盒子的输入都是一个字节。原本S盒是二维数组，输入的高4位为行，低4位为列，其实等价于把输入作为下标：

uint8_t a = S0[one_byte];

整个S盒的转换如下：

#define MAKEU32(a, b, c, d)				\
	(((uint32_t)(a) << 24) |			\
	 ((uint32_t)(b) << 16) | 			\
	 ((uint32_t)(c) <<  8) |			\
	 ((uint32_t)(d)))
uint32_t U;
R1 = MAKEU32(	S0[U >> 24],
         S1[(U >> 16) & 0xFF],
         S0[(U >> 8) & 0xFF],
         S1[U & 0xFF]);

附录B

模2³¹-1加法的实现

#define ADD31(a,b)	a += (b); a = (a & 0x7fffffff) + (a >> 31)

实现

https://github.com/C0deStarr/CryptoImp/tree/main/Cipher/StreamCipher

zuc.h
zuc.c