2 Unix SMB/Netbios implementation.
4 a implementation of MD4 designed for use in the SMB authentication protocol
5 Copyright (C) Andrew Tridgell 1997-1998.
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.
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.
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.
24 /* NOTE: This code makes no attempt to be fast!
26 It assumes that a int is at least 32 bits long
29 static struct mdfour *m;
31 #define MASK32 (0xffffffff)
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)))
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)
42 /* this applies md4 to 64 byte chunks */
43 static void mdfour64(uint32 *M)
45 uint32 AA, BB, CC, DD;
48 A = m->A; B = m->B; C = m->C; D = m->D;
49 AA = A; BB = B; CC = C; DD = D;
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);
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);
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);
82 A &= MASK32; B &= MASK32;
83 C &= MASK32; D &= MASK32;
85 m->A = A; m->B = B; m->C = C; m->D = D;
88 static void copy64(uint32 *M, unsigned char *in)
93 M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
94 (in[i*4+1]<<8) | (in[i*4+0]<<0);
97 static void copy4(unsigned char *out,uint32 x)
100 out[1] = (x>>8)&0xFF;
101 out[2] = (x>>16)&0xFF;
102 out[3] = (x>>24)&0xFF;
105 void mdfour_begin(struct mdfour *md)
116 static void mdfour_tail(unsigned char *in, uint32 n)
118 unsigned char buf[128];
120 extern int remote_version;
123 * Count total number of bits, modulo 2^64
126 if (m->totalN < (n << 3)) {
129 m->totalN2 += n >> 29;
132 if (n) memcpy(buf, in, n);
136 copy4(buf+56, m->totalN);
138 * Prior to protocol version 27 only the number of bits
139 * modulo 2^32 was included. MD4 requires the number
140 * of bits modulo 2^64, which was fixed starting with
141 * protocol version 27.
143 if (remote_version >= 27) {
144 copy4(buf+60, m->totalN2);
149 copy4(buf+120, m->totalN);
151 * Prior to protocol version 27 only the number of bits
152 * modulo 2^32 was included. MD4 requires the number
153 * of bits modulo 2^64, which was fixed starting with
154 * protocol version 27.
156 if (remote_version >= 27) {
157 copy4(buf+124, m->totalN2);
166 void mdfour_update(struct mdfour *md, unsigned char *in, uint32 n)
172 if (n == 0) mdfour_tail(in, n);
179 m->totalN += 64 << 3;
180 if (m->totalN < 64 << 3) {
185 if (n) mdfour_tail(in, n);
189 void mdfour_result(struct mdfour *md, unsigned char *out)
200 void mdfour(unsigned char *out, unsigned char *in, int n)
204 mdfour_update(&md, in, n);
205 mdfour_result(&md, out);
209 static void file_checksum1(char *fname)
213 unsigned char buf[64*1024], sum[16];
215 fd = open(fname,O_RDONLY);
224 int n = read(fd, buf, sizeof(buf));
226 mdfour_update(&md, buf, n);
231 mdfour_result(&md, sum);
234 printf("%02X", sum[i]);
241 static void file_checksum2(char *fname)
245 unsigned char buf[64], sum[16];
247 fd = open(fname,O_RDONLY);
256 int n = read(fd, buf, sizeof(buf));
258 MDupdate(&md, buf, n*8);
262 MDupdate(&md, buf, 0);
267 memcpy(sum, md.buffer, 16);
270 printf("%02X", sum[i]);
275 int main(int argc, char *argv[])
277 file_checksum1(argv[1]);
279 file_checksum2(argv[1]);