南京邮电大学密码学实验二 编程实现SM4或者AES算法

实验目的和要求

看前先赞,人越来越好看!
编程实现SM4或者AES算法
并对密文做0/1、扑克牌、游程测试等随机性测试
在这里插入图片描述

代码实现

推荐这位师傅的代码,简单易懂,附带讲解
这是代码链接
然后我自己根据题目要求改了一下

函数部分

  #include<stdio.h>
unsigned long rk[32];//密钥
unsigned long plain[4];//明文
static const unsigned char Sbox[16][16] = 
{
{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}
};

static const unsigned long CK[32] =
{
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
};


static const unsigned long FK[4] = {0xa3b1bac6,0x56aa3350,0x677d9197,0xb27022dc};

//i 32比特循环左移i位
unsigned long Change_Place(unsigned long In,int Num)
{
	long temp;
	temp =(In<<Num)|(In>>(32-Num));
	return temp;
}
//生成4个32位密钥MK
unsigned long chang_place1(unsigned long in1,unsigned long in2,unsigned long in3,unsigned long in4)
{
	long temp =0;
	temp=(in1 << 24)|(in2 << 16)|(in3 << 8)|in4;
	return temp;
}
//检查s盒
unsigned int TransSbox(unsigned int temp)
{
	return Sbox[temp>>4][temp&0xf];
}
unsigned long TransSboxl(unsigned long In)
{
	long temp = 0;
	temp |= (unsigned long)TransSbox((unsigned int)(In >> 24) & 0xff);
	temp <<= 8;
	temp |= (unsigned long)TransSbox((unsigned int)(In >> 16) & 0xff);
	temp <<= 8;
	temp |= (unsigned long)TransSbox((unsigned int)(In >> 8) & 0xff);
	temp <<= 8;
	temp |= (unsigned long)TransSbox((unsigned int)In & 0xff);
	return temp;
}
unsigned long TransL_1 (unsigned long temp)
{
	return temp ^ Change_Place(temp, 13) ^ Change_Place(temp, 23);
}
unsigned long TransT_1(unsigned long temp)
{
	return TransL_1(TransSboxl(temp));
}
unsigned long TransL (unsigned long temp)
{
	return temp ^ Change_Place(temp, 2) ^ Change_Place(temp, 10) ^ Change_Place(temp, 18) ^ Change_Place(temp, 24) ;
}
unsigned long TransT(unsigned long temp)
{
	return TransL(TransSboxl(temp));
}

unsigned long KeyExp(unsigned long MK[4])
{
	int i=0;
	long k[4];
	
	for(i=0;i<4;i++)
	{
		k[i] = MK[i] ^ (FK[i]);
	}
	
	rk[0] = k[0]^TransT_1(k[1] ^ k[2] ^ k[3] ^ CK[0]);
	rk[1] = k[1]^TransT_1(k[2] ^ k[3] ^ rk[0] ^ CK[1]);
	rk[2] = k[2]^TransT_1(k[3] ^ rk[0] ^ rk[1] ^ CK[2]);
	rk[3] = k[3]^TransT_1(rk[0] ^ rk[1] ^ rk[2] ^ CK[3]);
	
	for(i=4;i<32;i++)
	{
	rk[i] = rk[i-4]^TransT_1(rk[i-3] ^ rk[i-2] ^ rk[i-1] ^ CK[i]);		
	}
	return 0;
}
unsigned long F(unsigned long X0,unsigned long X1,unsigned long X2,unsigned long X3,unsigned long rk)
{
	return X0 ^ TransT(X1^X2^X3^rk);
}
unsigned long get_sm4(unsigned long x[4],unsigned long MK[4])
{
	long temp;
	int i;
	KeyExp(MK);
	
	printf("rk:\n");
	for(i=0;i<32;i++)
	{
		printf("rk%d = %x\n",i,rk[i]);
	}
	
	for(i=0;i<4;i++)
	{
		plain[i] = x[i];
	}
	
	for(i=0;i<32;i++)
	{
		temp = F(plain[0],plain[1],plain[2],plain[3],rk[i]);
		plain[0]=plain[1];
		plain[1]=plain[2];
		plain[2]=plain[3];
		plain[3]=temp;
		printf("X%d=%x\n",i,temp);
	}
	
	temp = plain[0];
	plain[0] = plain[3];
	plain[3] = temp;
	temp = plain[1];
	plain[1] = plain[2];
	plain[2] = temp;
	return 0;
	
}

随机性测试

 //执行0/1测试
void zeroOneTest(const unsigned char* ciphertext) {
    int count0 = 0;
    int count1 = 0;
    
    for (int i = 0; i < 16; i++) {
        unsigned char current = ciphertext[i];
        for (int j = 0; j < 8; j++) {
            if ((current & 1) == 0) {
                count0++;
            } else {
                count1++;
            }
            current >>= 1;
        }
    }
    
    double ratio = (double)count1 / (count0 + count1);
    printf("Ratio of 1s: %.2f\n", ratio);
}

// 执行扑克牌测试
void pokerTest(const unsigned char* ciphertext) {
    int occurrences[16] = {0};
    
    for (int i = 0; i < 16; i++) {
        unsigned char card = ciphertext[i];
        occurrences[card]++;
    }
    
    // 计算统计结果,这里简化处理,不考虑扑克牌种类
    int min = occurrences[0];
    int max = occurrences[0];
    
    for (int i = 1; i < 16; i++) {
        if (occurrences[i] < min) {
            min = occurrences[i];
        }
        if (occurrences[i] > max) {
            max = occurrences[i];
        }
    }
    
    printf("Min count: %d\n", min);
    printf("Max count: %d\n", max);
}

// 执行游程测试
void runTest(const unsigned char* ciphertext) {
    int maxRun = 0;
    int currentRun = 1;
    unsigned char previous = ciphertext[0] & 1;
    
    for (int i = 1; i < 16; i++) {
        unsigned char current = ciphertext[i] & 1;
        if (current == previous) {
            currentRun++;
        } else {
            if (currentRun > maxRun) {
                maxRun = currentRun;
            }
            currentRun = 1;
            previous = current;
        }
    }
    
    double expectedValue = 16 / 2; // 数据总数的一半
    double ratio = (double)maxRun / expectedValue;
    printf("Max run length: %d\n", maxRun);
    printf("Ratio of max run to expected value: %.2f\n", ratio);
}

主函数

int main() 
{
	int i;
	long stringkey[]={0x32,0x88,0x31,0xe0,
					  0x43,0x5a,0x31,0x37,
					  0xf6,0x30,0x98,0x07,
					  0xa8,0x8d,0xa2,0x34};
	long Cipherkey[]={0x2b,0x28,0xab,0x09,
					  0x7e,0xae,0xf7,0xcf,
					  0x15,0xd2,0x15,0x4f,
					  0x16,0xa6,0x88,0x3c};
	unsigned long MK[4];
	unsigned long Pln[4];
	unsigned long temp[4];
	Pln[0]=chang_place1(stringkey[0],stringkey[1],stringkey[2],stringkey[3]);
	Pln[1]=chang_place1(stringkey[4],stringkey[5],stringkey[6],stringkey[7]);
	Pln[2]=chang_place1(stringkey[8],stringkey[9],stringkey[10],stringkey[11]);
	Pln[3]=chang_place1(stringkey[12],stringkey[13],stringkey[14],stringkey[15]);

	MK[0]=chang_place1(Cipherkey[0],Cipherkey[1],Cipherkey[2],Cipherkey[3]);
	MK[1]=chang_place1(Cipherkey[4],Cipherkey[5],Cipherkey[6],Cipherkey[7]);
	MK[2]=chang_place1(Cipherkey[8],Cipherkey[9],Cipherkey[10],Cipherkey[11]);
	MK[3]=chang_place1(Cipherkey[12],Cipherkey[13],Cipherkey[14],Cipherkey[15]);
	
	printf("明文为\n");
	for(i=0;i<4;i++)
	{
		printf("%x\n",Pln[i]);
	}
	 get_sm4(Pln,MK);
	
	printf("密文为\n%x\n%x\n%x\n%x\n",plain[0],plain[1],plain[2],plain[3]);
unsigned char ciphertext[16];
ciphertext[0] = (plain[0] >> 24) & 0xFF;
ciphertext[1] = (plain[0] >> 16) & 0xFF;
ciphertext[2] = (plain[0] >> 8) & 0xFF;
ciphertext[3] = plain[0] & 0xFF;
ciphertext[4] = (plain[1] >> 24) & 0xFF;
ciphertext[5] = (plain[1] >> 16) & 0xFF;
ciphertext[6] = (plain[1] >> 8) & 0xFF;
ciphertext[7] = plain[1] & 0xFF;
ciphertext[8] = (plain[2] >> 24) & 0xFF;
ciphertext[9] = (plain[2] >> 16) & 0xFF;
ciphertext[10] = (plain[2] >> 8) & 0xFF;
ciphertext[11] = plain[2] & 0xFF;
ciphertext[12] = (plain[3] >> 24) & 0xFF;
ciphertext[13] = (plain[3] >> 16) & 0xFF;
ciphertext[14] = (plain[3] >> 8) & 0xFF;
ciphertext[15] = plain[3] & 0xFF;
zeroOneTest(ciphertext);
    pokerTest(ciphertext);
    runTest(ciphertext);
	return 0;
}

总结

仅供参考,点个赞吧

评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值