C++实现md5加密或计算文件的唯一性识别

开发技术 作者: 2024-06-17 09:55:01
由于网络上传了很多关于C实现md5加密的类,至于那个是原创,我不敢妄加猜测,只是这里我声明我是转载的,并支持原创。对于md5加密算法,我提供两文件:#ifndef MD5_H #define MD5_H #include &ltstring&gt #include &ltfstream&gt /* Type def

由于网络上传了很多关于C++实现md5加密的类,至于那个是原创,我不敢妄加猜想,只是这里我声明我是转载的,并支持原创。

对md5加密算法,我提供两文件:

#ifndef MD5_H #define MD5_H #include <string> #include <fstream> /* Type define */ typedef unsigned char byte; typedef unsigned int uint32; using std::string; using std::ifstream; /* MD5 declaration. */ class MD5 { public: MD5(); MD5(const void* input,size_t length); MD5(const string& str); MD5(ifstream& in); void update(const void* input,size_t length); void update(const string& str); void update(ifstream& in); const byte* digest(); string toString(); void reset(); string ToMD5(const string& str);//如此,只需调用该函数便完成加密进程 private: void update(const byte* input,size_t length); void final(); void transform(const byte block[64]); void encode(const uint32* input,byte* output,size_t length); void decode(const byte* input,uint32* output,size_t length); string bytesToHexString(const byte* input,size_t length); /* class uncopyable */ MD5(const MD5&); MD5& operator=(const MD5&); private: uint32 _state[4]; /* state (ABCD) */ uint32 _count[2]; /* number of bits,modulo 2^64 (low-order word first) */ byte _buffer[64]; /* input buffer */ byte _digest[16]; /* message digest */ bool _finished; /* calculate finished ? */ static const byte PADDING[64]; /* padding for calculate */ static const char HEX[16]; enum { BUFFER_SIZE = 1024 }; }; #endif /*MD5_H*/

#include "md5.h" #include "string.h" const string MD5_Key="wow"; using namespace std; /* Constants for MD5Transform routine. */ #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,z) (((x) & (z)) | ((y) & (~z))) #define H(x,z) ((x) ^ (y) ^ (z)) #define I(x,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. Rotation is separate from addition to prevent recomputation. */ #define FF(a,b,c,d,x,s,ac) { (a) += F ((b),(c),(d)) + (x) + ac; (a) = ROTATE_LEFT ((a),(s)); (a) += (b); } #define GG(a,ac) { (a) += G ((b),(s)); (a) += (b); } #define HH(a,ac) { (a) += H ((b),(s)); (a) += (b); } #define II(a,ac) { (a) += I ((b),(s)); (a) += (b); } const byte MD5::PADDING[64] = { 0x80 }; const char MD5::HEX[16] = { '0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f' }; /* Default construct. */ MD5::MD5() { reset(); } /* Construct a MD5 object with a input buffer. */ MD5::MD5(const void* input,size_t length) { reset(); update(input,length); } /* Construct a MD5 object with a string. */ MD5::MD5(const string& str) { reset(); update(str); } /* Construct a MD5 object with a file. */ MD5::MD5(ifstream& in) { reset(); update(in); } /* Return the message-digest */ const byte* MD5::digest() { if (!_finished) { _finished = true; final(); } return _digest; } /* Reset the calculate state */ void MD5::reset() { _finished = false; /* reset number of bits. */ _count[0] = _count[1] = 0; /* Load magic initialization constants. */ _state[0] = 0x67452301; _state[1] = 0xefcdab89; _state[2] = 0x98badcfe; _state[3] = 0x10325476; } /* Updating the context with a input buffer. */ void MD5::update(const void* input,size_t length) { update((const byte*)input,length); } /* Updating the context with a string. */ void MD5::update(const string& str) { update((const byte*)str.c_str(),str.length()); } /* Updating the context with a file. */ void MD5::update(ifstream& in) { if (!in) { return; } std::streamsize length; char buffer[BUFFER_SIZE]; while (!in.eof()) { in.read(buffer,BUFFER_SIZE); length = in.gcount(); if (length > 0) { update(buffer,length); } } in.close(); } /* MD5 block update operation. Continues an MD5 message-digest operation,processing another message block,and updating the context. */ void MD5::update(const byte* input,size_t length) { uint32 i,index,partLen; _finished = false; /* Compute number of bytes mod 64 */ index = (uint32)((_count[0] >> 3) & 0x3f); /* update number of bits */ if ((_count[0] += ((uint32)length << 3)) < ((uint32)length << 3)) { ++_count[1]; } _count[1] += ((uint32)length >> 29); partLen = 64 - index; /* transform as many times as possible. */ if (length >= partLen) { memcpy(&_buffer[index],input,partLen); transform(_buffer); for (i = partLen; i + 63 < length; i += 64) { transform(&input[i]); } index = 0; } else { i = 0; } /* Buffer remaining input */ memcpy(&_buffer[index],&input[i],length - i); } /* MD5 finalization. Ends an MD5 message-_digest operation,writing the the message _digest and zeroizing the context. */ void MD5::final() { byte bits[8]; uint32 oldState[4]; uint32 oldCount[2]; uint32 index,padLen; /* Save current state and count. */ memcpy(oldState,_state,16); memcpy(oldCount,_count,8); /* Save number of bits */ encode(_count,bits,8); /* Pad out to 56 mod 64. */ index = (uint32)((_count[0] >> 3) & 0x3f); padLen = (index < 56) ? (56 - index) : (120 - index); update(PADDING,padLen); /* Append length (before padding) */ update(bits,8); /* Store state in digest */ encode(_state,_digest,16); /* Restore current state and count. */ memcpy(_state,oldState,16); memcpy(_count,oldCount,8); } /* MD5 basic transformation. Transforms _state based on block. */ void MD5::transform(const byte block[64]) { uint32 a = _state[0],b = _state[1],c = _state[2],d = _state[3],x[16]; decode(block,64); /* Round 1 */ FF (a,x[ 0],S11,0xd76aa478); /* 1 */ FF (d,a,x[ 1],S12,0xe8c7b756); /* 2 */ FF (c,x[ 2],S13,0x242070db); /* 3 */ FF (b,x[ 3],S14,0xc1bdceee); /* 4 */ FF (a,x[ 4],0xf57c0faf); /* 5 */ FF (d,x[ 5],0x4787c62a); /* 6 */ FF (c,x[ 6],0xa8304613); /* 7 */ FF (b,x[ 7],0xfd469501); /* 8 */ FF (a,x[ 8],0x698098d8); /* 9 */ FF (d,x[ 9],0x8b44f7af); /* 10 */ FF (c,x[10],0xffff5bb1); /* 11 */ FF (b,x[11],0x895cd7be); /* 12 */ FF (a,x[12],0x6b901122); /* 13 */ FF (d,x[13],0xfd987193); /* 14 */ FF (c,x[14],0xa679438e); /* 15 */ FF (b,x[15],0x49b40821); /* 16 */ /* Round 2 */ GG (a,S21,0xf61e2562); /* 17 */ GG (d,S22,0xc040b340); /* 18 */ GG (c,S23,0x265e5a51); /* 19 */ GG (b,S24,0xe9b6c7aa); /* 20 */ GG (a,0xd62f105d); /* 21 */ GG (d,0x2441453); /* 22 */ GG (c,0xd8a1e681); /* 23 */ GG (b,0xe7d3fbc8); /* 24 */ GG (a,0x21e1cde6); /* 25 */ GG (d,0xc33707d6); /* 26 */ GG (c,0xf4d50d87); /* 27 */ GG (b,0x455a14ed); /* 28 */ GG (a,0xa9e3e905); /* 29 */ GG (d,0xfcefa3f8); /* 30 */ GG (c,0x676f02d9); /* 31 */ GG (b,0x8d2a4c8a); /* 32 */ /* Round 3 */ HH (a,S31,0xfffa3942); /* 33 */ HH (d,S32,0x8771f681); /* 34 */ HH (c,S33,0x6d9d6122); /* 35 */ HH (b,S34,0xfde5380c); /* 36 */ HH (a,0xa4beea44); /* 37 */ HH (d,0x4bdecfa9); /* 38 */ HH (c,0xf6bb4b60); /* 39 */ HH (b,0xbebfbc70); /* 40 */ HH (a,0x289b7ec6); /* 41 */ HH (d,0xeaa127fa); /* 42 */ HH (c,0xd4ef3085); /* 43 */ HH (b,0x4881d05); /* 44 */ HH (a,0xd9d4d039); /* 45 */ HH (d,0xe6db99e5); /* 46 */ HH (c,0x1fa27cf8); /* 47 */ HH (b,0xc4ac5665); /* 48 */ /* Round 4 */ II (a,S41,0xf4292244); /* 49 */ II (d,S42,0x432aff97); /* 50 */ II (c,S43,0xab9423a7); /* 51 */ II (b,S44,0xfc93a039); /* 52 */ II (a,0x655b59c3); /* 53 */ II (d,0x8f0ccc92); /* 54 */ II (c,0xffeff47d); /* 55 */ II (b,0x85845dd1); /* 56 */ II (a,0x6fa87e4f); /* 57 */ II (d,0xfe2ce6e0); /* 58 */ II (c,0xa3014314); /* 59 */ II (b,0x4e0811a1); /* 60 */ II (a,0xf7537e82); /* 61 */ II (d,0xbd3af235); /* 62 */ II (c,0x2ad7d2bb); /* 63 */ II (b,0xeb86d391); /* 64 */ _state[0] += a; _state[1] += b; _state[2] += c; _state[3] += d; } /* Encodes input (ulong) into output (byte). Assumes length is a multiple of 4. */ void MD5::encode(const uint32* input,size_t length) { for (size_t i = 0,j = 0; j < length; ++i,j += 4) { output[j]= (byte)(input[i] & 0xff); output[j + 1] = (byte)((input[i] >> 8) & 0xff); output[j + 2] = (byte)((input[i] >> 16) & 0xff); output[j + 3] = (byte)((input[i] >> 24) & 0xff); } } /* Decodes input (byte) into output (ulong). Assumes length is a multiple of 4. */ void MD5::decode(const byte* input,j += 4) { output[i] = ((uint32)input[j]) | (((uint32)input[j + 1]) << 8) | (((uint32)input[j + 2]) << 16) | (((uint32)input[j + 3]) << 24); } } /* Convert byte array to hex string. */ string MD5::bytesToHexString(const byte* input,size_t length) { string str; str.reserve(length << 1); for (size_t i = 0; i < length; ++i) { int t = input[i]; int a = t / 16; int b = t % 16; str.append(1,HEX[a]); str.append(1,HEX[b]); } return str; } /* Convert digest to string value */ string MD5::toString() { return bytesToHexString(digest(),16); } string MD5::ToMD5(const string& str) //MD5加密,其中密钥key=xyf,密钥需加在加密之前 { const string str_word=str+MD5_Key; reset(); update(str_word); return toString(); }

那末如何调用呢?

MD5 md5; //定义MD5的类 md5.update("xxxxxx");//由于update函数只接收string类型,所以使用getbuffer()函数转换CString为string char*p = md5.toString().c_str();
不过值得注意的是你如果还要计算另外一个字符串的md5值,那末你得调用md5.reset()方法重置

原创声明
本站部分文章基于互联网的整理,我们会把真正“有用/优质”的文章整理提供给各位开发者。本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。
本文链接:http://www.jiecseo.com/news/show_28585.html