Commit | Line | Data |
---|---|---|
8de330a3 AT |
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 | ||
2fb27e91 AT |
31 | #define F(X,Y,Z) (((X)&(Y)) | ((~(X))&(Z))) |
32 | #define G(X,Y,Z) (((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z))) | |
33 | #define H(X,Y,Z) ((X)^(Y)^(Z)) | |
f3737e06 | 34 | #ifdef LARGE_INT32 |
2fb27e91 | 35 | #define lshift(x,s) ((((x)<<(s))&0xFFFFFFFF) | (((x)>>(32-(s)))&0xFFFFFFFF)) |
f3737e06 | 36 | #else |
2fb27e91 | 37 | #define lshift(x,s) (((x)<<(s)) | ((x)>>(32-(s)))) |
f3737e06 | 38 | #endif |
8de330a3 | 39 | |
03e2d0e3 AT |
40 | #define ROUND1(a,b,c,d,k,s) a = lshift((uint32)(a + F(b,c,d) + X[k]), s) |
41 | #define ROUND2(a,b,c,d,k,s) a = lshift((uint32)(a + G(b,c,d) + X[k] + 0x5A827999),s) | |
42 | #define ROUND3(a,b,c,d,k,s) a = lshift((uint32)(a + H(b,c,d) + X[k] + 0x6ED9EBA1),s) | |
8de330a3 AT |
43 | |
44 | /* this applies md4 to 64 byte chunks */ | |
45 | static void mdfour64(uint32 *M) | |
46 | { | |
47 | int j; | |
48 | uint32 AA, BB, CC, DD; | |
49 | uint32 X[16]; | |
50 | uint32 A,B,C,D; | |
51 | ||
52 | for (j=0;j<16;j++) | |
53 | X[j] = M[j]; | |
54 | ||
55 | A = m->A; B = m->B; C = m->C; D = m->D; | |
56 | AA = A; BB = B; CC = C; DD = D; | |
57 | ||
58 | ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7); | |
59 | ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19); | |
60 | ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7); | |
61 | ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19); | |
62 | ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7); | |
63 | ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19); | |
64 | ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7); | |
65 | ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19); | |
66 | ||
67 | ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5); | |
68 | ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13); | |
69 | ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5); | |
70 | ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13); | |
71 | ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5); | |
72 | ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13); | |
73 | ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5); | |
74 | ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13); | |
75 | ||
76 | ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9); | |
77 | ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15); | |
78 | ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9); | |
79 | ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15); | |
80 | ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9); | |
81 | ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15); | |
82 | ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9); | |
83 | ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15); | |
84 | ||
85 | A += AA; B += BB; C += CC; D += DD; | |
86 | ||
f3737e06 | 87 | #ifdef LARGE_INT32 |
8de330a3 AT |
88 | A &= 0xFFFFFFFF; B &= 0xFFFFFFFF; |
89 | C &= 0xFFFFFFFF; D &= 0xFFFFFFFF; | |
f3737e06 | 90 | #endif |
8de330a3 AT |
91 | |
92 | for (j=0;j<16;j++) | |
93 | X[j] = 0; | |
94 | ||
95 | m->A = A; m->B = B; m->C = C; m->D = D; | |
96 | } | |
97 | ||
98 | static void copy64(uint32 *M, unsigned char *in) | |
99 | { | |
100 | int i; | |
101 | ||
102 | for (i=0;i<16;i++) | |
103 | M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) | | |
104 | (in[i*4+1]<<8) | (in[i*4+0]<<0); | |
105 | } | |
106 | ||
107 | static void copy4(unsigned char *out,uint32 x) | |
108 | { | |
109 | out[0] = x&0xFF; | |
110 | out[1] = (x>>8)&0xFF; | |
111 | out[2] = (x>>16)&0xFF; | |
112 | out[3] = (x>>24)&0xFF; | |
113 | } | |
114 | ||
115 | void mdfour_begin(struct mdfour *md) | |
116 | { | |
117 | md->A = 0x67452301; | |
118 | md->B = 0xefcdab89; | |
119 | md->C = 0x98badcfe; | |
120 | md->D = 0x10325476; | |
121 | md->totalN = 0; | |
122 | } | |
123 | ||
124 | ||
125 | static void mdfour_tail(unsigned char *in, int n) | |
126 | { | |
127 | unsigned char buf[128]; | |
128 | uint32 M[16]; | |
129 | uint32 b; | |
130 | ||
131 | m->totalN += n; | |
132 | ||
133 | b = m->totalN * 8; | |
134 | ||
135 | memset(buf, 0, 128); | |
136 | if (n) memcpy(buf, in, n); | |
137 | buf[n] = 0x80; | |
138 | ||
139 | if (n <= 55) { | |
140 | copy4(buf+56, b); | |
141 | copy64(M, buf); | |
142 | mdfour64(M); | |
143 | } else { | |
144 | copy4(buf+120, b); | |
145 | copy64(M, buf); | |
146 | mdfour64(M); | |
147 | copy64(M, buf+64); | |
148 | mdfour64(M); | |
149 | } | |
8de330a3 AT |
150 | } |
151 | ||
152 | void mdfour_update(struct mdfour *md, unsigned char *in, int n) | |
153 | { | |
154 | uint32 M[16]; | |
155 | ||
156 | if (n == 0) mdfour_tail(in, n); | |
157 | ||
158 | m = md; | |
159 | ||
160 | while (n >= 64) { | |
161 | copy64(M, in); | |
162 | mdfour64(M); | |
163 | in += 64; | |
164 | n -= 64; | |
165 | m->totalN += 64; | |
166 | } | |
167 | ||
168 | if (n) mdfour_tail(in, n); | |
169 | } | |
170 | ||
171 | ||
172 | void mdfour_result(struct mdfour *md, unsigned char *out) | |
173 | { | |
174 | m = md; | |
175 | ||
176 | copy4(out, m->A); | |
177 | copy4(out+4, m->B); | |
178 | copy4(out+8, m->C); | |
179 | copy4(out+12, m->D); | |
180 | } | |
181 | ||
182 | ||
183 | void mdfour(unsigned char *out, unsigned char *in, int n) | |
184 | { | |
185 | struct mdfour md; | |
186 | mdfour_begin(&md); | |
187 | mdfour_update(&md, in, n); | |
188 | mdfour_result(&md, out); | |
189 | } | |
190 | ||
191 | #ifdef TEST_MDFOUR | |
192 | static void file_checksum1(char *fname) | |
193 | { | |
194 | int fd, i; | |
195 | struct mdfour md; | |
2fb27e91 AT |
196 | unsigned char buf[64*1024], sum[16]; |
197 | ||
8de330a3 AT |
198 | fd = open(fname,O_RDONLY); |
199 | if (fd == -1) { | |
200 | perror("fname"); | |
201 | exit(1); | |
202 | } | |
203 | ||
204 | mdfour_begin(&md); | |
205 | ||
206 | while (1) { | |
207 | int n = read(fd, buf, sizeof(buf)); | |
208 | if (n <= 0) break; | |
209 | mdfour_update(&md, buf, n); | |
210 | } | |
211 | ||
212 | close(fd); | |
213 | ||
214 | mdfour_result(&md, sum); | |
215 | ||
216 | for (i=0;i<16;i++) | |
217 | printf("%02X", sum[i]); | |
218 | printf("\n"); | |
219 | } | |
220 | ||
2fb27e91 | 221 | #if 0 |
8de330a3 AT |
222 | #include "../md4.h" |
223 | ||
224 | static void file_checksum2(char *fname) | |
225 | { | |
226 | int fd, i; | |
227 | MDstruct md; | |
228 | unsigned char buf[64], sum[16]; | |
229 | ||
230 | fd = open(fname,O_RDONLY); | |
231 | if (fd == -1) { | |
232 | perror("fname"); | |
233 | exit(1); | |
234 | } | |
235 | ||
236 | MDbegin(&md); | |
237 | ||
238 | while (1) { | |
239 | int n = read(fd, buf, sizeof(buf)); | |
240 | if (n <= 0) break; | |
241 | MDupdate(&md, buf, n*8); | |
242 | } | |
243 | ||
244 | if (!md.done) { | |
245 | MDupdate(&md, buf, 0); | |
246 | } | |
247 | ||
248 | close(fd); | |
249 | ||
250 | memcpy(sum, md.buffer, 16); | |
251 | ||
252 | for (i=0;i<16;i++) | |
253 | printf("%02X", sum[i]); | |
254 | printf("\n"); | |
255 | } | |
2fb27e91 | 256 | #endif |
8de330a3 AT |
257 | |
258 | int main(int argc, char *argv[]) | |
259 | { | |
260 | file_checksum1(argv[1]); | |
2fb27e91 | 261 | #if 0 |
8de330a3 | 262 | file_checksum2(argv[1]); |
2fb27e91 | 263 | #endif |
8de330a3 AT |
264 | return 0; |
265 | } | |
266 | #endif |