release/src/router/xl2tpd/md5.c

   1 #ifdef FREEBSD
   2 # include <machine/endian.h>
   3 #elif defined(OPENBSD)
   4 # define __BSD_VISIBLE 0
   5 # include <machine/endian.h>
   6 #elif defined(LINUX)
   7 # include <endian.h>
   8 #elif defined(SOLARIS)
   9 # include <sys/isa_defs.h>
  10 #endif
  11 #if __BYTE_ORDER == __BIG_ENDIAN
  12 #define HIGHFIRST 1
  13 #endif
  14
  15 /*
  16  * This code implements the MD5 message-digest algorithm.
  17  * The algorithm is due to Ron Rivest.  This code was
  18  * written by Colin Plumb in 1993, no copyright is claimed.
  19  * This code is in the public domain; do with it what you wish.
  20  *
  21  * Equivalent code is available from RSA Data Security, Inc.
  22  * This code has been tested against that, and is equivalent,
  23  * except that you don't need to include two pages of legalese
  24  * with every copy.
  25  *
  26  * To compute the message digest of a chunk of bytes, declare an
  27  * MD5Context structure, pass it to MD5Init, call MD5Update as
  28  * needed on buffers full of bytes, and then call MD5Final, which
  29  * will fill a supplied 16-byte array with the digest.
  30  */
  31 #include <string.h>             /* for memcpy() */
  32 #include "md5.h"
  33
  34 #ifndef HIGHFIRST
  35 #define byteReverse(buf, len)   /* Nothing */
  36 #else
  37 void byteReverse (unsigned char *buf, unsigned longs);
  38
  39 #ifndef ASM_MD5
  40 /*
  41  * Note: this code is harmless on little-endian machines.
  42  */
  43 void byteReverse (unsigned char *buf, unsigned longs)
  44 {
  45     uint32 t;
  46     do
  47     {
  48         t = (uint32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
  49             ((unsigned) buf[1] << 8 | buf[0]);
  50         *(uint32 *) buf = t;
  51         buf += 4;
  52     }
  53     while (--longs);
  54 }
  55 #endif
  56 #endif
  57
  58 /*
  59  * Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious
  60  * initialization constants.
  61  */
  62 void MD5Init (struct MD5Context *ctx)
  63 {
  64     ctx->buf[0] = 0x67452301;
  65     ctx->buf[1] = 0xefcdab89;
  66     ctx->buf[2] = 0x98badcfe;
  67     ctx->buf[3] = 0x10325476;
  68
  69     ctx->bits[0] = 0;
  70     ctx->bits[1] = 0;
  71 }
  72
  73 /*
  74  * Update context to reflect the concatenation of another buffer full
  75  * of bytes.
  76  */
  77 void MD5Update (struct MD5Context *ctx, unsigned char const *buf,
  78                 unsigned len)
  79 {
  80     uint32 t;
  81
  82     /* Update bitcount */
  83
  84     t = ctx->bits[0];
  85     if ((ctx->bits[0] = t + ((uint32) len << 3)) < t)
  86         ctx->bits[1]++;         /* Carry from low to high */
  87     ctx->bits[1] += len >> 29;
  88
  89     t = (t >> 3) & 0x3f;        /* Bytes already in shsInfo->data */
  90
  91     /* Handle any leading odd-sized chunks */
  92
  93     if (t)
  94     {
  95         unsigned char *p = (unsigned char *) ctx->in + t;
  96
  97         t = 64 - t;
  98         if (len < t)
  99         {
 100             memcpy (p, buf, len);
 101             return;
 102         }
 103         memcpy (p, buf, t);
 104         byteReverse (ctx->in, 16);
 105         MD5Transform (ctx->buf, (uint32 *) ctx->in);
 106         buf += t;
 107         len -= t;
 108     }
 109     /* Process data in 64-byte chunks */
 110
 111     while (len >= 64)
 112     {
 113         memcpy (ctx->in, buf, 64);
 114         byteReverse (ctx->in, 16);
 115         MD5Transform (ctx->buf, (uint32 *) ctx->in);
 116         buf += 64;
 117         len -= 64;
 118     }
 119
 120     /* Handle any remaining bytes of data. */
 121
 122     memcpy (ctx->in, buf, len);
 123 }
 124
 125 /*
 126  * Final wrapup - pad to 64-byte boundary with the bit pattern
 127  * 1 0* (64-bit count of bits processed, MSB-first)
 128  */
 129 void MD5Final (unsigned char digest[16], struct MD5Context *ctx)
 130 {
 131     unsigned count;
 132     unsigned char *p;
 133
 134     /* Compute number of bytes mod 64 */
 135     count = (ctx->bits[0] >> 3) & 0x3F;
 136
 137     /* Set the first char of padding to 0x80.  This is safe since there is
 138        always at least one byte free */
 139     p = ctx->in + count;
 140     *p++ = 0x80;
 141
 142     /* Bytes of padding needed to make 64 bytes */
 143     count = 64 - 1 - count;
 144
 145     /* Pad out to 56 mod 64 */
 146     if (count < 8)
 147     {
 148         /* Two lots of padding:  Pad the first block to 64 bytes */
 149         memset (p, 0, count);
 150         byteReverse (ctx->in, 16);
 151         MD5Transform (ctx->buf, (uint32 *) ctx->in);
 152
 153         /* Now fill the next block with 56 bytes */
 154         memset (ctx->in, 0, 56);
 155     }
 156     else
 157     {
 158         /* Pad block to 56 bytes */
 159         memset (p, 0, count - 8);
 160     }
 161     byteReverse (ctx->in, 14);
 162
 163     /* Append length in bits and transform */
 164     ((uint32 *) ctx->in)[14] = ctx->bits[0];
 165     ((uint32 *) ctx->in)[15] = ctx->bits[1];
 166
 167     MD5Transform (ctx->buf, (uint32 *) ctx->in);
 168     byteReverse ((unsigned char *) ctx->buf, 4);
 169     memcpy (digest, ctx->buf, 16);
 170     memset (ctx, 0, sizeof (ctx));      /* In case it's sensitive */
 171 }
 172
 173 #ifndef ASM_MD5
 174
 175 /* The four core functions - F1 is optimized somewhat */
 176
 177 /* #define F1(x, y, z) (x & y | ~x & z) */
 178 #define F1(x, y, z) (z ^ (x & (y ^ z)))
 179 #define F2(x, y, z) F1(z, x, y)
 180 #define F3(x, y, z) (x ^ y ^ z)
 181 #define F4(x, y, z) (y ^ (x | ~z))
 182
 183 /* This is the central step in the MD5 algorithm. */
 184 #define MD5STEP(f, w, x, y, z, data, s) \
 185         ( w += f(x, y, z) + data,  w = w<<s | w>>(32-s),  w += x )
 186
 187 /*
 188  * The core of the MD5 algorithm, this alters an existing MD5 hash to
 189  * reflect the addition of 16 longwords of new data.  MD5Update blocks
 190  * the data and converts bytes into longwords for this routine.
 191  */
 192 void MD5Transform (uint32 buf[4], uint32 const in[16])
 193 {
 194     register uint32 a, b, c, d;
 195
 196     a = buf[0];
 197     b = buf[1];
 198     c = buf[2];
 199     d = buf[3];
 200
 201     MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478, 7);
 202     MD5STEP (F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
 203     MD5STEP (F1, c, d, a, b, in[2] + 0x242070db, 17);
 204     MD5STEP (F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
 205     MD5STEP (F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
 206     MD5STEP (F1, d, a, b, c, in[5] + 0x4787c62a, 12);
 207     MD5STEP (F1, c, d, a, b, in[6] + 0xa8304613, 17);
 208     MD5STEP (F1, b, c, d, a, in[7] + 0xfd469501, 22);
 209     MD5STEP (F1, a, b, c, d, in[8] + 0x698098d8, 7);
 210     MD5STEP (F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
 211     MD5STEP (F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
 212     MD5STEP (F1, b, c, d, a, in[11] + 0x895cd7be, 22);
 213     MD5STEP (F1, a, b, c, d, in[12] + 0x6b901122, 7);
 214     MD5STEP (F1, d, a, b, c, in[13] + 0xfd987193, 12);
 215     MD5STEP (F1, c, d, a, b, in[14] + 0xa679438e, 17);
 216     MD5STEP (F1, b, c, d, a, in[15] + 0x49b40821, 22);
 217
 218     MD5STEP (F2, a, b, c, d, in[1] + 0xf61e2562, 5);
 219     MD5STEP (F2, d, a, b, c, in[6] + 0xc040b340, 9);
 220     MD5STEP (F2, c, d, a, b, in[11] + 0x265e5a51, 14);
 221     MD5STEP (F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
 222     MD5STEP (F2, a, b, c, d, in[5] + 0xd62f105d, 5);
 223     MD5STEP (F2, d, a, b, c, in[10] + 0x02441453, 9);
 224     MD5STEP (F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
 225     MD5STEP (F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
 226     MD5STEP (F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
 227     MD5STEP (F2, d, a, b, c, in[14] + 0xc33707d6, 9);
 228     MD5STEP (F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
 229     MD5STEP (F2, b, c, d, a, in[8] + 0x455a14ed, 20);
 230     MD5STEP (F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
 231     MD5STEP (F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
 232     MD5STEP (F2, c, d, a, b, in[7] + 0x676f02d9, 14);
 233     MD5STEP (F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
 234
 235     MD5STEP (F3, a, b, c, d, in[5] + 0xfffa3942, 4);
 236     MD5STEP (F3, d, a, b, c, in[8] + 0x8771f681, 11);
 237     MD5STEP (F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
 238     MD5STEP (F3, b, c, d, a, in[14] + 0xfde5380c, 23);
 239     MD5STEP (F3, a, b, c, d, in[1] + 0xa4beea44, 4);
 240     MD5STEP (F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
 241     MD5STEP (F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
 242     MD5STEP (F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
 243     MD5STEP (F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
 244     MD5STEP (F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
 245     MD5STEP (F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
 246     MD5STEP (F3, b, c, d, a, in[6] + 0x04881d05, 23);
 247     MD5STEP (F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
 248     MD5STEP (F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
 249     MD5STEP (F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
 250     MD5STEP (F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
 251
 252     MD5STEP (F4, a, b, c, d, in[0] + 0xf4292244, 6);
 253     MD5STEP (F4, d, a, b, c, in[7] + 0x432aff97, 10);
 254     MD5STEP (F4, c, d, a, b, in[14] + 0xab9423a7, 15);
 255     MD5STEP (F4, b, c, d, a, in[5] + 0xfc93a039, 21);
 256     MD5STEP (F4, a, b, c, d, in[12] + 0x655b59c3, 6);
 257     MD5STEP (F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
 258     MD5STEP (F4, c, d, a, b, in[10] + 0xffeff47d, 15);
 259     MD5STEP (F4, b, c, d, a, in[1] + 0x85845dd1, 21);
 260     MD5STEP (F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
 261     MD5STEP (F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
 262     MD5STEP (F4, c, d, a, b, in[6] + 0xa3014314, 15);
 263     MD5STEP (F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
 264     MD5STEP (F4, a, b, c, d, in[4] + 0xf7537e82, 6);
 265     MD5STEP (F4, d, a, b, c, in[11] + 0xbd3af235, 10);
 266     MD5STEP (F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
 267     MD5STEP (F4, b, c, d, a, in[9] + 0xeb86d391, 21);
 268
 269     buf[0] += a;
 270     buf[1] += b;
 271     buf[2] += c;
 272     buf[3] += d;
 273 }
 274
 275 #endif