//原始代碼是網上找的，但存在問題，代碼有缺句，而且處理的資料長度有限制
//已完善代碼，解決了資料長度限制的問題
//注意匯編宏代碼行末的\之后不能有任何內容，否則會影響展開，在這點上吃過虧，特此提醒一下。
#include <vcl.h>
struct MD5_CTX {
unsigned int state[4]; //encypted message context. state[0]是32位的無符號整數，注意記憶體位元組順序
unsigned long long count;
char str[33] = {0} ;
unsigned char buffer[64];
};
#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
#define a esi
#define b edi
#define c edx
#define d ebx
#define tmp1 eax
#define tmp2 ecx
#define x(i) [x+4*i]
#define FF(a, b, c, d, x, s, ac) \
__asm mov tmp1,b \
__asm and tmp1,c \
__asm mov tmp2,b \
__asm not tmp2 \
__asm and tmp2,d \
__asm or tmp2,tmp1 \
__asm lea a,[tmp2+a+ac] \
__asm add a,x \
__asm rol a,s \
__asm add a,b
#define GG(a, b, c, d, x, s, ac) \
__asm mov tmp1,b \
__asm and tmp1,d \
__asm mov tmp2,d \
__asm not tmp2 \
__asm and tmp2,c \
__asm or tmp2,tmp1 \
__asm lea a,[tmp2+a+ac] \
__asm add a,x \
__asm rol a,s \
__asm add a,b
#define HH(a,b,c, d, x, s, ac) \
__asm mov tmp2,b \
__asm xor tmp2,c \
__asm xor tmp2,d \
__asm lea a,[tmp2+a+ac] \
__asm add a,x \
__asm rol a,s \
__asm add a,b
#define II(a, b, c, d, x, s, ac) \
__asm mov tmp2,d \
__asm not tmp2 \
__asm or tmp2,b \
__asm xor tmp2,c \
__asm lea a,[tmp2+a+ac] \
__asm add a,x \
__asm rol a,s \
__asm add a,b
static unsigned char PADDING[64] = {
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
static void MD5Transform (unsigned int *state, unsigned char *block)
{
DWORD x[16];
__asm
{
mov tmp1, DWORD PTR [state]
mov a, DWORD PTR [tmp1]
mov b, DWORD PTR [tmp1+4]
mov c, DWORD PTR [tmp1+8]
mov d, DWORD PTR [tmp1+12]
push esi
push edi
xor ecx, ecx
mov esi, DWORD PTR [block]
lea edi, [x]
ROLL:
mov eax, DWORD PTR [esi+ecx]
mov DWORD PTR [edi+ecx], eax
add ecx, 4
cmp ecx, 64
jb ROLL
pop edi
pop esi
}
// Round 1
FF (a, b, c, d, x(0), S11, 0xd76aa478);
FF (d, a, b, c, x(1), S12, 0xe8c7b756);
FF (c, d, a, b, x(2), S13, 0x242070db);
FF (b, c, d, a, x(3), S14, 0xc1bdceee);
FF (a, b, c, d, x(4), S11, 0xf57c0faf);
FF (d, a, b, c, x(5), S12, 0x4787c62a);
FF (c, d, a, b, x(6), S13, 0xa8304613);
FF (b, c, d, a, x(7), S14, 0xfd469501);
FF (a, b, c, d, x(8), S11, 0x698098d8);
FF (d, a, b, c, x(9), S12, 0x8b44f7af);
FF (c, d, a, b, x(10), S13, 0xffff5bb1);
FF (b, c, d, a, x(11), S14, 0x895cd7be);
FF (a, b, c, d, x(12), S11, 0x6b901122);
FF (d, a, b, c, x(13), S12, 0xfd987193);
FF (c, d, a, b, x(14), S13, 0xa679438e);
FF (b, c, d, a, x(15), S14, 0x49b40821);
// Round 2
GG (a, b, c, d, x(1), S21, 0xf61e2562);
GG (d, a, b, c, x(6), S22, 0xc040b340);
GG (c, d, a, b, x(11), S23, 0x265e5a51);
GG (b, c, d, a, x(0), S24, 0xe9b6c7aa);
GG (a, b, c, d, x(5), S21, 0xd62f105d);
GG (d, a, b, c, x(10), S22, 0x2441453);
GG (c, d, a, b, x(15), S23, 0xd8a1e681);
GG (b, c, d, a, x(4), S24, 0xe7d3fbc8);
GG (a, b, c, d, x(9), S21, 0x21e1cde6);
GG (d, a, b, c, x(14), S22, 0xc33707d6);
GG (c, d, a, b, x(3), S23, 0xf4d50d87);
GG (b, c, d, a, x(8), S24, 0x455a14ed);
GG (a, b, c, d, x(13), S21, 0xa9e3e905);
GG (d, a, b, c, x(2), S22, 0xfcefa3f8);
GG (c, d, a, b, x(7), S23, 0x676f02d9);
GG (b, c, d, a, x(12), S24, 0x8d2a4c8a);
// Round 3
HH (a, b, c, d, x(5), S31, 0xfffa3942);
HH (d, a, b, c, x(8), S32, 0x8771f681);
HH (c, d, a, b, x(11), S33, 0x6d9d6122);
HH (b, c, d, a, x(14), S34, 0xfde5380c);
HH (a, b, c, d, x(1), S31, 0xa4beea44);
HH (d, a, b, c, x(4), S32, 0x4bdecfa9);
HH (c, d, a, b, x(7), S33, 0xf6bb4b60);
HH (b, c, d, a, x(10), S34, 0xbebfbc70);
HH (a, b, c, d, x(13), S31, 0x289b7ec6);
HH (d, a, b, c, x(0), S32, 0xeaa127fa);
HH (c, d, a, b, x(3), S33, 0xd4ef3085);
HH (b, c, d, a, x(6), S34, 0x4881d05);
HH (a, b, c, d, x(9), S31, 0xd9d4d039);
HH (d, a, b, c, x(12), S32, 0xe6db99e5);
HH (c, d, a, b, x(15), S33, 0x1fa27cf8);
HH (b, c, d, a, x(2), S34, 0xc4ac5665);
// Round 4
II (a, b, c, d, x(0), S41, 0xf4292244);
II (d, a, b, c, x(7), S42, 0x432aff97);
II (c, d, a, b, x(14), S43, 0xab9423a7);
II (b, c, d, a, x(5), S44, 0xfc93a039);
II (a, b, c, d, x(12), S41, 0x655b59c3);
II (d, a, b, c, x(3), S42, 0x8f0ccc92);
II (c, d, a, b, x(10), S43, 0xffeff47d);
II (b, c, d, a, x(1), S44, 0x85845dd1);
II (a, b, c, d, x(8), S41, 0x6fa87e4f);
II (d, a, b, c, x(15), S42, 0xfe2ce6e0);
II (c, d, a, b, x(6), S43, 0xa3014314);
II (b, c, d, a, x(13), S44, 0x4e0811a1);
II (a, b, c, d, x(4), S41, 0xf7537e82);
II (d, a, b, c, x(11), S42, 0xbd3af235);
II (c, d, a, b, x(2), S43, 0x2ad7d2bb);
II (b, c, d, a, x(9), S44, 0xeb86d391);
__asm
{
mov tmp1, DWORD PTR [state]
add DWORD PTR [tmp1], a
add DWORD PTR [tmp1+4], b
add DWORD PTR [tmp1+8], c
add DWORD PTR [tmp1+12], d
}
}
static void MD5Init (MD5_CTX &context)
{
context.count = 0;
context.state[0] = 0x67452301;
context.state[1] = 0xefcdab89;
context.state[2] = 0x98badcfe;
context.state[3] = 0x10325476;
}
static void MD5Update (MD5_CTX &context, unsigned char *in, unsigned int inLen)
{
unsigned int i, index, partLen ;
index = (context.count >> 3) & 0x3Full ; //此前已讀入的資料位元組數模除64，得出不足64位元組的部分，此部分應在此前存入buffer
context.count += (inLen << 3) ; //加本次新增的資料位元位數（位元組數*8）
partLen = 64 - index; //64位元組buffer剩余空間
if (inLen < partLen) i = 0 ;
else {
CopyMemory (&context.buffer[index], in, partLen) ; //先裝滿buffer，最后一次Final會確保裝滿
MD5Transform (context.state, context.buffer) ; //裝滿后運算之
index = 0 ; //索引復位
for (i = partLen; i + 63 < inLen; i += 64) MD5Transform (context.state, in + i) ; //如果后續位元組滿64，則繼續運算之
}
CopyMemory (&context.buffer[index], in + i, inLen - i); //不足64位元組的部分讀入buffer，待MD5Final時運算
}
static void MD5Final (MD5_CTX &context)
{
unsigned int index, padLen ;
unsigned long long bits = context.count ;
index = (context.count >> 3) & 0x3Full ;
padLen = (index < 56) ? (56 - index) : (120 - index) ;
MD5Update (context, PADDING, padLen); //填充一個2進制的1和若干個0使其長度模512與448同余
MD5Update (context, (unsigned char*)&bits, 8); //資料的真實長度以64bit表示附加在填充結果后面
unsigned char* p = (unsigned char*)context.state ; //將數值解碼為字串
for (int i = 0; i < 16; i++) {
unsigned char j ;
j = p[i] & 0xF ; if (j < 10) context.str[i*2+1] = j + '0' ; else context.str[i*2+1] = j - 10 + 'a' ; //需要大寫MD5碼將此處的a改為A即可
j = p[i] >> 4 ; if (j < 10) context.str[i*2] = j + '0' ; else context.str[i*2] = j - 10 + 'a' ;
}
}
//========================================================================
//以下是用于C++builder的封裝，不用可以連同檔案首行的 #include <vcl.h>一起刪去
UnicodeString MD5_String (unsigned char* buff, unsigned int len)
{
int ok = 0;
MD5_CTX context;
try {
MD5Init (context);
MD5Update (context, buff, len);
MD5Final (context);
ok = 1;
}
catch(...) {
ok = 0;
}
if (ok == 0) return L"" ; //如果出錯則回傳空字串
else return context.str ;
}
//========================================================================
UnicodeString MD5_File(const UnicodeString filename)
{
if (!FileExists(filename)) return L"" ;
int len, ok = 0;
FILE *fp = NULL;
MD5_CTX context;
unsigned char* buf = NULL;
fp = _wfopen (filename.c_str(), L"rb") ;
if (NULL == fp) return L"" ;
try {
try {
buf = new unsigned char[20480]; //每次讀入檔案的位元組數，這個數字可以根據需要更改
MD5Init (context);
while (0 != (len = fread (buf, 1, 20480, fp))) MD5Update (context, buf, len);
MD5Final (context);
ok = 1;
}
catch (...) {
ok = 0 ;
}
}
__finally {
delete[] buf ;
fclose (fp) ;
}
if (ok == 0) return L""; //如果出錯則回傳空字串
else return context.str;
}
//========================================================================
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/237329.html
標籤：基礎類
下一篇：職工作業量統計系統真的難寫