1 // Emacs style mode select -*- C++ -*-
2 //-----------------------------------------------------------------------------
3 //
4 // $Id: md5.cpp 2422 2011-08-09 02:28:24Z mike $
5 //
6 // Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
7 //
8 // This software is provided 'as-is', without any express or implied
9 // warranty. In no event will the authors be held liable for any damages
10 // arising from the use of this software.
11 //
12 // Permission is granted to anyone to use this software for any purpose,
13 // including commercial applications, and to alter it and redistribute it
14 // freely, subject to the following restrictions:
15 //
16 // 1. The origin of this software must not be misrepresented; you must not
17 // claim that you wrote the original software. If you use this software
18 // in a product, an acknowledgment in the product documentation would be
19 // appreciated but is not required.
20 // 2. Altered source versions must be plainly marked as such, and must not be
21 // misrepresented as being the original software.
22 // 3. This notice may not be removed or altered from any source distribution.
23 //
24 // L. Peter Deutsch
25 // ghost@aladdin.com
26 //
27 //
28 //
29 // Independent implementation of MD5 (RFC 1321).
30 //
31 // This code implements the MD5 Algorithm defined in RFC 1321, whose
32 // text is available at
33 // http://www.ietf.org/rfc/rfc1321.txt
34 // The code is derived from the text of the RFC, including the test suite
35 // (section A.5) but excluding the rest of Appendix A. It does not include
36 // any code or documentation that is identified in the RFC as being
37 // copyrighted.
38 //
39 // The original and principal author of md5.c is L. Peter Deutsch
40 // <ghost@aladdin.com>. Other authors are noted in the change history
41 // that follows (in reverse chronological order):
42 //
43 // 2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
44 // either statically or dynamically; added missing #include <string.h>
45 // in library.
46 // 2002-03-11 lpd Corrected argument list for main(), and added int return
47 // type, in test program and T value program.
48 // 2002-02-21 lpd Added missing #include <stdio.h> in test program.
49 // 2000-07-03 lpd Patched to eliminate warnings about "constant is
50 // unsigned in ANSI C, signed in traditional"; made test program
51 // self-checking.
52 // 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
53 // 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
54 // 1999-05-03 lpd Original version.
55 //
56 //-----------------------------------------------------------------------------
57
58
59 #include "md5.h"
60
61 #include <cstring>
62
63 #undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */
64 #ifdef ARCH_IS_BIG_ENDIAN
65 # define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
66 #else
67 # define BYTE_ORDER 0
68 #endif
69
70 #define T_MASK ((md5_word_t)~0)
71 #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
72 #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
73 #define T3 0x242070db
74 #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
75 #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
76 #define T6 0x4787c62a
77 #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
78 #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
79 #define T9 0x698098d8
80 #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
81 #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
82 #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
83 #define T13 0x6b901122
84 #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
85 #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
86 #define T16 0x49b40821
87 #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
88 #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
89 #define T19 0x265e5a51
90 #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
91 #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
92 #define T22 0x02441453
93 #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
94 #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
95 #define T25 0x21e1cde6
96 #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
97 #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
98 #define T28 0x455a14ed
99 #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
100 #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
101 #define T31 0x676f02d9
102 #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
103 #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
104 #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
105 #define T35 0x6d9d6122
106 #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
107 #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
108 #define T38 0x4bdecfa9
109 #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
110 #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
111 #define T41 0x289b7ec6
112 #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
113 #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
114 #define T44 0x04881d05
115 #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
116 #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
117 #define T47 0x1fa27cf8
118 #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
119 #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
120 #define T50 0x432aff97
121 #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
122 #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
123 #define T53 0x655b59c3
124 #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
125 #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
126 #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
127 #define T57 0x6fa87e4f
128 #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
129 #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
130 #define T60 0x4e0811a1
131 #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
132 #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
133 #define T63 0x2ad7d2bb
134 #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
135
136
137 static void
md5_process(md5_state_t * pms,const md5_byte_t * data)138 md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
139 {
140 md5_word_t
141 a = pms->abcd[0], b = pms->abcd[1],
142 c = pms->abcd[2], d = pms->abcd[3];
143 md5_word_t t;
144 #if BYTE_ORDER > 0
145 /* Define storage only for big-endian CPUs. */
146 md5_word_t X[16];
147 #else
148 /* Define storage for little-endian or both types of CPUs. */
149 md5_word_t xbuf[16];
150 const md5_word_t *X;
151 #endif
152
153 {
154 #if BYTE_ORDER == 0
155 /*
156 * Determine dynamically whether this is a big-endian or
157 * little-endian machine, since we can use a more efficient
158 * algorithm on the latter.
159 */
160 static const int w = 1;
161
162 if (*((const md5_byte_t *)&w)) /* dynamic little-endian */
163 #endif
164 #if BYTE_ORDER <= 0 /* little-endian */
165 {
166 /*
167 * On little-endian machines, we can process properly aligned
168 * data without copying it.
169 */
170 if (!((data - (const md5_byte_t *)0) & 3)) {
171 /* data are properly aligned */
172 X = (const md5_word_t *)data;
173 } else {
174 /* not aligned */
175 memcpy(xbuf, data, 64);
176 X = xbuf;
177 }
178 }
179 #endif
180 #if BYTE_ORDER == 0
181 else /* dynamic big-endian */
182 #endif
183 #if BYTE_ORDER >= 0 /* big-endian */
184 {
185 /*
186 * On big-endian machines, we must arrange the bytes in the
187 * right order.
188 */
189 const md5_byte_t *xp = data;
190 int i;
191
192 # if BYTE_ORDER == 0
193 X = xbuf; /* (dynamic only) */
194 # else
195 # define xbuf X /* (static only) */
196 # endif
197 for (i = 0; i < 16; ++i, xp += 4)
198 xbuf[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
199 }
200 #endif
201 }
202
203 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
204
205 /* Round 1. */
206 /* Let [abcd k s i] denote the operation
207 a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
208 #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
209 #define SET(a, b, c, d, k, s, Ti)\
210 t = a + F(b,c,d) + X[k] + Ti;\
211 a = ROTATE_LEFT(t, s) + b
212 /* Do the following 16 operations. */
213 SET(a, b, c, d, 0, 7, T1);
214 SET(d, a, b, c, 1, 12, T2);
215 SET(c, d, a, b, 2, 17, T3);
216 SET(b, c, d, a, 3, 22, T4);
217 SET(a, b, c, d, 4, 7, T5);
218 SET(d, a, b, c, 5, 12, T6);
219 SET(c, d, a, b, 6, 17, T7);
220 SET(b, c, d, a, 7, 22, T8);
221 SET(a, b, c, d, 8, 7, T9);
222 SET(d, a, b, c, 9, 12, T10);
223 SET(c, d, a, b, 10, 17, T11);
224 SET(b, c, d, a, 11, 22, T12);
225 SET(a, b, c, d, 12, 7, T13);
226 SET(d, a, b, c, 13, 12, T14);
227 SET(c, d, a, b, 14, 17, T15);
228 SET(b, c, d, a, 15, 22, T16);
229 #undef SET
230
231 /* Round 2. */
232 /* Let [abcd k s i] denote the operation
233 a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
234 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
235 #define SET(a, b, c, d, k, s, Ti)\
236 t = a + G(b,c,d) + X[k] + Ti;\
237 a = ROTATE_LEFT(t, s) + b
238 /* Do the following 16 operations. */
239 SET(a, b, c, d, 1, 5, T17);
240 SET(d, a, b, c, 6, 9, T18);
241 SET(c, d, a, b, 11, 14, T19);
242 SET(b, c, d, a, 0, 20, T20);
243 SET(a, b, c, d, 5, 5, T21);
244 SET(d, a, b, c, 10, 9, T22);
245 SET(c, d, a, b, 15, 14, T23);
246 SET(b, c, d, a, 4, 20, T24);
247 SET(a, b, c, d, 9, 5, T25);
248 SET(d, a, b, c, 14, 9, T26);
249 SET(c, d, a, b, 3, 14, T27);
250 SET(b, c, d, a, 8, 20, T28);
251 SET(a, b, c, d, 13, 5, T29);
252 SET(d, a, b, c, 2, 9, T30);
253 SET(c, d, a, b, 7, 14, T31);
254 SET(b, c, d, a, 12, 20, T32);
255 #undef SET
256
257 /* Round 3. */
258 /* Let [abcd k s t] denote the operation
259 a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
260 #define H(x, y, z) ((x) ^ (y) ^ (z))
261 #define SET(a, b, c, d, k, s, Ti)\
262 t = a + H(b,c,d) + X[k] + Ti;\
263 a = ROTATE_LEFT(t, s) + b
264 /* Do the following 16 operations. */
265 SET(a, b, c, d, 5, 4, T33);
266 SET(d, a, b, c, 8, 11, T34);
267 SET(c, d, a, b, 11, 16, T35);
268 SET(b, c, d, a, 14, 23, T36);
269 SET(a, b, c, d, 1, 4, T37);
270 SET(d, a, b, c, 4, 11, T38);
271 SET(c, d, a, b, 7, 16, T39);
272 SET(b, c, d, a, 10, 23, T40);
273 SET(a, b, c, d, 13, 4, T41);
274 SET(d, a, b, c, 0, 11, T42);
275 SET(c, d, a, b, 3, 16, T43);
276 SET(b, c, d, a, 6, 23, T44);
277 SET(a, b, c, d, 9, 4, T45);
278 SET(d, a, b, c, 12, 11, T46);
279 SET(c, d, a, b, 15, 16, T47);
280 SET(b, c, d, a, 2, 23, T48);
281 #undef SET
282
283 /* Round 4. */
284 /* Let [abcd k s t] denote the operation
285 a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
286 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
287 #define SET(a, b, c, d, k, s, Ti)\
288 t = a + I(b,c,d) + X[k] + Ti;\
289 a = ROTATE_LEFT(t, s) + b
290 /* Do the following 16 operations. */
291 SET(a, b, c, d, 0, 6, T49);
292 SET(d, a, b, c, 7, 10, T50);
293 SET(c, d, a, b, 14, 15, T51);
294 SET(b, c, d, a, 5, 21, T52);
295 SET(a, b, c, d, 12, 6, T53);
296 SET(d, a, b, c, 3, 10, T54);
297 SET(c, d, a, b, 10, 15, T55);
298 SET(b, c, d, a, 1, 21, T56);
299 SET(a, b, c, d, 8, 6, T57);
300 SET(d, a, b, c, 15, 10, T58);
301 SET(c, d, a, b, 6, 15, T59);
302 SET(b, c, d, a, 13, 21, T60);
303 SET(a, b, c, d, 4, 6, T61);
304 SET(d, a, b, c, 11, 10, T62);
305 SET(c, d, a, b, 2, 15, T63);
306 SET(b, c, d, a, 9, 21, T64);
307 #undef SET
308
309 /* Then perform the following additions. (That is increment each
310 of the four registers by the value it had before this block
311 was started.) */
312 pms->abcd[0] += a;
313 pms->abcd[1] += b;
314 pms->abcd[2] += c;
315 pms->abcd[3] += d;
316 }
317
318 void
md5_init(md5_state_t * pms)319 md5_init(md5_state_t *pms)
320 {
321 pms->count[0] = pms->count[1] = 0;
322 pms->abcd[0] = 0x67452301;
323 pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
324 pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
325 pms->abcd[3] = 0x10325476;
326 }
327
328 void
md5_append(md5_state_t * pms,const md5_byte_t * data,int nbytes)329 md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes)
330 {
331 const md5_byte_t *p = data;
332 int left = nbytes;
333 int offset = (pms->count[0] >> 3) & 63;
334 md5_word_t nbits = (md5_word_t)(nbytes << 3);
335
336 if (nbytes <= 0)
337 return;
338
339 /* Update the message length. */
340 pms->count[1] += nbytes >> 29;
341 pms->count[0] += nbits;
342 if (pms->count[0] < nbits)
343 pms->count[1]++;
344
345 /* Process an initial partial block. */
346 if (offset) {
347 int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
348
349 memcpy(pms->buf + offset, p, copy);
350 if (offset + copy < 64)
351 return;
352 p += copy;
353 left -= copy;
354 md5_process(pms, pms->buf);
355 }
356
357 /* Process full blocks. */
358 for (; left >= 64; p += 64, left -= 64)
359 md5_process(pms, p);
360
361 /* Process a final partial block. */
362 if (left)
363 memcpy(pms->buf, p, left);
364 }
365
366 void
md5_finish(md5_state_t * pms,md5_byte_t digest[16])367 md5_finish(md5_state_t *pms, md5_byte_t digest[16])
368 {
369 static const md5_byte_t pad[64] = {
370 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
371 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
372 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
373 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
374 };
375 md5_byte_t data[8];
376 int i;
377
378 /* Save the length before padding. */
379 for (i = 0; i < 8; ++i)
380 data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
381 /* Pad to 56 bytes mod 64. */
382 md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
383 /* Append the length. */
384 md5_append(pms, data, 8);
385 for (i = 0; i < 16; ++i)
386 digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));
387 }
388
389 // denis lukianov 2006
390 #include <string>
391 #include <sstream>
392 #include <algorithm>
393 #include <cctype>
394 #include <sstream>
395 #include <iomanip>
396
MD5SUM(const void * in,size_t size)397 std::string MD5SUM(const void *in, size_t size)
398 {
399 md5_state_t state;
400 md5_init(&state);
401
402 md5_append(&state, (const unsigned char *)in, size);
403
404 md5_byte_t digest[16];
405 md5_finish(&state, digest);
406
407 std::stringstream hash;
408
409 for(int i = 0; i < 16; i++)
410 hash << std::setw(2) << std::setfill('0') << std::hex << std::uppercase << (short)digest[i];
411
412 return hash.str();
413 }
414
MD5SUM(std::string in)415 std::string MD5SUM(std::string in)
416 {
417 return MD5SUM(in.c_str(), in.length());
418 }
419
420 #include "str_utils.h"
421
MD5SUM(const wxString & Input)422 wxString MD5SUM(const wxString &Input)
423 {
424 std::string str = MD5SUM(Input.char_str(), Input.Len());
425
426 return stdstr_towxstr(str);
427 }
428
429