dlls/advapi32/crypt_md4.c

   1 /*
   2  * Copyright (C) 2001 Nikos Mavroyanopoulos
   3  * Copyright (C) 2004 Hans Leidekker
   4  *
   5  * This library is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU Lesser General Public
   7  * License as published by the Free Software Foundation; either
   8  * version 2.1 of the License, or (at your option) any later version.
   9  *
  10  * This library is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  * Lesser General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU Lesser General Public
  16  * License along with this library; if not, write to the Free Software
  17  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  18  */
  19
  20 /*
  21  * This code implements the MD4 message-digest algorithm.
  22  * It is based on code in the public domain written by Colin
  23  * Plumb in 1993. The algorithm is due to Ron Rivest.
  24  *
  25  * Equivalent code is available from RSA Data Security, Inc.
  26  * This code has been tested against that, and is equivalent,
  27  * except that you don't need to include two pages of legalese
  28  * with every copy.
  29  *
  30  * To compute the message digest of a chunk of bytes, declare an
  31  * MD4_CTX structure, pass it to MD4Init, call MD4Update as
  32  * needed on buffers full of bytes, and then call MD4Final, which
  33  * will fill a supplied 16-byte array with the digest.
  34  */
  35
  36 #include <stdarg.h>
  37
  38 #include "windef.h"
  39
  40 typedef struct
  41 {
  42     unsigned int buf[4];
  43     unsigned int i[2];
  44     unsigned char in[64];
  45     unsigned char digest[16];
  46 } MD4_CTX;
  47
  48 static void MD4Transform( unsigned int buf[4], unsigned int const in[16] );
  49
  50 /*
  51  * Note: this code is harmless on little-endian machines.
  52  */
  53 static void byteReverse( unsigned char *buf, unsigned longs )
  54 {
  55     unsigned int t;
  56
  57     do {
  58         t = (unsigned int)((unsigned)buf[3] << 8 | buf[2]) << 16 |
  59             ((unsigned)buf[1] << 8 | buf[0]);
  60         *(unsigned int *)buf = t;
  61         buf += 4;
  62     } while (--longs);
  63 }
  64
  65 /*
  66  * Start MD4 accumulation.  Set bit count to 0 and buffer to mysterious
  67  * initialization constants.
  68  */
  69 VOID WINAPI MD4Init( MD4_CTX *ctx )
  70 {
  71     ctx->buf[0] = 0x67452301;
  72     ctx->buf[1] = 0xefcdab89;
  73     ctx->buf[2] = 0x98badcfe;
  74     ctx->buf[3] = 0x10325476;
  75
  76     ctx->i[0] = ctx->i[1] = 0;
  77 }
  78
  79 /*
  80  * Update context to reflect the concatenation of another buffer full
  81  * of bytes.
  82  */
  83 VOID WINAPI MD4Update( MD4_CTX *ctx, const unsigned char *buf, unsigned int len )
  84 {
  85     register unsigned int t;
  86
  87     /* Update bitcount */
  88     t = ctx->i[0];
  89
  90     if ((ctx->i[0] = t + ((unsigned int)len << 3)) < t)
  91         ctx->i[1]++;        /* Carry from low to high */
  92
  93     ctx->i[1] += len >> 29;
  94     t = (t >> 3) & 0x3f;
  95
  96     /* Handle any leading odd-sized chunks */
  97     if (t)
  98     {
  99         unsigned char *p = (unsigned char *)ctx->in + t;
 100         t = 64 - t;
 101
 102         if (len < t)
 103         {
 104             memcpy( p, buf, len );
 105             return;
 106         }
 107
 108         memcpy( p, buf, t );
 109         byteReverse( ctx->in, 16 );
 110
 111         MD4Transform( ctx->buf, (unsigned int *)ctx->in );
 112
 113         buf += t;
 114         len -= t;
 115     }
 116
 117     /* Process data in 64-byte chunks */
 118     while (len >= 64)
 119     {
 120         memcpy( ctx->in, buf, 64 );
 121         byteReverse( ctx->in, 16 );
 122
 123         MD4Transform( ctx->buf, (unsigned int *)ctx->in );
 124
 125         buf += 64;
 126         len -= 64;
 127     }
 128
 129     /* Handle any remaining bytes of data. */
 130     memcpy( ctx->in, buf, len );
 131 }
 132
 133 /*
 134  * Final wrapup - pad to 64-byte boundary with the bit pattern
 135  * 1 0* (64-bit count of bits processed, MSB-first)
 136  */
 137 VOID WINAPI MD4Final( MD4_CTX *ctx )
 138 {
 139     unsigned int count;
 140     unsigned char *p;
 141
 142     /* Compute number of bytes mod 64 */
 143     count = (ctx->i[0] >> 3) & 0x3F;
 144
 145     /* Set the first char of padding to 0x80.  This is safe since there is
 146        always at least one byte free */
 147     p = ctx->in + count;
 148     *p++ = 0x80;
 149
 150     /* Bytes of padding needed to make 64 bytes */
 151     count = 64 - 1 - count;
 152
 153     /* Pad out to 56 mod 64 */
 154     if (count < 8)
 155     {
 156         /* Two lots of padding:  Pad the first block to 64 bytes */
 157         memset( p, 0, count );
 158         byteReverse( ctx->in, 16 );
 159         MD4Transform( ctx->buf, (unsigned int *)ctx->in );
 160
 161         /* Now fill the next block with 56 bytes */
 162         memset( ctx->in, 0, 56 );
 163     }
 164     else
 165     {
 166         /* Pad block to 56 bytes */
 167         memset( p, 0, count - 8 );
 168     }
 169
 170     byteReverse( ctx->in, 14 );
 171
 172     /* Append length in bits and transform */
 173     ((unsigned int *)ctx->in)[14] = ctx->i[0];
 174     ((unsigned int *)ctx->in)[15] = ctx->i[1];
 175
 176     MD4Transform( ctx->buf, (unsigned int *)ctx->in );
 177     byteReverse( (unsigned char *)ctx->buf, 4 );
 178     memcpy( ctx->digest, ctx->buf, 16 );
 179 }
 180
 181 /* The three core functions */
 182
 183 #define rotl32(x,n)  (((x) << ((unsigned int)(n))) | ((x) >> (32 - (unsigned int)(n))))
 184
 185 #define F( x, y, z ) (((x) & (y)) | ((~x) & (z)))
 186 #define G( x, y, z ) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
 187 #define H( x, y, z ) ((x) ^ (y) ^ (z))
 188
 189 #define FF( a, b, c, d, x, s ) { \
 190     (a) += F( (b), (c), (d) ) + (x); \
 191     (a) = rotl32( (a), (s) ); \
 192   }
 193 #define GG( a, b, c, d, x, s ) { \
 194     (a) += G( (b), (c), (d) ) + (x) + (unsigned int)0x5a827999; \
 195     (a) = rotl32( (a), (s) ); \
 196   }
 197 #define HH( a, b, c, d, x, s ) { \
 198     (a) += H( (b), (c), (d) ) + (x) + (unsigned int)0x6ed9eba1; \
 199     (a) = rotl32( (a), (s) ); \
 200   }
 201
 202 /*
 203  * The core of the MD4 algorithm
 204  */
 205 static void MD4Transform( unsigned int buf[4], const unsigned int in[16] )
 206 {
 207     register unsigned int a, b, c, d;
 208
 209     a = buf[0];
 210     b = buf[1];
 211     c = buf[2];
 212     d = buf[3];
 213
 214     FF( a, b, c, d, in[0], 3 );
 215     FF( d, a, b, c, in[1], 7 );
 216     FF( c, d, a, b, in[2], 11 );
 217     FF( b, c, d, a, in[3], 19 );
 218     FF( a, b, c, d, in[4], 3 );
 219     FF( d, a, b, c, in[5], 7 );
 220     FF( c, d, a, b, in[6], 11 );
 221     FF( b, c, d, a, in[7], 19 );
 222     FF( a, b, c, d, in[8], 3 );
 223     FF( d, a, b, c, in[9], 7 );
 224     FF( c, d, a, b, in[10], 11 );
 225     FF( b, c, d, a, in[11], 19 );
 226     FF( a, b, c, d, in[12], 3 );
 227     FF( d, a, b, c, in[13], 7 );
 228     FF( c, d, a, b, in[14], 11 );
 229     FF( b, c, d, a, in[15], 19 );
 230
 231     GG( a, b, c, d, in[0], 3 );
 232     GG( d, a, b, c, in[4], 5 );
 233     GG( c, d, a, b, in[8], 9 );
 234     GG( b, c, d, a, in[12], 13 );
 235     GG( a, b, c, d, in[1], 3 );
 236     GG( d, a, b, c, in[5], 5 );
 237     GG( c, d, a, b, in[9], 9 );
 238     GG( b, c, d, a, in[13], 13 );
 239     GG( a, b, c, d, in[2], 3 );
 240     GG( d, a, b, c, in[6], 5 );
 241     GG( c, d, a, b, in[10], 9 );
 242     GG( b, c, d, a, in[14], 13 );
 243     GG( a, b, c, d, in[3], 3 );
 244     GG( d, a, b, c, in[7], 5 );
 245     GG( c, d, a, b, in[11], 9 );
 246     GG( b, c, d, a, in[15], 13 );
 247
 248     HH( a, b, c, d, in[0], 3 );
 249     HH( d, a, b, c, in[8], 9 );
 250     HH( c, d, a, b, in[4], 11 );
 251     HH( b, c, d, a, in[12], 15 );
 252     HH( a, b, c, d, in[2], 3 );
 253     HH( d, a, b, c, in[10], 9 );
 254     HH( c, d, a, b, in[6], 11 );
 255     HH( b, c, d, a, in[14], 15 );
 256     HH( a, b, c, d, in[1], 3 );
 257     HH( d, a, b, c, in[9], 9 );
 258     HH( c, d, a, b, in[5], 11 );
 259     HH( b, c, d, a, in[13], 15 );
 260     HH( a, b, c, d, in[3], 3 );
 261     HH( d, a, b, c, in[11], 9 );
 262     HH( c, d, a, b, in[7], 11 );
 263     HH( b, c, d, a, in[15], 15 );
 264
 265     buf[0] += a;
 266     buf[1] += b;
 267     buf[2] += c;
 268     buf[3] += d;
 269 }