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