Hash512_384C实现

本文深入探讨了SHA-384与SHA-512两种安全散列算法的实现细节,包括算法核心的数学运算、状态更新、消息调度等过程。通过具体的C语言代码示例,解析了SHA算法如何处理输入数据并生成固定长度的哈希值,为读者提供了理解和实现SHA算法的实用指南。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <memory.h>
#include <stddef.h>
typedef unsigned char BYTE;
typedef unsigned long long WORD;

typedef struct
{
	BYTE data[128];
	WORD datalen;
	WORD bitlen;
	WORD state[8];
}SHA_CTX;

#define ROTRIGHT(a,b) (((a) >> (b)) | ((a) << (64-(b))))
#define _32_ROTRIGHT(a,b) (((a) >> (b)) | ((a) << (32-(b))))

#define CH(x,y,z) (((x) & (y)) ^ (~(x) & (z)))
#define MAJ(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))

#define EP0(x) (ROTRIGHT(x,28) ^ ROTRIGHT(x,34) ^ ROTRIGHT(x,39))
#define EP1(x) (ROTRIGHT(x,14) ^ ROTRIGHT(x,18) ^ ROTRIGHT(x,41))
#define SIG0(x) (ROTRIGHT(x,1) ^ ROTRIGHT(x,8) ^ ((x) >> 7))
#define SIG1(x) (ROTRIGHT(x,19) ^ ROTRIGHT(x,61) ^ ((x) >> 6))

static const WORD k[80] = {
0x428a2f98d728ae22,0x7137449123ef65cd, 0xb5c0fbcfec4d3b2f, 0xe9b5dba58189dbbc,  0x3956c25bf348b538,
0x59f111f1b605d019,0x923f82a4af194f9b, 0xab1c5ed5da6d8118, 0xd807aa98a3030242, 0x12835b0145706fbe,
0x243185be4ee4b28c,0x550c7dc3d5ffb4e2, 0x72be5d74f27b896f, 0x80deb1fe3b1696b1, 0x9bdc06a725c71235,
0xc19bf174cf692694, 0xe49b69c19ef14ad2, 0xefbe4786384f25e3, 0x0fc19dc68b8cd5b5, 0x240ca1cc77ac9c65,
0x2de92c6f592b0275,0x4a7484aa6ea6e483, 0x5cb0a9dcbd41fbd4, 0x76f988da831153b5, 0x983e5152ee66dfab,
0xa831c66d2db43210, 0xb00327c898fb213f, 0xbf597fc7beef0ee4, 0xc6e00bf33da88fc2,  0xd5a79147930aa725,
0x06ca6351e003826f,0x142929670a0e6e70, 0x27b70a8546d22ffc, 0x2e1b21385c26c926, 0x4d2c6dfc5ac42aed,
0x53380d139d95b3df,0x650a73548baf63de, 0x766a0abb3c77b2a8, 0x81c2c92e47edaee6, 0x92722c851482353b,
0xa2bfe8a14cf10364, 0xa81a664bbc423001, 0xc24b8b70d0f89791, 0xc76c51a30654be30,  0xd192e819d6ef5218,
0xd69906245565a910, 0xf40e35855771202a, 0x106aa07032bbd1b8, 0x19a4c116b8d2d0c8,  0x1e376c085141ab53,
0x2748774cdf8eeb99, 0x34b0bcb5e19b48a8, 0x391c0cb3c5c95a63, 0x4ed8aa4ae3418acb, 0x5b9cca4f7763e373,
0x682e6ff3d6b2b8a3, 0x748f82ee5defb2fc, 0x78a5636f43172f60, 0x84c87814a1f0ab72, 0x8cc702081a6439ec,
0x90befffa23631e28,0xa4506cebde82bde9, 0xbef9a3f7b2c67915, 0xc67178f2e372532b, 0xca273eceea26619c,
0xd186b8c721c0c207, 0xeada7dd6cde0eb1e, 0xf57d4f7fee6ed178, 0x06f067aa72176fba,  0x0a637dc5a2c898a6,
0x113f9804bef90dae, 0x1b710b35131c471b, 0x28db77f523047d84, 0x32caab7b40c72493, 0x3c9ebe0a15c9bebc,
0x431d67c49c100d4c, 0x4cc5d4becb3e42b6, 0x597f299cfc657e2a, 0x5fcb6fab3ad6faec,  0x6c44198c4a475817
};

void sha_transform(SHA_CTX *ctx, BYTE data[], unsigned int mode)
{
	WORD a, b, c, d, e, f, g, h, i, j, t1, t2, kp, m[80];
    memset(m,0,sizeof(m));

	for (i = 0, j = 0; i < 16; ++i, j += 8)
	{
		for(kp=0;kp<8;kp++)
		{
		  m[i]=((m[i]<<8)|data[j+kp]);
		}
	}

	for ( ; i < 80; ++i)
	{
		 m[i] = SIG1(m[i - 2]) + m[i - 7] + SIG0(m[i - 15]) + m[i - 16];
	}

	a = ctx->state[0];
	b = ctx->state[1];
	c = ctx->state[2];
	d = ctx->state[3];
	e = ctx->state[4];
	f = ctx->state[5];
	g = ctx->state[6];
	h = ctx->state[7];

	for (i = 0; i < 80; ++i)
	{
        t1 = h + EP1(e) + CH(e,f,g) + k[i] + m[i];
        t2 = EP0(a) + MAJ(a,b,c);
		h = g;
		g = f;
		f = e;
		e = d + t1;
		d = c;
		c = b;
		b = a;
		a = t1 + t2;
	}

	ctx->state[0] += a;
	ctx->state[1] += b;
	ctx->state[2] += c;
	ctx->state[3] += d;
	ctx->state[4] += e;
	ctx->state[5] += f;
	ctx->state[6] += g;
	ctx->state[7] += h;
}

void sha_init(SHA_CTX *ctx,int mode)
{
	ctx->datalen = 0;
	ctx->bitlen  = 0;
	memset(ctx->data,0,sizeof(ctx->data));
	if(mode==384)
	{
		ctx->state[0] = 0xcbbb9d5dc1059ed8;
		ctx->state[1] = 0x629a292a367cd507;
		ctx->state[2] = 0x9159015a3070dd17;
		ctx->state[3] = 0x152fecd8f70e5939;
		ctx->state[4] = 0x67332667ffc00b31;
		ctx->state[5] = 0x8eb44a8768581511;
		ctx->state[6] = 0xdb0c2e0d64f98fa7;
		ctx->state[7] = 0x47b5481dbefa4fa4;
    }
    else if(mode==512)
    {
		ctx->state[0] = 0x6a09e667f3bcc908;
		ctx->state[1] = 0xbb67ae8584caa73b;
		ctx->state[2] = 0x3c6ef372fe94f82b;
		ctx->state[3] = 0xa54ff53a5f1d36f1;
		ctx->state[4] = 0x510e527fade682d1;
		ctx->state[5] = 0x9b05688c2b3e6c1f;
		ctx->state[6] = 0x1f83d9abfb41bd6b;
		ctx->state[7] = 0x5be0cd19137e2179;
	}
}
void sha_update(SHA_CTX *ctx,  const BYTE data[], WORD len, WORD mode)
{
	WORD i;
	for (i = 0; i < len; ++i)
    {
		ctx->data[ctx->datalen] = data[i];
		ctx->datalen++;
		if (ctx->datalen == 128)
        {
			sha_transform(ctx, ctx->data,mode); //ctx->bitlen += 1024; 1024=2^10=10000000000
			ctx->bitlen += 1024;             //cal(ctx,1,0);
			ctx->datalen = 0;
		}
	}
}

void sha_final(SHA_CTX *ctx, BYTE hash[],int mode)
{
	WORD i,j;
	i = ctx->datalen;
	if (ctx->datalen < 112)
    {
		ctx->data[i++] = 0x80;  // pad 10000000 = 0x80
		while (i < 112) ctx->data[i++] = 0x00;
	}
	else
	{
		ctx->data[i++] = 0x80;
		while (i < 128) ctx->data[i++] = 0x00;
		sha_transform(ctx, ctx->data,mode);
		memset(ctx->data, 0, 112);
	}

    ctx->bitlen += ctx->datalen * 8;

    ctx->data[112] = 0;
    ctx->data[113] = 0;
    ctx->data[114] = 0;
    ctx->data[115] = 0;
    ctx->data[116] = 0;
    ctx->data[117] = 0;
    ctx->data[118] = 0;
    ctx->data[119] = 0 ;
    ctx->data[120] = ctx->bitlen >> 56;
    ctx->data[121] = ctx->bitlen >> 48;
    ctx->data[122] = ctx->bitlen >> 40;
    ctx->data[123] = ctx->bitlen >> 32;
    ctx->data[124] = ctx->bitlen >> 24;
    ctx->data[125] = ctx->bitlen >> 16;
    ctx->data[126] = ctx->bitlen >> 8;
    ctx->data[127] = ctx->bitlen;

	sha_transform(ctx, ctx->data,mode);
 
    for (i = 0; i < 8; ++i)  //h0-h5
    {
        hash[i]      = (ctx->state[0] >> (56 - i * 8)) & 0x000000ff;
        hash[i + 8]  = (ctx->state[1] >> (56 - i * 8)) & 0x000000ff;
        hash[i + 16]  = (ctx->state[2] >> (56 - i * 8)) & 0x000000ff;
        hash[i + 24] = (ctx->state[3] >> (56 - i * 8)) & 0x000000ff;
        hash[i + 32] = (ctx->state[4] >> (56 - i * 8)) & 0x000000ff;
        hash[i + 40] = (ctx->state[5] >> (56 - i * 8)) & 0x000000ff;
        if(mode==512)
        {
            hash[i + 48] = (ctx->state[6] >> (56 - i * 8)) & 0x000000ff;
            hash[i + 56] = (ctx->state[7] >> (56 - i * 8)) & 0x000000ff;
        }
    }
}
int main()
{
    BYTE text[10000];
    BYTE buf[10000];
    int len=4,mode=384;
    SHA_CTX ctx;
	sha_init(&ctx,mode);
	memset(text,0x0f,len);
	sha_update(&ctx, text, len,mode);
	//printf("===\n");
	sha_final(&ctx, buf,mode);
	for(unsigned int i=0;i<mode/8;i++)
    {
       if(i%16==0&&i) printf("\n");
       printf("%02x ",buf[i]);
    }
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值