md5.cpp

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

Generated on Sun Jul 10 03:23:00 2005 for VooDoo cIRCle by doxygen 1.4.3

Hosted by SourceForge.net Logo