lib/ext/digest/md5/md5.c

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