~mdw / become / blob
? search:


23ce6935df4aa372b1e61092f420f6bb18a99595
[become] / src / md5.c
1 /* -*-c-*-
2 *
3 * $Id: md5.c,v 1.2 1997/08/04 10:24:23 mdw Exp $
4 *
5 * MD-5 secure hash routines
6 * Based on RSA MD-5 code
7 *
8 * (c) 1996, 1997 Mark Wooding
9 */
10
11 /*----- Licensing notice --------------------------------------------------*
12 *
13 * This file is part of `become'
14 *
15 * `Become' is free software; you can redistribute it and/or modify
16 * it under the terms of the GNU General Public License as published by
17 * the Free Software Foundation; either version 2 of the License, or
18 * (at your option) any later version.
19 *
20 * `Become' is distributed in the hope that it will be useful,
21 * but WITHOUT ANY WARRANTY; without even the implied warranty of
22 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23 * GNU General Public License for more details.
24 *
25 * You should have received a copy of the GNU General Public License
26 * along with `become'; if not, write to the Free Software Foundation,
27 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
28 */
29
30 /*----- Revision history --------------------------------------------------*
31 *
32 * $Log: md5.c,v $
33 * Revision 1.2 1997/08/04 10:24:23 mdw
34 * Sources placed under CVS control.
35 *
36 * Revision 1.1 1997/07/21 13:47:47 mdw
37 * Initial revision
38 *
39 */
40
41 /*----- Header files ------------------------------------------------------*/
42
43 #include <stdio.h>
44 #include <string.h>
45
46 #include "config.h"
47 #include "md5.h"
48 #include "utils.h"
49
50 /*----- Define MD-5 transform ---------------------------------------------*/
51
52 /* --- Low-level nonlinear functions --- */
53
54 #define f(x,y,z) (((x) & (y)) | ((~x) & (z)))
55 #define g(x,y,z) (((x) & (z)) | ((y) & (~z)))
56 #define h(x,y,z) ((x) ^ (y) ^ (z))
57 #define i(x,y,z) ((y) ^ ((x) | (~z)))
58
59 #define rol(x,b) (((x) << (b)) | ((x) >> (32-(b))))
60
61 /* --- Rotations applied at various stages --- */
62
63 #define S11 7u
64 #define S12 12u
65 #define S13 17
66 #define S14 22u
67 #define S21 5u
68 #define S22 9u
69 #define S23 14u
70 #define S24 20u
71 #define S31 4u
72 #define S32 11u
73 #define S33 16u
74 #define S34 23u
75 #define S41 6u
76 #define S42 10u
77 #define S43 15u
78 #define S44 21u
79
80 /* --- Higher level nonlinear functions --- */
81
82 #define ff(a, b, c, d, x, s, m) ( a += f(b, c, d) + x + m, \
83 a = rol(a, s), a += b )
84
85 #define gg(a, b, c, d, x, s, m) ( a += g(b, c, d) + x + m, \
86 a = rol(a, s), a += b )
87
88 #define hh(a, b, c, d, x, s, m) ( a += h(b, c, d) + x + m, \
89 a = rol(a, s), a += b )
90
91 #define ii(a, b, c, d, x, s, m) ( a += i(b, c, d) + x + m, \
92 a = rol(a, s), a += b )
93
94 /*----- Main code ---------------------------------------------------------*/
95
96 /* --- @md5__trans@ --- *
97 *
98 * Arguments: @uint_32 *v@ = pointer to chaining variables (updated)
99 * @const unsigned char *buf@ = pointer to a 64-byte block
100 *
101 * Returns: ---
102 *
103 * Use: Performs the main MD5 transform on a block of data.
104 */
105
106 static void md5__trans(uint_32 *v, const unsigned char *buf)
107 {
108 uint_32 a, b, c, d;
109 uint_32 ib[16];
110 size_t i;
111
112 /* --- Initialise my internal registers --- */
113
114 a = v[0], b = v[1], c = v[2], d = v[3];
115
116 /* --- Turn the buffer into 32-bit words --- */
117
118 for (i = 0; i < 16; i++)
119 ib[i] = load32_l(buf + (i << 2));
120
121 /* --- Round one --- */
122
123 ff(a, b, c, d, ib[ 0], S11, 0xd76aa478); /* 1 */
124 ff(d, a, b, c, ib[ 1], S12, 0xe8c7b756); /* 2 */
125 ff(c, d, a, b, ib[ 2], S13, 0x242070db); /* 3 */
126 ff(b, c, d, a, ib[ 3], S14, 0xc1bdceee); /* 4 */
127 ff(a, b, c, d, ib[ 4], S11, 0xf57c0faf); /* 5 */
128 ff(d, a, b, c, ib[ 5], S12, 0x4787c62a); /* 6 */
129 ff(c, d, a, b, ib[ 6], S13, 0xa8304613); /* 7 */
130 ff(b, c, d, a, ib[ 7], S14, 0xfd469501); /* 8 */
131 ff(a, b, c, d, ib[ 8], S11, 0x698098d8); /* 9 */
132 ff(d, a, b, c, ib[ 9], S12, 0x8b44f7af); /* 10 */
133 ff(c, d, a, b, ib[10], S13, 0xffff5bb1); /* 11 */
134 ff(b, c, d, a, ib[11], S14, 0x895cd7be); /* 12 */
135 ff(a, b, c, d, ib[12], S11, 0x6b901122); /* 13 */
136 ff(d, a, b, c, ib[13], S12, 0xfd987193); /* 14 */
137 ff(c, d, a, b, ib[14], S13, 0xa679438e); /* 15 */
138 ff(b, c, d, a, ib[15], S14, 0x49b40821); /* 16 */
139
140 /* --- Round two --- */
141
142 gg(a, b, c, d, ib[ 1], S21, 0xf61e2562); /* 17 */
143 gg(d, a, b, c, ib[ 6], S22, 0xc040b340); /* 18 */
144 gg(c, d, a, b, ib[11], S23, 0x265e5a51); /* 19 */
145 gg(b, c, d, a, ib[ 0], S24, 0xe9b6c7aa); /* 20 */
146 gg(a, b, c, d, ib[ 5], S21, 0xd62f105d); /* 21 */
147 gg(d, a, b, c, ib[10], S22, 0x02441453); /* 22 */
148 gg(c, d, a, b, ib[15], S23, 0xd8a1e681); /* 23 */
149 gg(b, c, d, a, ib[ 4], S24, 0xe7d3fbc8); /* 24 */
150 gg(a, b, c, d, ib[ 9], S21, 0x21e1cde6); /* 25 */
151 gg(d, a, b, c, ib[14], S22, 0xc33707d6); /* 26 */
152 gg(c, d, a, b, ib[ 3], S23, 0xf4d50d87); /* 27 */
153 gg(b, c, d, a, ib[ 8], S24, 0x455a14ed); /* 28 */
154 gg(a, b, c, d, ib[13], S21, 0xa9e3e905); /* 29 */
155 gg(d, a, b, c, ib[ 2], S22, 0xfcefa3f8); /* 30 */
156 gg(c, d, a, b, ib[ 7], S23, 0x676f02d9); /* 31 */
157 gg(b, c, d, a, ib[12], S24, 0x8d2a4c8a); /* 32 */
158
159 /* --- Round three --- */
160
161 hh(a, b, c, d, ib[ 5], S31, 0xfffa3942); /* 33 */
162 hh(d, a, b, c, ib[ 8], S32, 0x8771f681); /* 34 */
163 hh(c, d, a, b, ib[11], S33, 0x6d9d6122); /* 35 */
164 hh(b, c, d, a, ib[14], S34, 0xfde5380c); /* 36 */
165 hh(a, b, c, d, ib[ 1], S31, 0xa4beea44); /* 37 */
166 hh(d, a, b, c, ib[ 4], S32, 0x4bdecfa9); /* 38 */
167 hh(c, d, a, b, ib[ 7], S33, 0xf6bb4b60); /* 39 */
168 hh(b, c, d, a, ib[10], S34, 0xbebfbc70); /* 40 */
169 hh(a, b, c, d, ib[13], S31, 0x289b7ec6); /* 41 */
170 hh(d, a, b, c, ib[ 0], S32, 0xeaa127fa); /* 42 */
171 hh(c, d, a, b, ib[ 3], S33, 0xd4ef3085); /* 43 */
172 hh(b, c, d, a, ib[ 6], S34, 0x04881d05); /* 44 */
173 hh(a, b, c, d, ib[ 9], S31, 0xd9d4d039); /* 45 */
174 hh(d, a, b, c, ib[12], S32, 0xe6db99e5); /* 46 */
175 hh(c, d, a, b, ib[15], S33, 0x1fa27cf8); /* 47 */
176 hh(b, c, d, a, ib[ 2], S34, 0xc4ac5665); /* 48 */
177
178 /* --- Round four --- */
179
180 ii(a, b, c, d, ib[ 0], S41, 0xf4292244); /* 49 */
181 ii(d, a, b, c, ib[ 7], S42, 0x432aff97); /* 50 */
182 ii(c, d, a, b, ib[14], S43, 0xab9423a7); /* 51 */
183 ii(b, c, d, a, ib[ 5], S44, 0xfc93a039); /* 52 */
184 ii(a, b, c, d, ib[12], S41, 0x655b59c3); /* 53 */
185 ii(d, a, b, c, ib[ 3], S42, 0x8f0ccc92); /* 54 */
186 ii(c, d, a, b, ib[10], S43, 0xffeff47d); /* 55 */
187 ii(b, c, d, a, ib[ 1], S44, 0x85845dd1); /* 56 */
188 ii(a, b, c, d, ib[ 8], S41, 0x6fa87e4f); /* 57 */
189 ii(d, a, b, c, ib[15], S42, 0xfe2ce6e0); /* 58 */
190 ii(c, d, a, b, ib[ 6], S43, 0xa3014314); /* 59 */
191 ii(b, c, d, a, ib[13], S44, 0x4e0811a1); /* 60 */
192 ii(a, b, c, d, ib[ 4], S41, 0xf7537e82); /* 61 */
193 ii(d, a, b, c, ib[11], S42, 0xbd3af235); /* 62 */
194 ii(c, d, a, b, ib[ 2], S43, 0x2ad7d2bb); /* 63 */
195 ii(b, c, d, a, ib[ 9], S44, 0xeb86d391); /* 64 */
196
197 /* --- Update the context --- */
198
199 v[0] += a, v[1] += b, v[2] += c, v[3] += d;
200 }
201
202 /* --- @md5_trans@ --- *
203 *
204 * Arguments: @unsigned char *v@ = pointer to chaining block (updated)
205 * @const unsigned char *buf@ = pointer to input buffer
206 *
207 * Returns: ---
208 *
209 * Use: Performs the MD5 transformation on a chunk of data. This may
210 * be useful for using MD5 in MDC-type cipher constructions.
211 */
212
213 void md5_trans(unsigned char *v, const unsigned char *buf)
214 {
215 uint_32 vv[4];
216
217 vv[0] = load32_l(v + 0);
218 vv[1] = load32_l(v + 4);
219 vv[2] = load32_l(v + 8);
220 vv[3] = load32_l(v + 12);
221 md5__trans(vv, buf);
222 store32_l(v + 0, vv[0]);
223 store32_l(v + 4, vv[1]);
224 store32_l(v + 8, vv[2]);
225 store32_l(v + 12, vv[3]);
226 }
227
228 /* --- @md5_buffer@ --- *
229 *
230 * Arguments: @md5 *m@ = pointer to an MD5 context
231 * @const void *buff@ = pointer to buffer of data
232 * @size_t size@ = size of buffer
233 *
234 * Returns: ---
235 *
236 * Use: Hashes the buffer of data. You can call @md5_buffer@
237 * lots of times during an MD5 job, to allow big files to be
238 * split into little ones.
239 */
240
241 void md5_buffer(md5 *m, const void *buff, size_t size)
242 {
243 long int s = size;
244 const unsigned char *b = buff;
245 unsigned long x, y;
246
247 /* --- Maybe there's some data already in the buffer --- */
248
249 if (x = m->size & 63, x) {
250 y = 64 - x;
251 if (y > s) {
252 memcpy(x + m->buf, b, s);
253 m->size += s;
254 return;
255 }
256 memcpy(x + m->buf, b, y);
257 md5__trans(m->val, m->buf);
258 s -= y, b += y;
259 }
260
261 /* --- Now do whole buffers-full --- */
262
263 while (s >= 64) {
264 md5__trans(m->val, b);
265 s -= 64, b += 64;
266 }
267
268 /* --- Tidy up the tail end --- */
269
270 if (s)
271 memcpy(m->buf, b, s);
272 m->size += size;
273 }
274
275 /* --- @md5_key@ --- *
276 *
277 * Arguments: @md5 *m@ = pointer to an MD5 context
278 * @const unsigned char *k@ = pointer to a 4-word `key'
279 *
280 * Returns: ---
281 *
282 * Use: Initialises a context buffer, with a chosen initialisation
283 * string (instead of the standard MD5 value). This allows you
284 * to use NMAC message authentication, should the urge take you.
285 */
286
287 void md5_key(md5 *m, const unsigned char *k)
288 {
289 m->size = 0;
290 m->val[0] = load32_l(k + 0);
291 m->val[0] = load32_l(k + 4);
292 m->val[0] = load32_l(k + 8);
293 m->val[0] = load32_l(k + 12);
294 }
295
296 /* --- @md5_init@ --- *
297 *
298 * Arguments: @md5 *m@ = pointer to an MD5 context
299 *
300 * Returns: ---
301 *
302 * Use: Initialises the context buffer, so that you can do an
303 * MD5 job.
304 */
305
306 void md5_init(md5 *m)
307 {
308 m->size = 0;
309 m->val[0] = 0x67452301;
310 m->val[1] = 0xefcdab89;
311 m->val[2] = 0x98badcfe;
312 m->val[3] = 0x10325476;
313 }
314
315 /* --- @md5_final@ --- *
316 *
317 * Arguments: @md5 *m@ = pointer to context buffer
318 * @unsigned char *v@ = where to store the value
319 *
320 * Returns: ---
321 *
322 * Use: Finalises an MD5 buffer, so that you can use the result.
323 */
324
325 void md5_final(md5 *m, unsigned char *v)
326 {
327 int s = m->size;
328
329 /* --- Pad out the block --- */
330
331 {
332 const static unsigned char pad[64] = { 0x80 };
333 int p = m->size & 63;
334 p = (p < 56) ? (p = 56 - p) : (p = 120 - p);
335 md5_buffer(m, pad, p);
336 }
337
338 /* --- Append the length --- */
339
340 {
341 unsigned char b[8];
342
343 store32_l(b + 0, s << 3);
344 store32_l(b + 4, s >> 29);
345 md5_buffer(m, b, 8);
346 }
347
348 /* --- Write out the value --- */
349
350 if (v) {
351 store32_l(v + 0, m->val[0]);
352 store32_l(v + 4, m->val[1]);
353 store32_l(v + 8, m->val[2]);
354 store32_l(v + 12, m->val[3]);
355 }
356 }
357
358 /*----- Test driver -------------------------------------------------------*/
359
360 #ifdef TEST_RIG
361
362 int main(int argc, char *argv[])
363 {
364 if (argc > 1 && strcmp(argv[1], "-x") == 0) {
365
366 static struct {
367 const char *string;
368 uint_32 md[4];
369 } table[] = {
370 "", { 0xd98c1dd4, 0x04b2008f, 0x980980e9, 0x7e42f8ec },
371 "a", { 0xb975c10c, 0xa8b6f1c0, 0xe299c331, 0x61267769 },
372 "abc", { 0x98500190, 0xb04fd23c, 0x7d3f96d6, 0x727fe128 },
373 "message digest", { 0x7d696bf9, 0x8d93b77c, 0x312f5a52, 0xd061f1aa },
374 "abcdefghijklmnopqrstuvwxyz",
375 { 0xd7d3fcc3, 0x00e49261, 0x6c49fb7d, 0x3be167ca },
376 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
377 { 0x98ab74d1, 0xf5d977d2, 0x2c1c61a5, 0x9f9d419f },
378 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
379 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
380 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
381 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
382 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
383 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
384 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
385 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
386 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
387 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
388 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
389 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
390 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
391 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
392 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
393 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
394 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
395 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
396 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
397 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
398 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
399 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n"
400 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n",
401 { 0xbaa7652b, 0x5e10cd4a, 0xde9acbf2, 0xfa0b9fbd }
402 };
403 int steptbl[] = { 3, 18, 32, 37, 63, 64, 65, 256, 1024, -1 };
404
405 md5 m;
406 int i, j;
407 const char *p;
408 size_t sz, a, d;
409 int f = 1;
410
411 for (i = 0; i < sizeof(table) / sizeof(table[0]); i++) {
412 sz = strlen(table[i].string);
413 for (j = 0; steptbl[j] < sz && steptbl[j] != -1; j++) {
414 p = table[i].string;
415 d = steptbl[j];
416 md5_init(&m);
417 for (a = sz; a > d; a -= d) {
418 md5_buffer(&m, p, d);
419 p += d;
420 }
421 md5_buffer(&m, p, a);
422 md5_final(&m, 0);
423 if (m.val[0] != table[i].md[0] ||
424 m.val[1] != table[i].md[1] ||
425 m.val[2] != table[i].md[2] ||
426 m.val[3] != table[i].md[3]) {
427 printf("!!! bad value, string == `%s', step size == %i\n"
428 "!!! expected %08lx-%08lx-%08lx-%08lx, found "
429 "%08lx-%08lx-%08lx-%08lx\n\n",
430 table[i].string, d,
431 (unsigned long)table[i].md[0],
432 (unsigned long)table[i].md[1],
433 (unsigned long)table[i].md[2],
434 (unsigned long)table[i].md[3],
435 (unsigned long)m.val[0],
436 (unsigned long)m.val[1],
437 (unsigned long)m.val[2],
438 (unsigned long)m.val[3]);
439 f = 0;
440 }
441 }
442 md5_init(&m);
443 md5_buffer(&m, table[i].string, sz);
444 md5_final(&m, 0);
445 if (m.val[0] != table[i].md[0] ||
446 m.val[1] != table[i].md[1] ||
447 m.val[2] != table[i].md[2] ||
448 m.val[3] != table[i].md[3]) {
449 printf("!!! bad value, string == `%s', step size == entire string\n"
450 "!!! expected %08lx-%08lx-%08lx-%08lx, found "
451 "%08lx-%08lx-%08lx-%08lx\n\n",
452 table[i].string,
453 (unsigned long)table[i].md[0],
454 (unsigned long)table[i].md[1],
455 (unsigned long)table[i].md[2],
456 (unsigned long)table[i].md[3],
457 (unsigned long)m.val[0],
458 (unsigned long)m.val[1],
459 (unsigned long)m.val[2],
460 (unsigned long)m.val[3]);
461 f = 0;
462 } else {
463 printf("`%s' => %08lx-%08lx-%08lx-%08lx\n",
464 table[i].string,
465 (unsigned long)m.val[0],
466 (unsigned long)m.val[1],
467 (unsigned long)m.val[2],
468 (unsigned long)m.val[3]);
469 }
470 }
471
472 } else {
473
474 char buff[4096];
475 md5 m;
476 int i;
477 int read;
478
479 md5_init(&m);
480 while (read = fread(buff, 1, 4096, stdin), read)
481 md5_buffer(&m, buff, read);
482 md5_final(&m, 0);
483
484 for (i = 0; i < 4; i++)
485 printf("%02lx%02lx%02lx%02lx",
486 (unsigned long)( (m.val[i] & 0x000000FF) >> 0 ),
487 (unsigned long)( (m.val[i] & 0x0000FF00) >> 8 ),
488 (unsigned long)( (m.val[i] & 0x00FF0000) >> 16 ),
489 (unsigned long)( (m.val[i] & 0xFF000000) >> 24 ));
490 putc('\n', stdout);
491
492 }
493
494 return (0);
495 }
496
497 #endif
498
499 /*----- That's all, folks -------------------------------------------------*/
Management for shared accounts