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