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