2 * Unix SMB/Netbios implementation.
4 * An implementation of MD4 designed for use in the SMB authentication protocol.
6 * Copyright (C) 1997-1998 Andrew Tridgell
7 * Copyright (C) 2005-2007 Wayne Davison
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write to the Free Software Foundation, Inc.,
21 * 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA.
26 /* NOTE: This code makes no attempt to be fast!
28 * It assumes that a int is at least 32 bits long. */
32 #define MASK32 (0xffffffff)
34 #define F(X,Y,Z) ((((X)&(Y)) | ((~(X))&(Z))))
35 #define G(X,Y,Z) ((((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z))))
36 #define H(X,Y,Z) (((X)^(Y)^(Z)))
37 #define lshift(x,s) (((((x)<<(s))&MASK32) | (((x)>>(32-(s)))&MASK32)))
39 #define ROUND1(a,b,c,d,k,s) a = lshift((a + F(b,c,d) + M[k])&MASK32, s)
40 #define ROUND2(a,b,c,d,k,s) a = lshift((a + G(b,c,d) + M[k] + 0x5A827999)&MASK32,s)
41 #define ROUND3(a,b,c,d,k,s) a = lshift((a + H(b,c,d) + M[k] + 0x6ED9EBA1)&MASK32,s)
43 /* this applies md4 to 64 byte chunks */
44 static void mdfour64(uint32 *M)
46 uint32 AA, BB, CC, DD;
49 A = m->A; B = m->B; C = m->C; D = m->D;
50 AA = A; BB = B; CC = C; DD = D;
52 ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7);
53 ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19);
54 ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7);
55 ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19);
56 ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7);
57 ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19);
58 ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7);
59 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, const uchar *in)
92 for (i = 0; i < MD4_DIGEST_LEN; 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);
98 static void copy4(uchar *out,uint32 x)
101 out[1] = (x>>8)&0xFF;
102 out[2] = (x>>16)&0xFF;
103 out[3] = (x>>24)&0xFF;
106 void mdfour_begin(md_context *md)
116 static void mdfour_tail(const uchar *in, uint32 length)
120 extern int protocol_version;
123 * Count total number of bits, modulo 2^64
125 m->totalN += length << 3;
126 if (m->totalN < (length << 3))
128 m->totalN2 += length >> 29;
132 memcpy(buf, in, length);
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 (protocol_version >= 27)
144 copy4(buf+60, m->totalN2);
148 copy4(buf+120, m->totalN);
150 * Prior to protocol version 27 only the number of bits
151 * modulo 2^32 was included. MD4 requires the number
152 * of bits modulo 2^64, which was fixed starting with
153 * protocol version 27.
155 if (protocol_version >= 27)
156 copy4(buf+124, m->totalN2);
164 void mdfour_update(md_context *md, const uchar *in, uint32 length)
171 mdfour_tail(in, length);
173 while (length >= 64) {
178 m->totalN += 64 << 3;
179 if (m->totalN < 64 << 3)
184 mdfour_tail(in, length);
187 void mdfour_result(md_context *md, uchar digest[MD4_DIGEST_LEN])
192 copy4(digest+4, m->B);
193 copy4(digest+8, m->C);
194 copy4(digest+12, m->D);
197 void mdfour(uchar digest[MD4_DIGEST_LEN], uchar *in, int length)
201 mdfour_update(&md, in, length);
202 mdfour_result(&md, digest);
206 int protocol_version = 28;
208 static void file_checksum1(char *fname)
210 int fd, i, was_multiple_of_64 = 1;
212 uchar buf[64*1024], sum[MD4_DIGEST_LEN];
214 fd = open(fname,O_RDONLY);
223 int n = read(fd, buf, sizeof buf);
226 was_multiple_of_64 = !(n % 64);
227 mdfour_update(&md, buf, n);
229 if (was_multiple_of_64 && protocol_version >= 27)
230 mdfour_update(&md, buf, 0);
234 mdfour_result(&md, sum);
236 for (i = 0; i < MD4_DIGEST_LEN; i++)
237 printf("%02X", sum[i]);
241 int main(int argc, char *argv[])
244 file_checksum1(*++argv);