lib/mdfour.c

   1 /*
   2    Unix SMB/Netbios implementation.
   3    Version 1.9.
   4    a implementation of MD4 designed for use in the SMB authentication protocol
   5    Copyright (C) Andrew Tridgell 1997-1998.
   6
   7    This program is free software; you can redistribute it and/or modify
   8    it under the terms of the GNU General Public License as published by
   9    the Free Software Foundation; either version 2 of the License, or
  10    (at your option) any later version.
  11
  12    This program is distributed in the hope that it will be useful,
  13    but WITHOUT ANY WARRANTY; without even the implied warranty of
  14    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15    GNU General Public License for more details.
  16
  17    You should have received a copy of the GNU General Public License
  18    along with this program; if not, write to the Free Software
  19    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  20 */
  21
  22 #include "rsync.h"
  23
  24 /* NOTE: This code makes no attempt to be fast!
  25
  26    It assumes that a int is at least 32 bits long
  27 */
  28
  29 static struct mdfour *m;
  30
  31 #define MASK32 (0xffffffff)
  32
  33 #define F(X,Y,Z) ((((X)&(Y)) | ((~(X))&(Z))))
  34 #define G(X,Y,Z) ((((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z))))
  35 #define H(X,Y,Z) (((X)^(Y)^(Z)))
  36 #define lshift(x,s) (((((x)<<(s))&MASK32) | (((x)>>(32-(s)))&MASK32)))
  37
  38 #define ROUND1(a,b,c,d,k,s) a = lshift((a + F(b,c,d) + M[k])&MASK32, s)
  39 #define ROUND2(a,b,c,d,k,s) a = lshift((a + G(b,c,d) + M[k] + 0x5A827999)&MASK32,s)
  40 #define ROUND3(a,b,c,d,k,s) a = lshift((a + H(b,c,d) + M[k] + 0x6ED9EBA1)&MASK32,s)
  41
  42 /* this applies md4 to 64 byte chunks */
  43 static void mdfour64(uint32 *M)
  44 {
  45         uint32 AA, BB, CC, DD;
  46         uint32 A,B,C,D;
  47
  48         A = m->A; B = m->B; C = m->C; D = m->D;
  49         AA = A; BB = B; CC = C; DD = D;
  50
  51         ROUND1(A,B,C,D,  0,  3);  ROUND1(D,A,B,C,  1,  7);
  52         ROUND1(C,D,A,B,  2, 11);  ROUND1(B,C,D,A,  3, 19);
  53         ROUND1(A,B,C,D,  4,  3);  ROUND1(D,A,B,C,  5,  7);
  54         ROUND1(C,D,A,B,  6, 11);  ROUND1(B,C,D,A,  7, 19);
  55         ROUND1(A,B,C,D,  8,  3);  ROUND1(D,A,B,C,  9,  7);
  56         ROUND1(C,D,A,B, 10, 11);  ROUND1(B,C,D,A, 11, 19);
  57         ROUND1(A,B,C,D, 12,  3);  ROUND1(D,A,B,C, 13,  7);
  58         ROUND1(C,D,A,B, 14, 11);  ROUND1(B,C,D,A, 15, 19);
  59
  60
  61         ROUND2(A,B,C,D,  0,  3);  ROUND2(D,A,B,C,  4,  5);
  62         ROUND2(C,D,A,B,  8,  9);  ROUND2(B,C,D,A, 12, 13);
  63         ROUND2(A,B,C,D,  1,  3);  ROUND2(D,A,B,C,  5,  5);
  64         ROUND2(C,D,A,B,  9,  9);  ROUND2(B,C,D,A, 13, 13);
  65         ROUND2(A,B,C,D,  2,  3);  ROUND2(D,A,B,C,  6,  5);
  66         ROUND2(C,D,A,B, 10,  9);  ROUND2(B,C,D,A, 14, 13);
  67         ROUND2(A,B,C,D,  3,  3);  ROUND2(D,A,B,C,  7,  5);
  68         ROUND2(C,D,A,B, 11,  9);  ROUND2(B,C,D,A, 15, 13);
  69
  70         ROUND3(A,B,C,D,  0,  3);  ROUND3(D,A,B,C,  8,  9);
  71         ROUND3(C,D,A,B,  4, 11);  ROUND3(B,C,D,A, 12, 15);
  72         ROUND3(A,B,C,D,  2,  3);  ROUND3(D,A,B,C, 10,  9);
  73         ROUND3(C,D,A,B,  6, 11);  ROUND3(B,C,D,A, 14, 15);
  74         ROUND3(A,B,C,D,  1,  3);  ROUND3(D,A,B,C,  9,  9);
  75         ROUND3(C,D,A,B,  5, 11);  ROUND3(B,C,D,A, 13, 15);
  76         ROUND3(A,B,C,D,  3,  3);  ROUND3(D,A,B,C, 11,  9);
  77         ROUND3(C,D,A,B,  7, 11);  ROUND3(B,C,D,A, 15, 15);
  78
  79         A += AA; B += BB;
  80         C += CC; D += DD;
  81
  82         A &= MASK32; B &= MASK32;
  83         C &= MASK32; D &= MASK32;
  84
  85         m->A = A; m->B = B; m->C = C; m->D = D;
  86 }
  87
  88 static void copy64(uint32 *M, unsigned char *in)
  89 {
  90         int i;
  91
  92         for (i=0;i<16;i++)
  93                 M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
  94                         (in[i*4+1]<<8) | (in[i*4+0]<<0);
  95 }
  96
  97 static void copy4(unsigned char *out,uint32 x)
  98 {
  99         out[0] = x&0xFF;
 100         out[1] = (x>>8)&0xFF;
 101         out[2] = (x>>16)&0xFF;
 102         out[3] = (x>>24)&0xFF;
 103 }
 104
 105 void mdfour_begin(struct mdfour *md)
 106 {
 107         md->A = 0x67452301;
 108         md->B = 0xefcdab89;
 109         md->C = 0x98badcfe;
 110         md->D = 0x10325476;
 111         md->totalN = 0;
 112 }
 113
 114
 115 static void mdfour_tail(unsigned char *in, int n)
 116 {
 117         unsigned char buf[128];
 118         uint32 M[16];
 119         uint32 b;
 120
 121         m->totalN += n;
 122
 123         b = m->totalN * 8;
 124
 125         memset(buf, 0, 128);
 126         if (n) memcpy(buf, in, n);
 127         buf[n] = 0x80;
 128
 129         if (n <= 55) {
 130                 copy4(buf+56, b);
 131                 copy64(M, buf);
 132                 mdfour64(M);
 133         } else {
 134                 copy4(buf+120, b);
 135                 copy64(M, buf);
 136                 mdfour64(M);
 137                 copy64(M, buf+64);
 138                 mdfour64(M);
 139         }
 140 }
 141
 142 void mdfour_update(struct mdfour *md, unsigned char *in, int n)
 143 {
 144         uint32 M[16];
 145
 146         if (n == 0) mdfour_tail(in, n);
 147
 148         m = md;
 149
 150         while (n >= 64) {
 151                 copy64(M, in);
 152                 mdfour64(M);
 153                 in += 64;
 154                 n -= 64;
 155                 m->totalN += 64;
 156         }
 157
 158         if (n) mdfour_tail(in, n);
 159 }
 160
 161
 162 void mdfour_result(struct mdfour *md, unsigned char *out)
 163 {
 164         m = md;
 165
 166         copy4(out, m->A);
 167         copy4(out+4, m->B);
 168         copy4(out+8, m->C);
 169         copy4(out+12, m->D);
 170 }
 171
 172
 173 void mdfour(unsigned char *out, unsigned char *in, int n)
 174 {
 175         struct mdfour md;
 176         mdfour_begin(&md);
 177         mdfour_update(&md, in, n);
 178         mdfour_result(&md, out);
 179 }
 180
 181 #ifdef TEST_MDFOUR
 182 static void file_checksum1(char *fname)
 183 {
 184         int fd, i;
 185         struct mdfour md;
 186         unsigned char buf[64*1024], sum[16];
 187
 188         fd = open(fname,O_RDONLY);
 189         if (fd == -1) {
 190                 perror("fname");
 191                 exit(1);
 192         }
 193
 194         mdfour_begin(&md);
 195
 196         while (1) {
 197                 int n = read(fd, buf, sizeof(buf));
 198                 if (n <= 0) break;
 199                 mdfour_update(&md, buf, n);
 200         }
 201
 202         close(fd);
 203
 204         mdfour_result(&md, sum);
 205
 206         for (i=0;i<16;i++)
 207                 printf("%02X", sum[i]);
 208         printf("\n");
 209 }
 210
 211 #if 0
 212 #include "../md4.h"
 213
 214 static void file_checksum2(char *fname)
 215 {
 216         int fd, i;
 217         MDstruct md;
 218         unsigned char buf[64], sum[16];
 219
 220         fd = open(fname,O_RDONLY);
 221         if (fd == -1) {
 222                 perror("fname");
 223                 exit(1);
 224         }
 225
 226         MDbegin(&md);
 227
 228         while (1) {
 229                 int n = read(fd, buf, sizeof(buf));
 230                 if (n <= 0) break;
 231                 MDupdate(&md, buf, n*8);
 232         }
 233
 234         if (!md.done) {
 235                 MDupdate(&md, buf, 0);
 236         }
 237
 238         close(fd);
 239
 240         memcpy(sum, md.buffer, 16);
 241
 242         for (i=0;i<16;i++)
 243                 printf("%02X", sum[i]);
 244         printf("\n");
 245 }
 246 #endif
 247
 248  int main(int argc, char *argv[])
 249 {
 250         file_checksum1(argv[1]);
 251 #if 0
 252         file_checksum2(argv[1]);
 253 #endif
 254         return 0;
 255 }
 256 #endif