Mercurial > mm7
comparison lib/swig/swigwin-2.0.11/CCache/mdfour.c @ 1899:b3009adc0e2f
Adding swig, gitignore, hgignore
author | Nomad |
---|---|
date | Mon, 21 Oct 2013 10:42:27 +0200 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
1867:eb580660bbbb | 1899:b3009adc0e2f |
---|---|
1 /* | |
2 a implementation of MD4 designed for use in the SMB authentication protocol | |
3 Copyright (C) Andrew Tridgell 1997-1998. | |
4 | |
5 This program is free software; you can redistribute it and/or modify | |
6 it under the terms of the GNU General Public License as published by | |
7 the Free Software Foundation; either version 2 of the License, or | |
8 (at your option) any later version. | |
9 | |
10 This program is distributed in the hope that it will be useful, | |
11 but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 GNU General Public License for more details. | |
14 | |
15 You should have received a copy of the GNU General Public License | |
16 along with this program; if not, write to the Free Software | |
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
18 */ | |
19 | |
20 #include "ccache.h" | |
21 | |
22 /* NOTE: This code makes no attempt to be fast! | |
23 | |
24 It assumes that a int is at least 32 bits long | |
25 */ | |
26 | |
27 static struct mdfour *m; | |
28 | |
29 #define MASK32 (0xffffffff) | |
30 | |
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))) | |
34 #define lshift(x,s) (((((x)<<(s))&MASK32) | (((x)>>(32-(s)))&MASK32))) | |
35 | |
36 #define ROUND1(a,b,c,d,k,s) a = lshift((a + F(b,c,d) + M[k])&MASK32, s) | |
37 #define ROUND2(a,b,c,d,k,s) a = lshift((a + G(b,c,d) + M[k] + 0x5A827999)&MASK32,s) | |
38 #define ROUND3(a,b,c,d,k,s) a = lshift((a + H(b,c,d) + M[k] + 0x6ED9EBA1)&MASK32,s) | |
39 | |
40 /* this applies md4 to 64 byte chunks */ | |
41 static void mdfour64(uint32 *M) | |
42 { | |
43 uint32 AA, BB, CC, DD; | |
44 uint32 A,B,C,D; | |
45 | |
46 A = m->A; B = m->B; C = m->C; D = m->D; | |
47 AA = A; BB = B; CC = C; DD = D; | |
48 | |
49 ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7); | |
50 ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19); | |
51 ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7); | |
52 ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19); | |
53 ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7); | |
54 ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19); | |
55 ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7); | |
56 ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19); | |
57 | |
58 | |
59 ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5); | |
60 ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13); | |
61 ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5); | |
62 ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13); | |
63 ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5); | |
64 ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13); | |
65 ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5); | |
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); | |
70 ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9); | |
71 ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15); | |
72 ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9); | |
73 ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15); | |
74 ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9); | |
75 ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15); | |
76 | |
77 A += AA; B += BB; | |
78 C += CC; D += DD; | |
79 | |
80 A &= MASK32; B &= MASK32; | |
81 C &= MASK32; D &= MASK32; | |
82 | |
83 m->A = A; m->B = B; m->C = C; m->D = D; | |
84 } | |
85 | |
86 static void copy64(uint32 *M, const unsigned char *in) | |
87 { | |
88 int i; | |
89 | |
90 for (i=0;i<16;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 } | |
94 | |
95 static void copy4(unsigned char *out,uint32 x) | |
96 { | |
97 out[0] = x&0xFF; | |
98 out[1] = (x>>8)&0xFF; | |
99 out[2] = (x>>16)&0xFF; | |
100 out[3] = (x>>24)&0xFF; | |
101 } | |
102 | |
103 void mdfour_begin(struct mdfour *md) | |
104 { | |
105 md->A = 0x67452301; | |
106 md->B = 0xefcdab89; | |
107 md->C = 0x98badcfe; | |
108 md->D = 0x10325476; | |
109 md->totalN = 0; | |
110 md->tail_len = 0; | |
111 } | |
112 | |
113 | |
114 static void mdfour_tail(const unsigned char *in, int n) | |
115 { | |
116 unsigned char buf[128]; | |
117 uint32 M[16]; | |
118 uint32 b; | |
119 | |
120 m->totalN += n; | |
121 | |
122 b = m->totalN * 8; | |
123 | |
124 memset(buf, 0, 128); | |
125 if (n) memcpy(buf, in, n); | |
126 buf[n] = 0x80; | |
127 | |
128 if (n <= 55) { | |
129 copy4(buf+56, b); | |
130 copy64(M, buf); | |
131 mdfour64(M); | |
132 } else { | |
133 copy4(buf+120, b); | |
134 copy64(M, buf); | |
135 mdfour64(M); | |
136 copy64(M, buf+64); | |
137 mdfour64(M); | |
138 } | |
139 } | |
140 | |
141 void mdfour_update(struct mdfour *md, const unsigned char *in, int n) | |
142 { | |
143 uint32 M[16]; | |
144 | |
145 m = md; | |
146 | |
147 if (in == NULL) { | |
148 mdfour_tail(md->tail, md->tail_len); | |
149 return; | |
150 } | |
151 | |
152 if (md->tail_len) { | |
153 int len = 64 - md->tail_len; | |
154 if (len > n) len = n; | |
155 memcpy(md->tail+md->tail_len, in, len); | |
156 md->tail_len += len; | |
157 n -= len; | |
158 in += len; | |
159 if (md->tail_len == 64) { | |
160 copy64(M, md->tail); | |
161 mdfour64(M); | |
162 m->totalN += 64; | |
163 md->tail_len = 0; | |
164 } | |
165 } | |
166 | |
167 while (n >= 64) { | |
168 copy64(M, in); | |
169 mdfour64(M); | |
170 in += 64; | |
171 n -= 64; | |
172 m->totalN += 64; | |
173 } | |
174 | |
175 if (n) { | |
176 memcpy(md->tail, in, n); | |
177 md->tail_len = n; | |
178 } | |
179 } | |
180 | |
181 | |
182 void mdfour_result(struct mdfour *md, unsigned char *out) | |
183 { | |
184 m = md; | |
185 | |
186 copy4(out, m->A); | |
187 copy4(out+4, m->B); | |
188 copy4(out+8, m->C); | |
189 copy4(out+12, m->D); | |
190 } | |
191 | |
192 | |
193 void mdfour(unsigned char *out, const unsigned char *in, int n) | |
194 { | |
195 struct mdfour md; | |
196 mdfour_begin(&md); | |
197 mdfour_update(&md, in, n); | |
198 mdfour_update(&md, NULL, 0); | |
199 mdfour_result(&md, out); | |
200 } | |
201 | |
202 #ifdef TEST_MDFOUR | |
203 static void file_checksum1(char *fname) | |
204 { | |
205 int fd, i; | |
206 struct mdfour md; | |
207 unsigned char buf[1024], sum[16]; | |
208 unsigned chunk; | |
209 | |
210 fd = open(fname,O_RDONLY|O_BINARY); | |
211 if (fd == -1) { | |
212 perror("fname"); | |
213 exit(1); | |
214 } | |
215 | |
216 chunk = 1 + random() % (sizeof(buf) - 1); | |
217 | |
218 mdfour_begin(&md); | |
219 | |
220 while (1) { | |
221 int n = read(fd, buf, chunk); | |
222 if (n >= 0) { | |
223 mdfour_update(&md, buf, n); | |
224 } | |
225 if (n < chunk) break; | |
226 } | |
227 | |
228 close(fd); | |
229 | |
230 mdfour_update(&md, NULL, 0); | |
231 | |
232 mdfour_result(&md, sum); | |
233 | |
234 for (i=0;i<16;i++) | |
235 printf("%02x", sum[i]); | |
236 printf("\n"); | |
237 } | |
238 | |
239 #if 0 | |
240 #include "../md4.h" | |
241 | |
242 static void file_checksum2(char *fname) | |
243 { | |
244 int fd, i; | |
245 MDstruct md; | |
246 unsigned char buf[64], sum[16]; | |
247 | |
248 fd = open(fname,O_RDONLY|O_BINARY); | |
249 if (fd == -1) { | |
250 perror("fname"); | |
251 exit(1); | |
252 } | |
253 | |
254 MDbegin(&md); | |
255 | |
256 while (1) { | |
257 int n = read(fd, buf, sizeof(buf)); | |
258 if (n <= 0) break; | |
259 MDupdate(&md, buf, n*8); | |
260 } | |
261 | |
262 if (!md.done) { | |
263 MDupdate(&md, buf, 0); | |
264 } | |
265 | |
266 close(fd); | |
267 | |
268 memcpy(sum, md.buffer, 16); | |
269 | |
270 for (i=0;i<16;i++) | |
271 printf("%02x", sum[i]); | |
272 printf("\n"); | |
273 } | |
274 #endif | |
275 | |
276 int main(int argc, char *argv[]) | |
277 { | |
278 file_checksum1(argv[1]); | |
279 #if 0 | |
280 file_checksum2(argv[1]); | |
281 #endif | |
282 return 0; | |
283 } | |
284 #endif |