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