|
25
|
1 /* |
|
|
2 Copyright (C) 1999 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 /* |
|
|
25 Independent implementation of MD5 (RFC 1321). |
|
|
26 |
|
|
27 This code implements the MD5 Algorithm defined in RFC 1321. |
|
|
28 It is derived directly from the text of the RFC and not from the |
|
|
29 reference implementation. |
|
|
30 |
|
|
31 The original and principal author of md5.c is L. Peter Deutsch |
|
|
32 <ghost@aladdin.com>. Other authors are noted in the change history |
|
|
33 that follows (in reverse chronological order): |
|
|
34 |
|
|
35 1999-11-04 lpd Edited comments slightly for automatic TOC extraction. |
|
|
36 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5). |
|
|
37 1999-05-03 lpd Original version. |
|
|
38 */ |
|
|
39 |
|
|
40 #if HAVE_CONFIG_H |
|
|
41 # include <config.h> |
|
|
42 #endif |
|
|
43 |
|
|
44 #include "md5.h" |
|
|
45 |
|
|
46 #if STDC_HEADERS |
|
|
47 # include <string.h> |
|
|
48 #else |
|
|
49 # if !HAVE_STRCHR |
|
|
50 # define strchr index |
|
|
51 # define strrchr rindex |
|
|
52 # endif |
|
|
53 char *strchr (), *strrchr (); |
|
|
54 # if !HAVE_MEMCPY |
|
|
55 # define memcpy(d, s, n) bcopy ((s), (d), (n)) |
|
|
56 # define memmove(d, s, n) bcopy ((s), (d), (n)) |
|
|
57 # endif |
|
|
58 #endif |
|
|
59 |
|
|
60 #ifdef TEST |
|
|
61 /* |
|
|
62 * Compile with -DTEST to create a self-contained executable test program. |
|
|
63 * The test program should print out the same values as given in section |
|
|
64 * A.5 of RFC 1321, reproduced below. |
|
|
65 */ |
|
|
66 main() |
|
|
67 { |
|
|
68 static const char *const test[7] = { |
|
|
69 "", /*d41d8cd98f00b204e9800998ecf8427e*/ |
|
|
70 "945399884.61923487334tuvga", /*0cc175b9c0f1b6a831c399e269772661*/ |
|
|
71 "abc", /*900150983cd24fb0d6963f7d28e17f72*/ |
|
|
72 "message digest", /*f96b697d7cb7938d525a2f31aaf161d0*/ |
|
|
73 "abcdefghijklmnopqrstuvwxyz", /*c3fcd3d76192e4007dfb496cca67e13b*/ |
|
|
74 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", |
|
|
75 /*d174ab98d277d9f5a5611c2c9f419d9f*/ |
|
|
76 "12345678901234567890123456789012345678901234567890123456789012345678901234567890" /*57edf4a22be3c955ac49da2e2107b67a*/ |
|
|
77 }; |
|
|
78 int i; |
|
|
79 |
|
|
80 for (i = 0; i < 7; ++i) { |
|
|
81 md5_state_t state; |
|
|
82 md5_byte_t digest[16]; |
|
|
83 int di; |
|
|
84 |
|
|
85 md5_init(&state); |
|
|
86 md5_append(&state, (const md5_byte_t *)test[i], strlen(test[i])); |
|
|
87 md5_finish(&state, digest); |
|
|
88 printf("MD5 (\"%s\") = ", test[i]); |
|
|
89 for (di = 0; di < 16; ++di) |
|
|
90 printf("%02x", digest[di]); |
|
|
91 printf("\n"); |
|
|
92 } |
|
|
93 return 0; |
|
|
94 } |
|
|
95 #endif /* TEST */ |
|
|
96 |
|
|
97 |
|
|
98 /* |
|
|
99 * For reference, here is the program that computed the T values. |
|
|
100 */ |
|
|
101 #if 0 |
|
|
102 #include <math.h> |
|
|
103 main() |
|
|
104 { |
|
|
105 int i; |
|
|
106 for (i = 1; i <= 64; ++i) { |
|
|
107 unsigned long v = (unsigned long)(4294967296.0 * fabs(sin((double)i))); |
|
|
108 printf("#define T%d 0x%08lx\n", i, v); |
|
|
109 } |
|
|
110 return 0; |
|
|
111 } |
|
|
112 #endif |
|
|
113 /* |
|
|
114 * End of T computation program. |
|
|
115 */ |
|
|
116 #define T1 0xd76aa478 |
|
|
117 #define T2 0xe8c7b756 |
|
|
118 #define T3 0x242070db |
|
|
119 #define T4 0xc1bdceee |
|
|
120 #define T5 0xf57c0faf |
|
|
121 #define T6 0x4787c62a |
|
|
122 #define T7 0xa8304613 |
|
|
123 #define T8 0xfd469501 |
|
|
124 #define T9 0x698098d8 |
|
|
125 #define T10 0x8b44f7af |
|
|
126 #define T11 0xffff5bb1 |
|
|
127 #define T12 0x895cd7be |
|
|
128 #define T13 0x6b901122 |
|
|
129 #define T14 0xfd987193 |
|
|
130 #define T15 0xa679438e |
|
|
131 #define T16 0x49b40821 |
|
|
132 #define T17 0xf61e2562 |
|
|
133 #define T18 0xc040b340 |
|
|
134 #define T19 0x265e5a51 |
|
|
135 #define T20 0xe9b6c7aa |
|
|
136 #define T21 0xd62f105d |
|
|
137 #define T22 0x02441453 |
|
|
138 #define T23 0xd8a1e681 |
|
|
139 #define T24 0xe7d3fbc8 |
|
|
140 #define T25 0x21e1cde6 |
|
|
141 #define T26 0xc33707d6 |
|
|
142 #define T27 0xf4d50d87 |
|
|
143 #define T28 0x455a14ed |
|
|
144 #define T29 0xa9e3e905 |
|
|
145 #define T30 0xfcefa3f8 |
|
|
146 #define T31 0x676f02d9 |
|
|
147 #define T32 0x8d2a4c8a |
|
|
148 #define T33 0xfffa3942 |
|
|
149 #define T34 0x8771f681 |
|
|
150 #define T35 0x6d9d6122 |
|
|
151 #define T36 0xfde5380c |
|
|
152 #define T37 0xa4beea44 |
|
|
153 #define T38 0x4bdecfa9 |
|
|
154 #define T39 0xf6bb4b60 |
|
|
155 #define T40 0xbebfbc70 |
|
|
156 #define T41 0x289b7ec6 |
|
|
157 #define T42 0xeaa127fa |
|
|
158 #define T43 0xd4ef3085 |
|
|
159 #define T44 0x04881d05 |
|
|
160 #define T45 0xd9d4d039 |
|
|
161 #define T46 0xe6db99e5 |
|
|
162 #define T47 0x1fa27cf8 |
|
|
163 #define T48 0xc4ac5665 |
|
|
164 #define T49 0xf4292244 |
|
|
165 #define T50 0x432aff97 |
|
|
166 #define T51 0xab9423a7 |
|
|
167 #define T52 0xfc93a039 |
|
|
168 #define T53 0x655b59c3 |
|
|
169 #define T54 0x8f0ccc92 |
|
|
170 #define T55 0xffeff47d |
|
|
171 #define T56 0x85845dd1 |
|
|
172 #define T57 0x6fa87e4f |
|
|
173 #define T58 0xfe2ce6e0 |
|
|
174 #define T59 0xa3014314 |
|
|
175 #define T60 0x4e0811a1 |
|
|
176 #define T61 0xf7537e82 |
|
|
177 #define T62 0xbd3af235 |
|
|
178 #define T63 0x2ad7d2bb |
|
|
179 #define T64 0xeb86d391 |
|
|
180 |
|
|
181 static void |
|
|
182 md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/) |
|
|
183 { |
|
|
184 md5_word_t |
|
|
185 a = pms->abcd[0], b = pms->abcd[1], |
|
|
186 c = pms->abcd[2], d = pms->abcd[3]; |
|
|
187 md5_word_t t; |
|
|
188 |
|
|
189 #ifndef ARCH_IS_BIG_ENDIAN |
|
|
190 # define ARCH_IS_BIG_ENDIAN 1 /* slower, default implementation */ |
|
|
191 #endif |
|
|
192 #if ARCH_IS_BIG_ENDIAN |
|
|
193 |
|
|
194 /* |
|
|
195 * On big-endian machines, we must arrange the bytes in the right |
|
|
196 * order. (This also works on machines of unknown byte order.) |
|
|
197 */ |
|
|
198 md5_word_t X[16]; |
|
|
199 const md5_byte_t *xp = data; |
|
|
200 int i; |
|
|
201 |
|
|
202 for (i = 0; i < 16; ++i, xp += 4) |
|
|
203 X[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24); |
|
|
204 |
|
|
205 #else /* !ARCH_IS_BIG_ENDIAN */ |
|
|
206 |
|
|
207 /* |
|
|
208 * On little-endian machines, we can process properly aligned data |
|
|
209 * without copying it. |
|
|
210 */ |
|
|
211 md5_word_t xbuf[16]; |
|
|
212 const md5_word_t *X; |
|
|
213 |
|
|
214 if (!((data - (const md5_byte_t *)0) & 3)) { |
|
|
215 /* data are properly aligned */ |
|
|
216 X = (const md5_word_t *)data; |
|
|
217 } else { |
|
|
218 /* not aligned */ |
|
|
219 memcpy(xbuf, data, 64); |
|
|
220 X = xbuf; |
|
|
221 } |
|
|
222 #endif |
|
|
223 |
|
|
224 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n)))) |
|
|
225 |
|
|
226 /* Round 1. */ |
|
|
227 /* Let [abcd k s i] denote the operation |
|
|
228 a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */ |
|
|
229 #define F(x, y, z) (((x) & (y)) | (~(x) & (z))) |
|
|
230 #define SET(a, b, c, d, k, s, Ti)\ |
|
|
231 t = a + F(b,c,d) + X[k] + Ti;\ |
|
|
232 a = ROTATE_LEFT(t, s) + b |
|
|
233 /* Do the following 16 operations. */ |
|
|
234 SET(a, b, c, d, 0, 7, T1); |
|
|
235 SET(d, a, b, c, 1, 12, T2); |
|
|
236 SET(c, d, a, b, 2, 17, T3); |
|
|
237 SET(b, c, d, a, 3, 22, T4); |
|
|
238 SET(a, b, c, d, 4, 7, T5); |
|
|
239 SET(d, a, b, c, 5, 12, T6); |
|
|
240 SET(c, d, a, b, 6, 17, T7); |
|
|
241 SET(b, c, d, a, 7, 22, T8); |
|
|
242 SET(a, b, c, d, 8, 7, T9); |
|
|
243 SET(d, a, b, c, 9, 12, T10); |
|
|
244 SET(c, d, a, b, 10, 17, T11); |
|
|
245 SET(b, c, d, a, 11, 22, T12); |
|
|
246 SET(a, b, c, d, 12, 7, T13); |
|
|
247 SET(d, a, b, c, 13, 12, T14); |
|
|
248 SET(c, d, a, b, 14, 17, T15); |
|
|
249 SET(b, c, d, a, 15, 22, T16); |
|
|
250 #undef SET |
|
|
251 |
|
|
252 /* Round 2. */ |
|
|
253 /* Let [abcd k s i] denote the operation |
|
|
254 a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */ |
|
|
255 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z))) |
|
|
256 #define SET(a, b, c, d, k, s, Ti)\ |
|
|
257 t = a + G(b,c,d) + X[k] + Ti;\ |
|
|
258 a = ROTATE_LEFT(t, s) + b |
|
|
259 /* Do the following 16 operations. */ |
|
|
260 SET(a, b, c, d, 1, 5, T17); |
|
|
261 SET(d, a, b, c, 6, 9, T18); |
|
|
262 SET(c, d, a, b, 11, 14, T19); |
|
|
263 SET(b, c, d, a, 0, 20, T20); |
|
|
264 SET(a, b, c, d, 5, 5, T21); |
|
|
265 SET(d, a, b, c, 10, 9, T22); |
|
|
266 SET(c, d, a, b, 15, 14, T23); |
|
|
267 SET(b, c, d, a, 4, 20, T24); |
|
|
268 SET(a, b, c, d, 9, 5, T25); |
|
|
269 SET(d, a, b, c, 14, 9, T26); |
|
|
270 SET(c, d, a, b, 3, 14, T27); |
|
|
271 SET(b, c, d, a, 8, 20, T28); |
|
|
272 SET(a, b, c, d, 13, 5, T29); |
|
|
273 SET(d, a, b, c, 2, 9, T30); |
|
|
274 SET(c, d, a, b, 7, 14, T31); |
|
|
275 SET(b, c, d, a, 12, 20, T32); |
|
|
276 #undef SET |
|
|
277 |
|
|
278 /* Round 3. */ |
|
|
279 /* Let [abcd k s t] denote the operation |
|
|
280 a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */ |
|
|
281 #define H(x, y, z) ((x) ^ (y) ^ (z)) |
|
|
282 #define SET(a, b, c, d, k, s, Ti)\ |
|
|
283 t = a + H(b,c,d) + X[k] + Ti;\ |
|
|
284 a = ROTATE_LEFT(t, s) + b |
|
|
285 /* Do the following 16 operations. */ |
|
|
286 SET(a, b, c, d, 5, 4, T33); |
|
|
287 SET(d, a, b, c, 8, 11, T34); |
|
|
288 SET(c, d, a, b, 11, 16, T35); |
|
|
289 SET(b, c, d, a, 14, 23, T36); |
|
|
290 SET(a, b, c, d, 1, 4, T37); |
|
|
291 SET(d, a, b, c, 4, 11, T38); |
|
|
292 SET(c, d, a, b, 7, 16, T39); |
|
|
293 SET(b, c, d, a, 10, 23, T40); |
|
|
294 SET(a, b, c, d, 13, 4, T41); |
|
|
295 SET(d, a, b, c, 0, 11, T42); |
|
|
296 SET(c, d, a, b, 3, 16, T43); |
|
|
297 SET(b, c, d, a, 6, 23, T44); |
|
|
298 SET(a, b, c, d, 9, 4, T45); |
|
|
299 SET(d, a, b, c, 12, 11, T46); |
|
|
300 SET(c, d, a, b, 15, 16, T47); |
|
|
301 SET(b, c, d, a, 2, 23, T48); |
|
|
302 #undef SET |
|
|
303 |
|
|
304 /* Round 4. */ |
|
|
305 /* Let [abcd k s t] denote the operation |
|
|
306 a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */ |
|
|
307 #define I(x, y, z) ((y) ^ ((x) | ~(z))) |
|
|
308 #define SET(a, b, c, d, k, s, Ti)\ |
|
|
309 t = a + I(b,c,d) + X[k] + Ti;\ |
|
|
310 a = ROTATE_LEFT(t, s) + b |
|
|
311 /* Do the following 16 operations. */ |
|
|
312 SET(a, b, c, d, 0, 6, T49); |
|
|
313 SET(d, a, b, c, 7, 10, T50); |
|
|
314 SET(c, d, a, b, 14, 15, T51); |
|
|
315 SET(b, c, d, a, 5, 21, T52); |
|
|
316 SET(a, b, c, d, 12, 6, T53); |
|
|
317 SET(d, a, b, c, 3, 10, T54); |
|
|
318 SET(c, d, a, b, 10, 15, T55); |
|
|
319 SET(b, c, d, a, 1, 21, T56); |
|
|
320 SET(a, b, c, d, 8, 6, T57); |
|
|
321 SET(d, a, b, c, 15, 10, T58); |
|
|
322 SET(c, d, a, b, 6, 15, T59); |
|
|
323 SET(b, c, d, a, 13, 21, T60); |
|
|
324 SET(a, b, c, d, 4, 6, T61); |
|
|
325 SET(d, a, b, c, 11, 10, T62); |
|
|
326 SET(c, d, a, b, 2, 15, T63); |
|
|
327 SET(b, c, d, a, 9, 21, T64); |
|
|
328 #undef SET |
|
|
329 |
|
|
330 /* Then perform the following additions. (That is increment each |
|
|
331 of the four registers by the value it had before this block |
|
|
332 was started.) */ |
|
|
333 pms->abcd[0] += a; |
|
|
334 pms->abcd[1] += b; |
|
|
335 pms->abcd[2] += c; |
|
|
336 pms->abcd[3] += d; |
|
|
337 } |
|
|
338 |
|
|
339 void |
|
|
340 md5_init(md5_state_t *pms) |
|
|
341 { |
|
|
342 pms->count[0] = pms->count[1] = 0; |
|
|
343 pms->abcd[0] = 0x67452301; |
|
|
344 pms->abcd[1] = 0xefcdab89; |
|
|
345 pms->abcd[2] = 0x98badcfe; |
|
|
346 pms->abcd[3] = 0x10325476; |
|
|
347 } |
|
|
348 |
|
|
349 void |
|
|
350 md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes) |
|
|
351 { |
|
|
352 const md5_byte_t *p = data; |
|
|
353 int left = nbytes; |
|
|
354 int offset = (pms->count[0] >> 3) & 63; |
|
|
355 md5_word_t nbits = (md5_word_t)(nbytes << 3); |
|
|
356 |
|
|
357 if (nbytes <= 0) |
|
|
358 return; |
|
|
359 |
|
|
360 /* Update the message length. */ |
|
|
361 pms->count[1] += nbytes >> 29; |
|
|
362 pms->count[0] += nbits; |
|
|
363 if (pms->count[0] < nbits) |
|
|
364 pms->count[1]++; |
|
|
365 |
|
|
366 /* Process an initial partial block. */ |
|
|
367 if (offset) { |
|
|
368 int copy = (offset + nbytes > 64 ? 64 - offset : nbytes); |
|
|
369 |
|
|
370 memcpy(pms->buf + offset, p, copy); |
|
|
371 if (offset + copy < 64) |
|
|
372 return; |
|
|
373 p += copy; |
|
|
374 left -= copy; |
|
|
375 md5_process(pms, pms->buf); |
|
|
376 } |
|
|
377 |
|
|
378 /* Process full blocks. */ |
|
|
379 for (; left >= 64; p += 64, left -= 64) |
|
|
380 md5_process(pms, p); |
|
|
381 |
|
|
382 /* Process a final partial block. */ |
|
|
383 if (left) |
|
|
384 memcpy(pms->buf, p, left); |
|
|
385 } |
|
|
386 |
|
|
387 void |
|
|
388 md5_finish(md5_state_t *pms, md5_byte_t digest[16]) |
|
|
389 { |
|
|
390 static const md5_byte_t pad[64] = { |
|
|
391 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
|
|
392 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
|
|
393 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
|
|
394 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 |
|
|
395 }; |
|
|
396 md5_byte_t data[8]; |
|
|
397 int i; |
|
|
398 |
|
|
399 /* Save the length before padding. */ |
|
|
400 for (i = 0; i < 8; ++i) |
|
|
401 data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3)); |
|
|
402 /* Pad to 56 bytes mod 64. */ |
|
|
403 md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1); |
|
|
404 /* Append the length. */ |
|
|
405 md5_append(pms, data, 8); |
|
|
406 for (i = 0; i < 16; ++i) |
|
|
407 digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3)); |
|
|
408 } |
