wpa_supplicant_node: wpa_supplicant_node: md5-internal.c Source File

00001 /*
00002  * MD5 hash implementation and interface functions
00003  * Copyright (c) 2003-2005, Jouni Malinen <j@w1.fi>
00004  *
00005  * This program is free software; you can redistribute it and/or modify
00006  * it under the terms of the GNU General Public License version 2 as
00007  * published by the Free Software Foundation.
00008  *
00009  * Alternatively, this software may be distributed under the terms of BSD
00010  * license.
00011  *
00012  * See README and COPYING for more details.
00013  */
00014 
00015 #include "includes.h"
00016 
00017 #include "common.h"
00018 #include "md5.h"
00019 #include "md5_i.h"
00020 #include "crypto.h"
00021 
00022 
00023 static void MD5Transform(u32 buf[4], u32 const in[16]);
00024 
00025 
00026 typedef struct MD5Context MD5_CTX;
00027 
00028 
00037 int md5_vector(size_t num_elem, const u8 *addr[], const size_t *len, u8 *mac)
00038 {
00039         MD5_CTX ctx;
00040         size_t i;
00041 
00042         MD5Init(&ctx);
00043         for (i = 0; i < num_elem; i++)
00044                 MD5Update(&ctx, addr[i], len[i]);
00045         MD5Final(mac, &ctx);
00046         return 0;
00047 }
00048 
00049 
00050 /* ===== start - public domain MD5 implementation ===== */
00051 /*
00052  * This code implements the MD5 message-digest algorithm.
00053  * The algorithm is due to Ron Rivest.  This code was
00054  * written by Colin Plumb in 1993, no copyright is claimed.
00055  * This code is in the public domain; do with it what you wish.
00056  *
00057  * Equivalent code is available from RSA Data Security, Inc.
00058  * This code has been tested against that, and is equivalent,
00059  * except that you don't need to include two pages of legalese
00060  * with every copy.
00061  *
00062  * To compute the message digest of a chunk of bytes, declare an
00063  * MD5Context structure, pass it to MD5Init, call MD5Update as
00064  * needed on buffers full of bytes, and then call MD5Final, which
00065  * will fill a supplied 16-byte array with the digest.
00066  */
00067 
00068 #ifndef WORDS_BIGENDIAN
00069 #define byteReverse(buf, len)   /* Nothing */
00070 #else
00071 /*
00072  * Note: this code is harmless on little-endian machines.
00073  */
00074 static void byteReverse(unsigned char *buf, unsigned longs)
00075 {
00076     u32 t;
00077     do {
00078         t = (u32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
00079             ((unsigned) buf[1] << 8 | buf[0]);
00080         *(u32 *) buf = t;
00081         buf += 4;
00082     } while (--longs);
00083 }
00084 #endif
00085 
00086 /*
00087  * Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious
00088  * initialization constants.
00089  */
00090 void MD5Init(struct MD5Context *ctx)
00091 {
00092     ctx->buf[0] = 0x67452301;
00093     ctx->buf[1] = 0xefcdab89;
00094     ctx->buf[2] = 0x98badcfe;
00095     ctx->buf[3] = 0x10325476;
00096 
00097     ctx->bits[0] = 0;
00098     ctx->bits[1] = 0;
00099 }
00100 
00101 /*
00102  * Update context to reflect the concatenation of another buffer full
00103  * of bytes.
00104  */
00105 void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
00106 {
00107     u32 t;
00108 
00109     /* Update bitcount */
00110 
00111     t = ctx->bits[0];
00112     if ((ctx->bits[0] = t + ((u32) len << 3)) < t)
00113         ctx->bits[1]++;         /* Carry from low to high */
00114     ctx->bits[1] += len >> 29;
00115 
00116     t = (t >> 3) & 0x3f;        /* Bytes already in shsInfo->data */
00117 
00118     /* Handle any leading odd-sized chunks */
00119 
00120     if (t) {
00121         unsigned char *p = (unsigned char *) ctx->in + t;
00122 
00123         t = 64 - t;
00124         if (len < t) {
00125             os_memcpy(p, buf, len);
00126             return;
00127         }
00128         os_memcpy(p, buf, t);
00129         byteReverse(ctx->in, 16);
00130         MD5Transform(ctx->buf, (u32 *) ctx->in);
00131         buf += t;
00132         len -= t;
00133     }
00134     /* Process data in 64-byte chunks */
00135 
00136     while (len >= 64) {
00137         os_memcpy(ctx->in, buf, 64);
00138         byteReverse(ctx->in, 16);
00139         MD5Transform(ctx->buf, (u32 *) ctx->in);
00140         buf += 64;
00141         len -= 64;
00142     }
00143 
00144     /* Handle any remaining bytes of data. */
00145 
00146     os_memcpy(ctx->in, buf, len);
00147 }
00148 
00149 /*
00150  * Final wrapup - pad to 64-byte boundary with the bit pattern
00151  * 1 0* (64-bit count of bits processed, MSB-first)
00152  */
00153 void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
00154 {
00155     unsigned count;
00156     unsigned char *p;
00157 
00158     /* Compute number of bytes mod 64 */
00159     count = (ctx->bits[0] >> 3) & 0x3F;
00160 
00161     /* Set the first char of padding to 0x80.  This is safe since there is
00162        always at least one byte free */
00163     p = ctx->in + count;
00164     *p++ = 0x80;
00165 
00166     /* Bytes of padding needed to make 64 bytes */
00167     count = 64 - 1 - count;
00168 
00169     /* Pad out to 56 mod 64 */
00170     if (count < 8) {
00171         /* Two lots of padding:  Pad the first block to 64 bytes */
00172         os_memset(p, 0, count);
00173         byteReverse(ctx->in, 16);
00174         MD5Transform(ctx->buf, (u32 *) ctx->in);
00175 
00176         /* Now fill the next block with 56 bytes */
00177         os_memset(ctx->in, 0, 56);
00178     } else {
00179         /* Pad block to 56 bytes */
00180         os_memset(p, 0, count - 8);
00181     }
00182     byteReverse(ctx->in, 14);
00183 
00184     /* Append length in bits and transform */
00185     ((u32 *) ctx->in)[14] = ctx->bits[0];
00186     ((u32 *) ctx->in)[15] = ctx->bits[1];
00187 
00188     MD5Transform(ctx->buf, (u32 *) ctx->in);
00189     byteReverse((unsigned char *) ctx->buf, 4);
00190     os_memcpy(digest, ctx->buf, 16);
00191     os_memset(ctx, 0, sizeof(ctx));     /* In case it's sensitive */
00192 }
00193 
00194 /* The four core functions - F1 is optimized somewhat */
00195 
00196 /* #define F1(x, y, z) (x & y | ~x & z) */
00197 #define F1(x, y, z) (z ^ (x & (y ^ z)))
00198 #define F2(x, y, z) F1(z, x, y)
00199 #define F3(x, y, z) (x ^ y ^ z)
00200 #define F4(x, y, z) (y ^ (x | ~z))
00201 
00202 /* This is the central step in the MD5 algorithm. */
00203 #define MD5STEP(f, w, x, y, z, data, s) \
00204         ( w += f(x, y, z) + data,  w = w<<s | w>>(32-s),  w += x )
00205 
00206 /*
00207  * The core of the MD5 algorithm, this alters an existing MD5 hash to
00208  * reflect the addition of 16 longwords of new data.  MD5Update blocks
00209  * the data and converts bytes into longwords for this routine.
00210  */
00211 static void MD5Transform(u32 buf[4], u32 const in[16])
00212 {
00213     register u32 a, b, c, d;
00214 
00215     a = buf[0];
00216     b = buf[1];
00217     c = buf[2];
00218     d = buf[3];
00219 
00220     MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
00221     MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
00222     MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
00223     MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
00224     MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
00225     MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
00226     MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
00227     MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
00228     MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
00229     MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
00230     MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
00231     MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
00232     MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
00233     MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
00234     MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
00235     MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
00236 
00237     MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
00238     MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
00239     MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
00240     MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
00241     MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
00242     MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
00243     MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
00244     MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
00245     MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
00246     MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
00247     MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
00248     MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
00249     MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
00250     MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
00251     MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
00252     MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
00253 
00254     MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
00255     MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
00256     MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
00257     MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
00258     MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
00259     MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
00260     MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
00261     MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
00262     MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
00263     MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
00264     MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
00265     MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
00266     MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
00267     MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
00268     MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
00269     MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
00270 
00271     MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
00272     MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
00273     MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
00274     MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
00275     MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
00276     MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
00277     MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
00278     MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
00279     MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
00280     MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
00281     MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
00282     MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
00283     MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
00284     MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
00285     MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
00286     MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
00287 
00288     buf[0] += a;
00289     buf[1] += b;
00290     buf[2] += c;
00291     buf[3] += d;
00292 }
00293 /* ===== end - public domain MD5 implementation ===== */