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