C++写的MD5

本文详细展示了MD5哈希函数的C++实现,包括F、G、H、I四个基本函数以及左移位操作。通过`FF`、`GG`、`HH`、`II`函数进行轮转换换,结合初始值进行消息摘要计算。同时,提供了填充和打印函数,用于处理输入字符串并输出哈希结果。整个过程遵循MD5算法的典型步骤。
摘要由CSDN通过智能技术生成

MD5.h

#pragma once
typedef unsigned int ul;
ul F(ul x, ul y, ul z) {
	return (x&y) | ((~x)&z);
 }
ul G(ul x, ul y, ul z) {
	return (x&z) | (y&(~z));
}
ul H(ul x, ul y, ul z) {
	return x^y^z;
}
ul I(ul x, ul y, ul z) {
	return y ^ (x | (~z));
}
ul LLSL_32bit(ul in, int s) {
	ul flag = 0xffffffff >> s;
	ul low = in & flag;
	ul high = in & (~flag);
	return (low << s) + (high >> (32 - s));
}
ul FF(ul &a, ul b,ul  c,ul  d, ul  mj,ul s,ul ti) {
	return a = b + LLSL_32bit((a + F(b, c, d) + mj + ti) , s);
}
ul GG(ul &a, ul b, ul  c, ul  d, ul  mj, ul s, ul ti) {
	return a = b + LLSL_32bit((a + G(b, c, d) + mj + ti), s);
}
ul HH(ul &a, ul b, ul  c, ul  d, ul  mj, ul s, ul ti) {
	return a = b + LLSL_32bit((a + H(b, c, d) + mj + ti), s);
}
ul II(ul &a, ul b, ul  c, ul  d, ul  mj, ul s, ul ti) {
	return a = b + LLSL_32bit((a + I(b, c, d) + mj + ti), s);
}

main.cpp

#include<stdio.h>
#include<math.h>
#include<cmath>
#include<string.h>
#include"MD5.h"
unsigned long ti[65];
unsigned int  si[16]{
	7,12,17,22,
	5,9,14,20,
	4,11,16,23,
	6,10,15,21
};
int index[64]{
	0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 ,12 ,13 ,14, 15 ,
	1, 6, 11, 0, 5, 10, 15, 4, 9, 14 ,3, 8, 13 ,2, 7, 12,
	5, 8, 11 ,14, 1, 4, 7, 10, 13, 0, 3, 6, 9 ,12 ,15, 2,
	0, 7, 14, 5, 12, 3, 10, 1, 8, 15 ,6, 13, 4, 11, 2, 9
};
char charto16[]{
	'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'
};
ul LLSL_32bits(ul in, int s) {
	ul flag = 0xffffffff >> s;
	ul low = in & flag;
	ul high = in & (~flag);
	return (low << s) + (high >> (32 - s));
}
void test() {
	ul t;
	scanf("%ld", &t);
	printf("%08x %08x", t,LLSL_32bits(t,1));
	for(int i=0;i<32;i++)printf("%08x %08x\n", t, LLSL_32bits(t, i));
}
void initialTi() {
	for (int i = 0; i < 64; i++) {
			ti[i] = long long(4294967296 * fabs(sin(i+1)));
		}
}

void fillC(char C[], int padL) {
	int len = strlen(C);
	if (padL > 1)C[len] = 128;
	for (int i = 1; i < padL; i++)C[len + i] = 0;
	unsigned long long L = len * 8;
	memcpy(C + len + padL, &L, 8);
}
void printsingle(ul A) {
	unsigned char  * t = (unsigned char *)&(A);
	for (int i = 0; i < 4;i++)printf("%c%c", charto16[(*(t + i)) / 16], charto16[(*(t + i)) % 16]);
}
void printM(ul A, ul B, ul C, ul D) {
	printsingle(A);
	printsingle(B);
	printsingle(C);
	printsingle(D);
	printf("\n");
}
void MD5() {
	//test();
	initialTi();
	char in[500];
	scanf("%s", in);
	long groupT = (strlen(in) * 8) / 512 + ((strlen(in) * 8) % 512)>448?2:1;
	int padL = ((960 - ((strlen(in) * 8) % 512)) % 512) / 8; //printf("strlen:%d,padL:%d\n", strlen(in), padL);
	fillC(in, padL); 
	//for (int i = 0; i < groupT * 64; i++)printf("%d %d\n", in[i],i);
	unsigned int A, B, C, D,a,b,c,d,temp;
	A = 0x67452301;
	B = 0xefcdab89;
	C = 0x98badcfe;
	D = 0x10325476;
	for (int i = 0; i < groupT; i++) {
		a = A; b = B; c = C; d = D;
		for (int j = 0; j < 64; j++) {
			memcpy(&temp, in + 64 * i + 4 * index[j], 4);
			if (j / 16 == 0)FF(a, b, c, d, temp, si[(j / 16) * 4 + j % 4], ti[j]);
			else if (j / 16 == 1)GG(a, b, c, d, temp, si[(j / 16) * 4 + j % 4], ti[j]);
			else if (j / 16 == 2)HH(a, b, c, d, temp, si[(j / 16) * 4 + j % 4], ti[j]);
			else II(a, b, c, d, temp, si[(j / 16) * 4 + j % 4], ti[j]);
			//printf("%d %d %d %x\n", j / 16, (64 * i + 4 * index[j])/4, si[(j / 16)*4 + j % 4],ti[j]);
			//printf("%x %x %x %x\n", a, b, c, d);
			temp = d; d = c; c = b; b = a; a = temp;
		}
		A += a; B += b; C += c; D += d;
	}
	printM(A, B, C, D);
}
int main() {
	while (1)MD5();
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值