MD5算法-Message Digest

  MD5是一种哈希函数,为每一数字信息可以产生类似于人类指纹的唯一摘要,用以提供信息的完整性保护。

  MD5是以512位为分组来处理输入的信息,每一分组又被划分为16个32位的子分组,经过一系列处理后,算法输出由4个32位分组组成,将这4个32位分组组合形成一个哈希值。


步骤1:对信息进行填充(Append padding bits)

  通过信息填充后,信息的位长对512求余的结果等于448。填充的方法如下,在信息的后面填充一个 ’1’ 和无数个 ‘0’,直到满足上面的条件时才停止用0对信息进行填充。

 

步骤2:填充信息长度(Append length)

  经过步骤1后,再在信息的后面附加一个64位二进制表示的经过步骤1填充前的信息长度。经过步骤2后,信息的长度是512的倍数。

 

步骤3:初始化MD缓冲区(Initialize MD buffer)

  使用一个拥有4个32字节(A,B,C,D)长度的缓冲区来进行运算。A,B,C,D均为32字节长的寄存器,它们分别初始化为如下用十六进制和小端规则表示的值:

A:01 23 45 67

B:89 ab cd ef

C:fe  dc ba 98

D:76 54 32 10


步骤4:以16个字为单位对消息进行处理(Process message in 16-word blocks)

  定义四个函数,输入为4个32字节的字,输出为1个32字节的字

F(X,Y,Z) = XY v not(X) Z

G(X,Y,Z) = XZ v Y not(Z)

H(X,Y,Z) = X xor Y xor Z

I(X,Y,Z) = Y xor (X v not(Z))

  将消息分成为每段有16个字长的块,消息的总长度为N,则总共有N/16块。每一块均要经过4轮总过64次处理。初始输入为步骤3的A,B,C,D; 第一块的处理输出结果作为第二块处理的输入,第二块的处理输出结果作为第三块的输入,以此类推。伪代码如下:


/* Save A as AA, B as BB, C as CC, and D as DD. */

  AA = A  BB = B CC = C DD = D

/* Round 1. */

/* Let [abcd k s i] denote the operation

a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
/* Do the following 16 operations. */
[ABCD 0 7 1] [DABC 1 12 2] [CDAB 2 17 3] [BCDA 3 22 4]    [ABCD 4 7 5] [DABC 5 12 6] [CDAB 6 17 7] [BCDA 7 22 8]   [ABCD 8 7 9] [DABC 9 12 10] [CDAB10 17 11] [BCDA 11 22 12] [ABCD 12 7 13][DABC 13 12 14] [CDAB 14 17 15] [BCDA 15 22 16]

/* Round 2. */

/* Let [abcd k s i] denote the operation

     a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */

/* Do the following 16 operations. */
[ABCD 1 5 17] [DABC 6 9 18] [CDAB 11 14 19] [BCDA 0 20 20] [ABCD 5 5 21] [DABC 10 9 22] [CDAB 15 14 23] [BCDA 4 20 24] [ABCD 9 5 25] [DABC 14 9 26] [CDAB 3 14 27] [BCDA 8 20 28] [ABCD 13 5 29] [DABC 2 9 30] [CDAB 7 14 31] [BCDA 12 20 32]

/* Round 3. */

/* Let [abcd k s t] denote the operation

a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
/* Do the following 16 operations. */
[ABCD 5 4 33] [DABC 8 11 34] [CDAB 11 16 35] [BCDA 14 23 36] [ABCD 1 4 37] [DABC 4 11 38] [CDAB 7 16 39] [BCDA 10 23 40] [ABCD 13 4 41] [DABC 0 11 42] [CDAB 3 16 43] [BCDA 6 23 44] [ABCD 9 4 45] [DABC 12 11 46] [CDAB 15 16 47] [BCDA 2 23 48]

/* Round 4. */

/* Let [abcd k s t] denote the operation

a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
/* Do the following 16 operations. */
[ABCD 0 6 49] [DABC 7 10 50] [CDAB 14 15 51] [BCDA 5 21 52] [ABCD 12 6 53] [DABC 3 10 54] [CDAB 10 15 55] [BCDA 1 21 56] [ABCD 8 6 57] [DABC 15 10 58] [CDAB 6 15 59] [BCDA 13 21 60] [ABCD 4 6 61] [DABC 11 10 62] [CDAB 2 15 63] [BCDA 9 21 64]

/* Then perform the following additions. (That is increment each

   of the four registers by the value it had before this block

   was started.) */

     A = A + AA

     B = B + BB

     C = C + CC

     D = D + DD


附代码(可直接编译运行)

#include <stdio.h>
#include <string.h>
typedef unsigned int UINT4;
typedef unsigned long long UINT8;
#define S11 7
#define S12 12
#define S13 17
#define S14 22
#define S21 5
#define S22 9
#define S23 14
#define S24 20
#define S31 4
#define S32 11
#define S33 16
#define S34 23
#define S41 6
#define S42 10
#define S43 15
#define S44 21

/* F,G,H and I are basic MD5 functions */
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
#define H(x, y, z) ((x) ^ (y) ^ (z))
#define I(x, y, z) ((y) ^ ((x) | (~z)))

/* ROTATE_LEFT rotates x left n bits */
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))

/* FF, GG, HH and II transformations for rounds 1,2,3 and 4 */
#define FF(a, b, c, d, x, s, ac) {\
	(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac);\
	(a) = ROTATE_LEFT ((a), (s));\
	(a) += (b);\
}

#define GG(a, b, c, d, x, s, ac) {\
	(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac);\
	(a) = ROTATE_LEFT ((a), (s));\
	(a) += (b);\
}

#define HH(a, b, c, d, x, s, ac) {\
	(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac);\
	(a) = ROTATE_LEFT ((a), (s));\
	(a) += (b);\
}

#define II(a, b, c, d, x, s, ac) {\
	(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac);\
	(a) = ROTATE_LEFT ((a), (s));\
	(a) += (b);\
}

typedef struct{
	UINT4 state[4];
	UINT4 bits_len[2];
	unsigned char buffer[64];
} MD_INFO;

void initMDINFO(MD_INFO *info);
void MD5Transform (UINT4 state[], unsigned char block[]);
void Decode(UINT4 *output, unsigned char *input, unsigned int len);
void Encode(unsigned char* output, UINT4 *input, unsigned int len);
void MD5Process(MD_INFO *info, unsigned char *input, unsigned int lenOfInput);
void encryptionForString(char *string);

int main()
{
	char a[10000];
	int i = 0;
	while(i < 5) {
		*a = 0;
		printf("«Î ‰»Î“™◊÷∑˚¥Æ:(ªπø… ‰»Î%d¥Œ)\n", 5-i);
		gets(a);
		encryptionForString(a);
		i++;
	}
	return 0;
}

void initMDINFO(MD_INFO *info)
{
	info->state[0] = 0x67452301;
	info->state[1] = 0xefcdab89;
	info->state[2] = 0x98badcfe;
	info->state[3] = 0x10325476;
	info->bits_len[0] = info->bits_len[1] = 0;
}

void MD5Transform (UINT4 state[], unsigned char block[])
{
	UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
	int i;
	Decode (x, block, 64);

	/* Round 1 */
	FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
	FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
	FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
	FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
	FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
	FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
	FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
	FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
	FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
	FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
	FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
	FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
	FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
	FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
	FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
	FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */

	/* Round 2 */
	GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
	GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
	GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
	GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
	GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
	GG (d, a, b, c, x[10], S22,  0x2441453); /* 22 */
	GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
	GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
	GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
	GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
	GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
	GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
	GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
	GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
	GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
	GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */

	/* Round 3 */
	HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
	HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
	HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
	HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
	HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
	HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
	HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
	HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
	HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
	HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
	HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
	HH (b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */
	HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
	HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
	HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
	HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
	
	/* Round 4 */
	II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
	II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
	II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
	II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
	II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
	II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
	II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
	II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
	II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
	II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
	II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
	II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
	II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
	II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
	II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
	II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */

	state[0] += a;
	state[1] += b;
	state[2] += c;
	state[3] += d;
}

void Decode(UINT4 * output, unsigned char* input, unsigned int len)
{
	unsigned int i, j;

	for (i = 0, j = 0; j < len; i++, j += 4) {
		output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
			(((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3] << 24));
	}
}

void Encode(unsigned char* output, UINT4 *input, unsigned int len)
{
	unsigned int i, j;
	int count = 0;

	for (j = 0; j < len * 4; j+=4) {
		output[j] = (unsigned char)(input[count] & 0xff);
		output[j+1] = (unsigned char)((input[count] >> 8) & 0xff);
		output[j+2] = (unsigned char)((input[count] >> 16) & 0xff);
		output[j+3] = (unsigned char)((input[count] >> 24) & 0xff);
		count++;
	}
}
void MD5Process(MD_INFO *info, unsigned char *input, unsigned int lenOfInput)
{
	unsigned int times, part,padding_byte;
	unsigned int i, j;
	unsigned char final_run[64];
	unsigned char *block;

	times = lenOfInput / 64;
	part = lenOfInput % 64;
	padding_byte = 64 - part - 1;

	if ((info->bits_len[0] += ((UINT4)lenOfInput << 3)) < ((UINT4)lenOfInput << 3)) 
		info->bits_len[1]++;
	info->bits_len[1] += ((UINT4)lenOfInput >> 29);

	for (i = 0 ; i < times; i++) {
		block = (input + i * 64);
		MD5Transform (info->state, block);
	}
	
	for (i = 0; i < part; i++) {
		final_run[i] = input[times * 64 + i];
	}

	for (i = 0, j = part; i < padding_byte; i++, j++) {
		if (i == 0) final_run[j] = 0x80; 
		else final_run[j] = 0;
	}

	final_run[56] = (unsigned char)(info->bits_len[0] & 0xff);
	final_run[57] = (unsigned char)((info->bits_len[0] >> 8)  & 0xff);
	final_run[58] = (unsigned char)((info->bits_len[0] >> 16) & 0xff);
	final_run[59] = (unsigned char)((info->bits_len[0] >> 24) & 0xff);
	final_run[60] = (unsigned char)(info->bits_len[1] & 0xff);
	final_run[61] = (unsigned char)((info->bits_len[1] >> 8) & 0xff);
	final_run[62] = (unsigned char)((info->bits_len[1] >> 16) & 0xff);
	final_run[63] = (unsigned char)((info->bits_len[1] >> 24) & 0xff);

	MD5Transform(info->state, final_run);
}
void encryptionForString(char *string)
{
	int i = 0;
	unsigned char digest[16];
	unsigned int len = strlen(string);

	MD_INFO info;
	initMDINFO(&info);

	MD5Process(&info, (unsigned char *)string, len);
	Encode(digest, info.state, 4);

	printf("MD5 of %s = ", string);

	for(i = 0; i < 16; i++)
		printf("%02x", digest[i]);
	
	printf("\n");
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值