wsutil/md4.c

   1 /*
   2    Unix SMB/CIFS implementation.
   3    a implementation of MD4 designed for use in the SMB authentication protocol
   4    Copyright (C) Andrew Tridgell 1997-1998.
   5
   6    $Id$
   7
   8    This program is free software; you can redistribute it and/or modify
   9    it under the terms of the GNU General Public License as published by
  10    the Free Software Foundation; either version 2 of the License, or
  11    (at your option) any later version.
  12
  13    This program is distributed in the hope that it will be useful,
  14    but WITHOUT ANY WARRANTY; without even the implied warranty of
  15    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16    GNU General Public License for more details.
  17
  18    You should have received a copy of the GNU General Public License
  19    along with this program; if not, write to the Free Software
  20    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  21 */
  22
  23 #include "config.h"
  24
  25 #include <glib.h>
  26 #include <string.h>
  27
  28 #include "md4.h"
  29
  30 /* NOTE: This code makes no attempt to be fast!
  31
  32    It assumes that a int is at least 32 bits long
  33 */
  34
  35 static guint32 A, B, C, D;
  36
  37 static guint32 F(guint32 X, guint32 Y, guint32 Z)
  38 {
  39         return (X&Y) | ((~X)&Z);
  40 }
  41
  42 static guint32 G(guint32 X, guint32 Y, guint32 Z)
  43 {
  44         return (X&Y) | (X&Z) | (Y&Z);
  45 }
  46
  47 static guint32 H(guint32 X, guint32 Y, guint32 Z)
  48 {
  49         return X^Y^Z;
  50 }
  51
  52 static guint32 lshift(guint32 x, int s)
  53 {
  54         x &= 0xFFFFFFFF;
  55         return ((x<<s)&0xFFFFFFFF) | (x>>(32-s));
  56 }
  57
  58 #define ROUND1(a,b,c,d,k,s) a = lshift(a + F(b,c,d) + X[k], s)
  59 #define ROUND2(a,b,c,d,k,s) a = lshift(a + G(b,c,d) + X[k] + (guint32)0x5A827999,s)
  60 #define ROUND3(a,b,c,d,k,s) a = lshift(a + H(b,c,d) + X[k] + (guint32)0x6ED9EBA1,s)
  61
  62 /* this applies md4 to 64 byte chunks */
  63 static void mdfour64(guint32 *M)
  64 {
  65         int j;
  66         guint32 AA, BB, CC, DD;
  67         guint32 X[16];
  68
  69         for (j=0;j<16;j++)
  70                 X[j] = M[j];
  71
  72         AA = A; BB = B; CC = C; DD = D;
  73
  74         ROUND1(A,B,C,D,  0,  3);  ROUND1(D,A,B,C,  1,  7);
  75         ROUND1(C,D,A,B,  2, 11);  ROUND1(B,C,D,A,  3, 19);
  76         ROUND1(A,B,C,D,  4,  3);  ROUND1(D,A,B,C,  5,  7);
  77         ROUND1(C,D,A,B,  6, 11);  ROUND1(B,C,D,A,  7, 19);
  78         ROUND1(A,B,C,D,  8,  3);  ROUND1(D,A,B,C,  9,  7);
  79         ROUND1(C,D,A,B, 10, 11);  ROUND1(B,C,D,A, 11, 19);
  80         ROUND1(A,B,C,D, 12,  3);  ROUND1(D,A,B,C, 13,  7);
  81         ROUND1(C,D,A,B, 14, 11);  ROUND1(B,C,D,A, 15, 19);
  82
  83         ROUND2(A,B,C,D,  0,  3);  ROUND2(D,A,B,C,  4,  5);
  84         ROUND2(C,D,A,B,  8,  9);  ROUND2(B,C,D,A, 12, 13);
  85         ROUND2(A,B,C,D,  1,  3);  ROUND2(D,A,B,C,  5,  5);
  86         ROUND2(C,D,A,B,  9,  9);  ROUND2(B,C,D,A, 13, 13);
  87         ROUND2(A,B,C,D,  2,  3);  ROUND2(D,A,B,C,  6,  5);
  88         ROUND2(C,D,A,B, 10,  9);  ROUND2(B,C,D,A, 14, 13);
  89         ROUND2(A,B,C,D,  3,  3);  ROUND2(D,A,B,C,  7,  5);
  90         ROUND2(C,D,A,B, 11,  9);  ROUND2(B,C,D,A, 15, 13);
  91
  92         ROUND3(A,B,C,D,  0,  3);  ROUND3(D,A,B,C,  8,  9);
  93         ROUND3(C,D,A,B,  4, 11);  ROUND3(B,C,D,A, 12, 15);
  94         ROUND3(A,B,C,D,  2,  3);  ROUND3(D,A,B,C, 10,  9);
  95         ROUND3(C,D,A,B,  6, 11);  ROUND3(B,C,D,A, 14, 15);
  96         ROUND3(A,B,C,D,  1,  3);  ROUND3(D,A,B,C,  9,  9);
  97         ROUND3(C,D,A,B,  5, 11);  ROUND3(B,C,D,A, 13, 15);
  98         ROUND3(A,B,C,D,  3,  3);  ROUND3(D,A,B,C, 11,  9);
  99         ROUND3(C,D,A,B,  7, 11);  ROUND3(B,C,D,A, 15, 15);
 100
 101         A += AA; B += BB; C += CC; D += DD;
 102
 103         A &= 0xFFFFFFFF; B &= 0xFFFFFFFF;
 104         C &= 0xFFFFFFFF; D &= 0xFFFFFFFF;
 105
 106         for (j=0;j<16;j++)
 107                 X[j] = 0;
 108 }
 109
 110 static void copy64(guint32 *M, const unsigned char *in)
 111 {
 112         int i;
 113
 114         for (i=0;i<16;i++)
 115                 M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
 116                         (in[i*4+1]<<8) | (in[i*4+0]<<0);
 117 }
 118
 119 static void copy4(unsigned char *out, guint32 x)
 120 {
 121         out[0] = x&0xFF;
 122         out[1] = (x>>8)&0xFF;
 123         out[2] = (x>>16)&0xFF;
 124         out[3] = (x>>24)&0xFF;
 125 }
 126
 127 /* produce a md4 message digest from data of length n bytes */
 128 void crypt_md4(unsigned char *out, const unsigned char *in, size_t n)
 129 {
 130         unsigned char buf[128];
 131         guint32 M[16];
 132         guint32 b = (guint32)(n * 8);
 133         int i;
 134
 135         A = 0x67452301;
 136         B = 0xefcdab89;
 137         C = 0x98badcfe;
 138         D = 0x10325476;
 139
 140         while (n > 64) {
 141                 copy64(M, in);
 142                 mdfour64(M);
 143                 in += 64;
 144                 n -= 64;
 145         }
 146
 147         for (i=0;i<128;i++)
 148                 buf[i] = 0;
 149         memcpy(buf, in, n);
 150         buf[n] = 0x80;
 151
 152         if (n <= 55) {
 153                 copy4(buf+56, b);
 154                 copy64(M, buf);
 155                 mdfour64(M);
 156         } else {
 157                 copy4(buf+120, b);
 158                 copy64(M, buf);
 159                 mdfour64(M);
 160                 copy64(M, buf+64);
 161                 mdfour64(M);
 162         }
 163
 164         for (i=0;i<128;i++)
 165                 buf[i] = 0;
 166         copy64(M, buf);
 167
 168         copy4(out, A);
 169         copy4(out+4, B);
 170         copy4(out+8, C);
 171         copy4(out+12, D);
 172
 173         A = B = C = D = 0;
 174 }
 175
 176