misc/luabash/md5/md5.c

   1 /*
   2  * "derived from the RSA Data Security, Inc. MD5 Message-Digest Algorithm".
   3  * "derived from dietlibc".
   4  *
   5  * --- T2-COPYRIGHT-NOTE-BEGIN ---
   6  * This copyright note is auto-generated by ./scripts/Create-CopyPatch.
   7  *
   8  * T2 SDE: misc/luabash/md5/md5.c
   9  * Copyright (C) 2006 The T2 SDE Project
  10  * Copyright (C) 2006 Rene Rebe <rene@exactcode.de>
  11  * Copyright (C) 2006 Felix von Leitner
  12  *
  13  * More information can be found in the files COPYING and README.
  14  *
  15  * This program 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; version 2 of the License. A copy of the
  18  * GNU General Public License can be found in the file COPYING.
  19  * --- T2-COPYRIGHT-NOTE-END ---
  20  */
  21
  22 #include <endian.h>
  23 #include "md5.h"
  24 #include <string.h>
  25
  26 #if (__BYTE_ORDER == __BIG_ENDIAN)
  27 /*
  28    Block copy and convert byte order to little-endian.
  29    dst must be 32bit aligned.
  30    Length is the number of 32bit words
  31 */
  32 static void CopyToLittleEndian (uint32_t *dst, const uint8_t *src, int length) {
  33   while (length--) {
  34     *dst=(((uint32_t)src[3])<<24) |
  35          (((uint32_t)src[2])<<16) |
  36          (((uint32_t)src[1])<< 8) |
  37            (uint32_t)src[0];
  38     src+=4;
  39     dst++;
  40   }
  41 }
  42 #endif
  43
  44
  45 /*
  46    Assembler versions of __MD5Transform, MD5Init and MD5Update
  47    currently exist for x86 and little-endian ARM.
  48    For other targets, we need to use the C versions below.
  49 */
  50
  51 /*
  52    Initialise the MD5 context.
  53 */
  54 void MD5Init (MD5_CTX* context) {
  55    context->count[0] = 0;
  56    context->count[1] = 0;
  57
  58    context->state[0] = 0x67452301;              /* Load magic constants. */
  59    context->state[1] = 0xefcdab89;
  60    context->state[2] = 0x98badcfe;
  61    context->state[3] = 0x10325476;
  62 }
  63
  64 #define ROTATE_LEFT(x, n) ((x << n) | (x >> (32-n)))
  65
  66 #define F(x, y, z) (z ^ (x & (y ^ z)))
  67 #define G(x, y, z) (y ^ (z & (x ^ y)))
  68 #define H(x, y, z) (x ^ y ^ z)
  69 #define I(x, y, z) (y ^ (x | ~z))
  70
  71 #define FF(a, b, c, d, x, s, ac) { (a) += F (b, c, d) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT (a, s); (a) += (b); }
  72 #define GG(a, b, c, d, x, s, ac) { (a) += G (b, c, d) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT (a, s); (a) += (b); }
  73 #define HH(a, b, c, d, x, s, ac) { (a) += H (b, c, d) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT (a, s); (a) += (b); }
  74 #define II(a, b, c, d, x, s, ac) { (a) += I (b, c, d) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT (a, s); (a) += (b); }
  75
  76 static void __MD5Transform (uint32_t state[4], const uint8_t *in, int repeat) {
  77    const uint32_t *x;
  78
  79    uint32_t  a = state[0];
  80    uint32_t  b = state[1];
  81    uint32_t  c = state[2];
  82    uint32_t  d = state[3];
  83
  84    for ( ; repeat; repeat--) {
  85       uint32_t tempBuffer[16];
  86 #if (__BYTE_ORDER == __BIG_ENDIAN)
  87
  88       CopyToLittleEndian (tempBuffer, in, 16);
  89       x = tempBuffer;
  90 #else
  91       if ((long)in & 3) {
  92         memcpy(tempBuffer, in, 64);
  93         x = tempBuffer;
  94       } else
  95         x = (const uint32_t *) in;
  96 #endif
  97
  98       FF (a, b, c, d, x[ 0],  7, 0xd76aa478); /*  1 */     /* Round 1 */
  99       FF (d, a, b, c, x[ 1], 12, 0xe8c7b756); /*  2 */
 100       FF (c, d, a, b, x[ 2], 17, 0x242070db); /*  3 */
 101       FF (b, c, d, a, x[ 3], 22, 0xc1bdceee); /*  4 */
 102       FF (a, b, c, d, x[ 4],  7, 0xf57c0faf); /*  5 */
 103       FF (d, a, b, c, x[ 5], 12, 0x4787c62a); /*  6 */
 104       FF (c, d, a, b, x[ 6], 17, 0xa8304613); /*  7 */
 105       FF (b, c, d, a, x[ 7], 22, 0xfd469501); /*  8 */
 106       FF (a, b, c, d, x[ 8],  7, 0x698098d8); /*  9 */
 107       FF (d, a, b, c, x[ 9], 12, 0x8b44f7af); /* 10 */
 108       FF (c, d, a, b, x[10], 17, 0xffff5bb1); /* 11 */
 109       FF (b, c, d, a, x[11], 22, 0x895cd7be); /* 12 */
 110       FF (a, b, c, d, x[12],  7, 0x6b901122); /* 13 */
 111       FF (d, a, b, c, x[13], 12, 0xfd987193); /* 14 */
 112       FF (c, d, a, b, x[14], 17, 0xa679438e); /* 15 */
 113       FF (b, c, d, a, x[15], 22, 0x49b40821); /* 16 */
 114
 115       GG (a, b, c, d, x[ 1],  5, 0xf61e2562); /* 17 */     /* Round 2 */
 116       GG (d, a, b, c, x[ 6],  9, 0xc040b340); /* 18 */
 117       GG (c, d, a, b, x[11], 14, 0x265e5a51); /* 19 */
 118       GG (b, c, d, a, x[ 0], 20, 0xe9b6c7aa); /* 20 */
 119       GG (a, b, c, d, x[ 5],  5, 0xd62f105d); /* 21 */
 120       GG (d, a, b, c, x[10],  9, 0x02441453); /* 22 */
 121       GG (c, d, a, b, x[15], 14, 0xd8a1e681); /* 23 */
 122       GG (b, c, d, a, x[ 4], 20, 0xe7d3fbc8); /* 24 */
 123       GG (a, b, c, d, x[ 9],  5, 0x21e1cde6); /* 25 */
 124       GG (d, a, b, c, x[14],  9, 0xc33707d6); /* 26 */
 125       GG (c, d, a, b, x[ 3], 14, 0xf4d50d87); /* 27 */
 126       GG (b, c, d, a, x[ 8], 20, 0x455a14ed); /* 28 */
 127       GG (a, b, c, d, x[13],  5, 0xa9e3e905); /* 29 */
 128       GG (d, a, b, c, x[ 2],  9, 0xfcefa3f8); /* 30 */
 129       GG (c, d, a, b, x[ 7], 14, 0x676f02d9); /* 31 */
 130       GG (b, c, d, a, x[12], 20, 0x8d2a4c8a); /* 32 */
 131
 132       HH (a, b, c, d, x[ 5],  4, 0xfffa3942); /* 33 */     /* Round 3 */
 133       HH (d, a, b, c, x[ 8], 11, 0x8771f681); /* 34 */
 134       HH (c, d, a, b, x[11], 16, 0x6d9d6122); /* 35 */
 135       HH (b, c, d, a, x[14], 23, 0xfde5380c); /* 36 */
 136       HH (a, b, c, d, x[ 1],  4, 0xa4beea44); /* 37 */
 137       HH (d, a, b, c, x[ 4], 11, 0x4bdecfa9); /* 38 */
 138       HH (c, d, a, b, x[ 7], 16, 0xf6bb4b60); /* 39 */
 139       HH (b, c, d, a, x[10], 23, 0xbebfbc70); /* 40 */
 140       HH (a, b, c, d, x[13],  4, 0x289b7ec6); /* 41 */
 141       HH (d, a, b, c, x[ 0], 11, 0xeaa127fa); /* 42 */
 142       HH (c, d, a, b, x[ 3], 16, 0xd4ef3085); /* 43 */
 143       HH (b, c, d, a, x[ 6], 23, 0x04881d05); /* 44 */
 144       HH (a, b, c, d, x[ 9],  4, 0xd9d4d039); /* 45 */
 145       HH (d, a, b, c, x[12], 11, 0xe6db99e5); /* 46 */
 146       HH (c, d, a, b, x[15], 16, 0x1fa27cf8); /* 47 */
 147       HH (b, c, d, a, x[ 2], 23, 0xc4ac5665); /* 48 */
 148
 149       II (a, b, c, d, x[ 0],  6, 0xf4292244); /* 49 */     /* Round 4 */
 150       II (d, a, b, c, x[ 7], 10, 0x432aff97); /* 50 */
 151       II (c, d, a, b, x[14], 15, 0xab9423a7); /* 51 */
 152       II (b, c, d, a, x[ 5], 21, 0xfc93a039); /* 52 */
 153       II (a, b, c, d, x[12],  6, 0x655b59c3); /* 53 */
 154       II (d, a, b, c, x[ 3], 10, 0x8f0ccc92); /* 54 */
 155       II (c, d, a, b, x[10], 15, 0xffeff47d); /* 55 */
 156       II (b, c, d, a, x[ 1], 21, 0x85845dd1); /* 56 */
 157       II (a, b, c, d, x[ 8],  6, 0x6fa87e4f); /* 57 */
 158       II (d, a, b, c, x[15], 10, 0xfe2ce6e0); /* 58 */
 159       II (c, d, a, b, x[ 6], 15, 0xa3014314); /* 59 */
 160       II (b, c, d, a, x[13], 21, 0x4e0811a1); /* 60 */
 161       II (a, b, c, d, x[ 4],  6, 0xf7537e82); /* 61 */
 162       II (d, a, b, c, x[11], 10, 0xbd3af235); /* 62 */
 163       II (c, d, a, b, x[ 2], 15, 0x2ad7d2bb); /* 63 */
 164       II (b, c, d, a, x[ 9], 21, 0xeb86d391); /* 64 */
 165
 166       state[0] = a = a + state[0];
 167       state[1] = b = b + state[1];
 168       state[2] = c = c + state[2];
 169       state[3] = d = d + state[3];
 170
 171       in += 64;
 172    }
 173 }
 174
 175
 176 /*
 177    MD5 block update operation:
 178    Process another sub-string of the message and update the context.
 179 */
 180 void MD5Update (MD5_CTX *context, const uint8_t *input, size_t inputBytes) {
 181    int i;
 182    int byteIndex;
 183    unsigned int partLen;
 184    int len;
 185
 186    /* Compute number of bytes mod 64 */
 187    byteIndex = (context->count[0] >> 3) & 0x3F;
 188
 189    /* Update number of bits: count += 8 * inputBytes */
 190    if ((context->count[0] += inputBytes << 3) < (inputBytes << 3))
 191       context->count[1]++;
 192    context->count[1] += (inputBytes >> (32-3));
 193
 194    partLen = (64 - byteIndex);
 195
 196    /* Transform as many times as possible. */
 197    if (inputBytes >= partLen) {
 198       memcpy (context->buffer + byteIndex, input, partLen);
 199       __MD5Transform (context->state, (const uint8_t *) context->buffer, 1);
 200       len = (inputBytes - partLen) / 64;
 201       __MD5Transform (context->state, &input[partLen], len);
 202       i = partLen + 64 * len;
 203       byteIndex = 0;
 204    } else
 205       i = 0;
 206
 207    /* Buffer remaining input */
 208    memcpy (&context->buffer[byteIndex], &input[i], inputBytes - i);
 209 }
 210
 211
 212 void MD5Final (uint8_t digest[16], MD5_CTX* context) {
 213    static uint8_t finalBlock[64];
 214
 215    uint32_t bits[2];
 216    int      byteIndex;
 217    int      finalBlockLength;
 218
 219    byteIndex = (context->count[0] >> 3) & 0x3F;
 220    finalBlockLength = ((byteIndex < 56) ? 56 : 120) - byteIndex;
 221    finalBlock[0] = 0x80;
 222
 223 #if (__BYTE_ORDER == __BIG_ENDIAN)
 224    CopyToLittleEndian (bits, (const uint8_t *) context->count, 2);
 225 #else
 226    memcpy(bits, context->count, 8);
 227 #endif
 228
 229    MD5Update (context, finalBlock, finalBlockLength);
 230    MD5Update (context, (const uint8_t *) bits, 8);
 231
 232 #if (__BYTE_ORDER == __BIG_ENDIAN)
 233    CopyToLittleEndian ((uint32_t *) digest, (const uint8_t *) context->state, 4);
 234 #else
 235    memcpy (digest, context->state, 16);
 236 #endif
 237
 238    memset(context, 0, sizeof(*context));
 239 }
 240