SHA-1算法(C语言实现)

测试明文:

iscbupt

hash:

664DC9F017DC1AEE4A4366BCFB8511AFC89F9430

原创源码:

#include<stdio.h>
/*定义用到的常量*/
unsigned int A = 0x67452301, B = 0xEFCDAB89, C = 0x98BADCFE, D = 0x10325476, E = 0xC3D2E1F0;        //第一次迭代的链接变量
unsigned int K[4] = { 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xCA62C1D6};                              //循环中用到的常量
unsigned int A0 = 0x67452301,B0 = 0xEFCDAB89,C0 = 0x98BADCFE,D0 = 0x10325476,E0 = 0xC3D2E1F0;
/*字节转字*/
int CharToWord(unsigned char *character, int first)
{
	return (((int)character[first] & 0x000000ff) << 24) | (((int)character[first + 1] & 0x000000ff) << 16) | (((int)character[first + 2] & 0x000000ff) << 8) | ((int)character[first + 3] & 0x000000ff);
}
/*f函数*/
unsigned int f(int B, int C, int D, int t)
{
	return (t >= 0 && t <= 19) ? ((B&C) | (~B&D)) : ((t >= 20 && t <= 39) ? (B ^ C ^ D) : ((t >= 40 && t <= 59) ? ((B&C) | (B&D) | (C&D)) : ((t >= 60 && t <= 79) ? B ^ C ^ D : 0)));
}

/*从W消息分组中导出*/
void GetExtraMessage(unsigned int w[])
{
	for (int i = 16; i < 80; w[i++] = ((w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]) << 1) | ((w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]) >> 31));
}

/*分组*/
void DevideToGroup(unsigned char *plaintext,unsigned int *group,int length)
{
	int temp = length / 4, l = length,k;
	printf("\n————分组成功!!!\n");
	while (l > 0)
	{
		if (l / 4)
		{
			for (int j = 0; j < temp; j++, l -= 4)
			{
				group[j] = CharToWord(plaintext, 4 * j);
				printf("第%2d组明文是0x%08X\n", j + 1, group[j]);
			}
		}
		else
		{
			plaintext[temp * 4 + (l + 4) % 4] = 0x80;
			for (int k = temp * 4 + (l + 4) % 4 + 1; k < (temp + 1) * 4 - 1; plaintext[k] = 0, k++);
			group[temp] = CharToWord(plaintext, temp * 4);
			printf("第%2d组明文是0x%08X\n", temp + 1, group[temp] = CharToWord(plaintext, temp * 4));
			break;
		}
	}
	for (k = temp + 1; k < 15; group[k++] = 0)
		printf("第%2d组明文是0x%08X\n", k + 1, group[k]);
	printf("第%2d组明文是0x%08X\n", k + 1, group[k]);
}
unsigned int GetK(int t)
{
	return (t >= 0 && t <= 19) ? K[0] : ((t >= 20 && t <= 39) ? K[1] : ((t >= 40 && t <= 59) ? K[2] : ((t >= 60 && t <= 79) ? K[3] : 0)));
}
/*步函数*/
unsigned int StepFunction(unsigned int w[],int t)
{
	unsigned int temp = ((A << 5)|(A >> 27)) + f(B, C, D, t) + E + w[t] + GetK(t);
	E = D,D = C,C = ((B << 30) | (B >> 2)),B = A,A = temp;
	printf("第%2d轮加密后的密文是%08X %08X %08X %08X %08X\n", t + 1, A, B, C, D, E);
}
/*密文组合*/
unsigned int CombineCipher(unsigned int cipher[])
{
	for (int i = 0; i <= 4; i == 0 ? cipher[i] = (A0 + A) : (i == 1 ? cipher[i] = (B0 + B) : (i == 2 ? cipher[i] = (C0 + C) : (i == 3 ? cipher[i] = (D0 + D) : (i == 4 ? cipher[i] = (E0 + E) : 0)))), i++);
}
int main()
{
	int i, t, j, length, temp;
	unsigned char plaintext[64] = "iscbupt", hash[20] = { 0 };
	unsigned int group[80] = { 0 }, cipher[5] = { 0 };
	/*长度填充到最后*/
	printf("当前明文字符串为:");
	for (i = 0; plaintext[i]; length = i + 1,i++)
	{
		printf("%c", plaintext[i]);
		group[15] = (i + 1) * 8;          //长度是二进制位数		
	}
	/*分组填补*/
	printf("\n\n0x00 正在分组…………\n****************************");
	DevideToGroup(plaintext, group, 7);
	/*从w消息分组中导出*/
	GetExtraMessage(group);
	/*80次步函数*/
	printf("\n0x01 SHA-1加密中…………\n****************************\n");
	for (t = 0; t < 80; t++)
	{
		StepFunction(group, t);
		if (!((t + 1) % 20)) printf("\n");
	}
	/*密文组合*/
	printf("\n0x02 hash值组合中…………\n****************************\n");
	CombineCipher(cipher);
	/*密文输出*/
	printf("\n0x03 SHA-1加密成功!!!\n****************************\nHash:");
	for (j = 0; j <= 4; j++) printf("%08X", cipher[j]);
	printf("\n");
	system("pause");
	return 0;
}

运行效果:

在这里插入图片描述
在这里插入图片描述
在这里插入图片描述

  • 2
    点赞
  • 31
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 3
    评论
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

Em0s_Er1t

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值