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