MFMD5.cpp 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383
  1. /*
  2. * RFC 1321 compliant MD5 implementation,
  3. * by Christophe Devine <devine@cr0.net>;
  4. * this program is licensed under the GPL.
  5. */
  6. #include "MFMD5.h"
  7. #include <stdio.h>
  8. #include <stdlib.h>
  9. #include <string.h>
  10. namespace mf
  11. {
  12. #define GET_UINT32(n,b,i) \
  13. { \
  14. (n) = (uint32) ((uint8 *) b)[(i)] \
  15. | (((uint32) ((uint8 *) b)[(i)+1]) << 8) \
  16. | (((uint32) ((uint8 *) b)[(i)+2]) << 16) \
  17. | (((uint32) ((uint8 *) b)[(i)+3]) << 24); \
  18. }
  19. #define PUT_UINT32(n,b,i) \
  20. { \
  21. (((uint8 *) b)[(i)] ) = (uint8) (((n) ) & 0xFF); \
  22. (((uint8 *) b)[(i)+1]) = (uint8) (((n) >> 8) & 0xFF); \
  23. (((uint8 *) b)[(i)+2]) = (uint8) (((n) >> 16) & 0xFF); \
  24. (((uint8 *) b)[(i)+3]) = (uint8) (((n) >> 24) & 0xFF); \
  25. }
  26. #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
  27. #define P(a,b,c,d,k,s,t) \
  28. { \
  29. a += F(b,c,d) + X[k] + t; a = S(a,s) + b; \
  30. }
  31. //extern pthread_mutex_t mutexMemory;
  32. void CMD5::md5_starts( struct md5_context *ctx )
  33. {
  34. ctx->total[0] = 0;
  35. ctx->total[1] = 0;
  36. ctx->state[0] = 0x67452301;
  37. ctx->state[1] = 0xEFCDAB89;
  38. ctx->state[2] = 0x98BADCFE;
  39. ctx->state[3] = 0x10325476;
  40. }
  41. void CMD5::md5_process( struct md5_context *ctx, uint8 data[64] )
  42. {
  43. uint32 A, B, C, D, X[16];
  44. GET_UINT32( X[0], data, 0 );
  45. GET_UINT32( X[1], data, 4 );
  46. GET_UINT32( X[2], data, 8 );
  47. GET_UINT32( X[3], data, 12 );
  48. GET_UINT32( X[4], data, 16 );
  49. GET_UINT32( X[5], data, 20 );
  50. GET_UINT32( X[6], data, 24 );
  51. GET_UINT32( X[7], data, 28 );
  52. GET_UINT32( X[8], data, 32 );
  53. GET_UINT32( X[9], data, 36 );
  54. GET_UINT32( X[10], data, 40 );
  55. GET_UINT32( X[11], data, 44 );
  56. GET_UINT32( X[12], data, 48 );
  57. GET_UINT32( X[13], data, 52 );
  58. GET_UINT32( X[14], data, 56 );
  59. GET_UINT32( X[15], data, 60 );
  60. A = ctx->state[0];
  61. B = ctx->state[1];
  62. C = ctx->state[2];
  63. D = ctx->state[3];
  64. #define F(x,y,z) (z ^ (x & (y ^ z)))
  65. P( A, B, C, D, 0, 7, 0xD76AA478 );
  66. P( D, A, B, C, 1, 12, 0xE8C7B756 );
  67. P( C, D, A, B, 2, 17, 0x242070DB );
  68. P( B, C, D, A, 3, 22, 0xC1BDCEEE );
  69. P( A, B, C, D, 4, 7, 0xF57C0FAF );
  70. P( D, A, B, C, 5, 12, 0x4787C62A );
  71. P( C, D, A, B, 6, 17, 0xA8304613 );
  72. P( B, C, D, A, 7, 22, 0xFD469501 );
  73. P( A, B, C, D, 8, 7, 0x698098D8 );
  74. P( D, A, B, C, 9, 12, 0x8B44F7AF );
  75. P( C, D, A, B, 10, 17, 0xFFFF5BB1 );
  76. P( B, C, D, A, 11, 22, 0x895CD7BE );
  77. P( A, B, C, D, 12, 7, 0x6B901122 );
  78. P( D, A, B, C, 13, 12, 0xFD987193 );
  79. P( C, D, A, B, 14, 17, 0xA679438E );
  80. P( B, C, D, A, 15, 22, 0x49B40821 );
  81. #undef F
  82. #define F(x,y,z) (y ^ (z & (x ^ y)))
  83. P( A, B, C, D, 1, 5, 0xF61E2562 );
  84. P( D, A, B, C, 6, 9, 0xC040B340 );
  85. P( C, D, A, B, 11, 14, 0x265E5A51 );
  86. P( B, C, D, A, 0, 20, 0xE9B6C7AA );
  87. P( A, B, C, D, 5, 5, 0xD62F105D );
  88. P( D, A, B, C, 10, 9, 0x02441453 );
  89. P( C, D, A, B, 15, 14, 0xD8A1E681 );
  90. P( B, C, D, A, 4, 20, 0xE7D3FBC8 );
  91. P( A, B, C, D, 9, 5, 0x21E1CDE6 );
  92. P( D, A, B, C, 14, 9, 0xC33707D6 );
  93. P( C, D, A, B, 3, 14, 0xF4D50D87 );
  94. P( B, C, D, A, 8, 20, 0x455A14ED );
  95. P( A, B, C, D, 13, 5, 0xA9E3E905 );
  96. P( D, A, B, C, 2, 9, 0xFCEFA3F8 );
  97. P( C, D, A, B, 7, 14, 0x676F02D9 );
  98. P( B, C, D, A, 12, 20, 0x8D2A4C8A );
  99. #undef F
  100. #define F(x,y,z) (x ^ y ^ z)
  101. P( A, B, C, D, 5, 4, 0xFFFA3942 );
  102. P( D, A, B, C, 8, 11, 0x8771F681 );
  103. P( C, D, A, B, 11, 16, 0x6D9D6122 );
  104. P( B, C, D, A, 14, 23, 0xFDE5380C );
  105. P( A, B, C, D, 1, 4, 0xA4BEEA44 );
  106. P( D, A, B, C, 4, 11, 0x4BDECFA9 );
  107. P( C, D, A, B, 7, 16, 0xF6BB4B60 );
  108. P( B, C, D, A, 10, 23, 0xBEBFBC70 );
  109. P( A, B, C, D, 13, 4, 0x289B7EC6 );
  110. P( D, A, B, C, 0, 11, 0xEAA127FA );
  111. P( C, D, A, B, 3, 16, 0xD4EF3085 );
  112. P( B, C, D, A, 6, 23, 0x04881D05 );
  113. P( A, B, C, D, 9, 4, 0xD9D4D039 );
  114. P( D, A, B, C, 12, 11, 0xE6DB99E5 );
  115. P( C, D, A, B, 15, 16, 0x1FA27CF8 );
  116. P( B, C, D, A, 2, 23, 0xC4AC5665 );
  117. #undef F
  118. #define F(x,y,z) (y ^ (x | ~z))
  119. P( A, B, C, D, 0, 6, 0xF4292244 );
  120. P( D, A, B, C, 7, 10, 0x432AFF97 );
  121. P( C, D, A, B, 14, 15, 0xAB9423A7 );
  122. P( B, C, D, A, 5, 21, 0xFC93A039 );
  123. P( A, B, C, D, 12, 6, 0x655B59C3 );
  124. P( D, A, B, C, 3, 10, 0x8F0CCC92 );
  125. P( C, D, A, B, 10, 15, 0xFFEFF47D );
  126. P( B, C, D, A, 1, 21, 0x85845DD1 );
  127. P( A, B, C, D, 8, 6, 0x6FA87E4F );
  128. P( D, A, B, C, 15, 10, 0xFE2CE6E0 );
  129. P( C, D, A, B, 6, 15, 0xA3014314 );
  130. P( B, C, D, A, 13, 21, 0x4E0811A1 );
  131. P( A, B, C, D, 4, 6, 0xF7537E82 );
  132. P( D, A, B, C, 11, 10, 0xBD3AF235 );
  133. P( C, D, A, B, 2, 15, 0x2AD7D2BB );
  134. P( B, C, D, A, 9, 21, 0xEB86D391 );
  135. #undef F
  136. ctx->state[0] += A;
  137. ctx->state[1] += B;
  138. ctx->state[2] += C;
  139. ctx->state[3] += D;
  140. }
  141. void CMD5::md5_update( struct md5_context *ctx, uint8 *input, uint32 length )
  142. {
  143. uint32 left, fill;
  144. if( ! length ) return;
  145. left = ( ctx->total[0] >> 3 ) & 0x3F;
  146. fill = 64 - left;
  147. ctx->total[0] += length << 3;
  148. ctx->total[1] += length >> 29;
  149. ctx->total[0] &= 0xFFFFFFFF;
  150. ctx->total[1] += ctx->total[0] < length << 3;
  151. if( left && length >= fill )
  152. {
  153. memcpy( (void *) (ctx->buffer + left), (void *) input, fill );
  154. md5_process( ctx, ctx->buffer );
  155. length -= fill;
  156. input += fill;
  157. left = 0;
  158. }
  159. while( length >= 64 )
  160. {
  161. md5_process( ctx, input );
  162. length -= 64;
  163. input += 64;
  164. }
  165. if( length )
  166. {
  167. memcpy( (void *) (ctx->buffer + left), (void *) input, length );
  168. }
  169. }
  170. static uint8 md5_padding[64] =
  171. {
  172. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  173. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  174. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  175. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  176. };
  177. void CMD5::md5_finish( struct md5_context *ctx, uint8 digest[16] )
  178. {
  179. uint32 last, padn;
  180. uint8 msglen[8];
  181. PUT_UINT32( ctx->total[0], msglen, 0 );
  182. PUT_UINT32( ctx->total[1], msglen, 4 );
  183. last = ( ctx->total[0] >> 3 ) & 0x3F;
  184. padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
  185. md5_update( ctx, md5_padding, padn );
  186. md5_update( ctx, msglen, 8 );
  187. PUT_UINT32( ctx->state[0], digest, 0 );
  188. PUT_UINT32( ctx->state[1], digest, 4 );
  189. PUT_UINT32( ctx->state[2], digest, 8 );
  190. PUT_UINT32( ctx->state[3], digest, 12 );
  191. }
  192. void CMD5::GenerateMD5(unsigned char* buffer,int bufferlen)
  193. {
  194. struct md5_context context;
  195. md5_starts (&context);
  196. md5_update (&context, buffer, bufferlen);
  197. md5_finish (&context,(unsigned char*)m_data);
  198. }
  199. void CMD5::GenerateMD5( const char * src_file )
  200. {
  201. ifstream inF(src_file, ios::binary);
  202. if(inF)
  203. {
  204. GenerateMD5(inF);
  205. inF.close();
  206. }
  207. }
  208. void CMD5::GenerateMD5( ifstream &in )
  209. {
  210. struct md5_context context;
  211. md5_starts (&context);
  212. std::streamsize length;
  213. char buffer[1024] = {0};
  214. while (!in.eof()) {
  215. in.read(buffer, 1024);
  216. length = in.gcount();
  217. if (length > 0) {
  218. md5_update(&context,(uint8 *)(buffer), length);
  219. }
  220. }
  221. md5_finish (&context,(unsigned char*)m_data);
  222. }
  223. CMD5::CMD5()
  224. {
  225. for(int i=0;i<4;i++)
  226. m_data[i]=0;
  227. }
  228. CMD5::CMD5(unsigned long* md5src)
  229. {
  230. memcpy(m_data,md5src,16);
  231. }
  232. int _httoi(const char *value)
  233. {
  234. struct CHexMap
  235. {
  236. char chr;
  237. int value;
  238. };
  239. const int HexMapL = 16;
  240. CHexMap HexMap[HexMapL] =
  241. {
  242. {'0', 0}, {'1', 1},
  243. {'2', 2}, {'3', 3},
  244. {'4', 4}, {'5', 5},
  245. {'6', 6}, {'7', 7},
  246. {'8', 8}, {'9', 9},
  247. {'a', 10}, {'b', 11},
  248. {'c', 12}, {'d', 13},
  249. {'e', 14}, {'f', 15}
  250. };
  251. //pthread_mutex_lock(&mutexMemory);
  252. char *mstr = strdup(value);
  253. //pthread_mutex_unlock(&mutexMemory);
  254. char *s = mstr;
  255. int result = 0;
  256. if (*s == '0' && *(s + 1) == 'X') s += 2;
  257. bool firsttime = true;
  258. while (*s != '/0')
  259. {
  260. bool found = false;
  261. for (int i = 0; i < HexMapL; i++)
  262. {
  263. if (*s == HexMap[i].chr)
  264. {
  265. if (!firsttime) result <<= 4;
  266. result |= HexMap[i].value;
  267. found = true;
  268. break;
  269. }
  270. }
  271. if (!found) break;
  272. s++;
  273. firsttime = false;
  274. }
  275. //pthread_mutex_lock(&mutexMemory);
  276. free(mstr);
  277. //pthread_mutex_unlock(&mutexMemory);
  278. return result;
  279. }
  280. CMD5::CMD5(const char* md5src)
  281. {
  282. if (strcmp(md5src,"")==0)
  283. {
  284. for(int i=0;i<4;i++)
  285. m_data[i]=0;
  286. return;
  287. }
  288. for(int j = 0; j < 16; j++ )
  289. {
  290. char buf[10];
  291. strncpy(buf,md5src,2);
  292. md5src+=2;
  293. ((unsigned char*)m_data)[j] = _httoi(buf);
  294. }
  295. }
  296. CMD5 CMD5::operator +(CMD5 adder)
  297. {
  298. unsigned long m_newdata[4];
  299. for(int i=0;i<4;i++)
  300. m_newdata[i]=m_data[i]^(adder.m_data[i]);
  301. return CMD5(m_newdata);
  302. }
  303. bool CMD5::operator ==(CMD5 cmper)
  304. {
  305. return (memcmp(cmper.m_data ,m_data,16)==0);
  306. }
  307. //void CMD5::operator =(CMD5 equer)
  308. //{
  309. // memcpy(m_data,equer.m_data ,16);
  310. //}
  311. string CMD5::ToString()
  312. {
  313. char output[33];
  314. for(int j = 0; j < 16; j++ )
  315. {
  316. sprintf( output + j * 2, "%02x", ((unsigned char*)m_data)[j]);
  317. }
  318. return string(output);
  319. }
  320. };
  321. bool _Md5_CheckFile(const char * srcFile, unsigned char* dst)
  322. {
  323. mf::CMD5 md5;
  324. md5.GenerateMD5(srcFile);
  325. string outstr = md5.ToString();
  326. memcpy(dst, outstr.c_str(), 32);
  327. return true;
  328. }