aboutsummaryrefslogtreecommitdiff
path: root/libbb/pw_encrypt_md5.c
diff options
context:
space:
mode:
authorDenis Vlasenko <vda.linux@googlemail.com>2008-06-12 16:55:59 +0000
committerDenis Vlasenko <vda.linux@googlemail.com>2008-06-12 16:55:59 +0000
commit4ea83bf562c44a6792e7c77e7d87cba91f86f763 (patch)
tree64dba9163b29724e282c1e94027001a11978e74b /libbb/pw_encrypt_md5.c
parent9de462205542547694299e9fe2bc321088ab79aa (diff)
downloadbusybox-w32-4ea83bf562c44a6792e7c77e7d87cba91f86f763.tar.gz
busybox-w32-4ea83bf562c44a6792e7c77e7d87cba91f86f763.tar.bz2
busybox-w32-4ea83bf562c44a6792e7c77e7d87cba91f86f763.zip
uclibc insists on having 70k static buffer for crypt.
For bbox it's not acceptable. Roll our own des and md5 crypt implementation. Against older uclibc: text data bss dec hex filename 759945 604 6684 767233 bb501 busybox_old 759766 604 6684 767054 bb44e busybox_unstripped so, we still save on code size.
Diffstat (limited to 'libbb/pw_encrypt_md5.c')
-rw-r--r--libbb/pw_encrypt_md5.c656
1 files changed, 656 insertions, 0 deletions
diff --git a/libbb/pw_encrypt_md5.c b/libbb/pw_encrypt_md5.c
new file mode 100644
index 000000000..42eb13440
--- /dev/null
+++ b/libbb/pw_encrypt_md5.c
@@ -0,0 +1,656 @@
1/*
2 * MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
3 *
4 * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
5 * rights reserved.
6 *
7 * License to copy and use this software is granted provided that it
8 * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
9 * Algorithm" in all material mentioning or referencing this software
10 * or this function.
11 *
12 * License is also granted to make and use derivative works provided
13 * that such works are identified as "derived from the RSA Data
14 * Security, Inc. MD5 Message-Digest Algorithm" in all material
15 * mentioning or referencing the derived work.
16 *
17 * RSA Data Security, Inc. makes no representations concerning either
18 * the merchantability of this software or the suitability of this
19 * software for any particular purpose. It is provided "as is"
20 * without express or implied warranty of any kind.
21 *
22 * These notices must be retained in any copies of any part of this
23 * documentation and/or software.
24 *
25 * $FreeBSD: src/lib/libmd/md5c.c,v 1.9.2.1 1999/08/29 14:57:12 peter Exp $
26 *
27 * This code is the same as the code published by RSA Inc. It has been
28 * edited for clarity and style only.
29 *
30 * ----------------------------------------------------------------------------
31 * The md5_crypt() function was taken from freeBSD's libcrypt and contains
32 * this license:
33 * "THE BEER-WARE LICENSE" (Revision 42):
34 * <phk@login.dknet.dk> wrote this file. As long as you retain this notice you
35 * can do whatever you want with this stuff. If we meet some day, and you think
36 * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp
37 *
38 * $FreeBSD: src/lib/libcrypt/crypt.c,v 1.7.2.1 1999/08/29 14:56:33 peter Exp $
39 *
40 * ----------------------------------------------------------------------------
41 * On April 19th, 2001 md5_crypt() was modified to make it reentrant
42 * by Erik Andersen <andersen@uclibc.org>
43 *
44 *
45 * June 28, 2001 Manuel Novoa III
46 *
47 * "Un-inlined" code using loops and static const tables in order to
48 * reduce generated code size (on i386 from approx 4k to approx 2.5k).
49 *
50 * June 29, 2001 Manuel Novoa III
51 *
52 * Completely removed static PADDING array.
53 *
54 * Reintroduced the loop unrolling in MD5_Transform and added the
55 * MD5_SIZE_OVER_SPEED option for configurability. Define below as:
56 * 0 fully unrolled loops
57 * 1 partially unrolled (4 ops per loop)
58 * 2 no unrolling -- introduces the need to swap 4 variables (slow)
59 * 3 no unrolling and all 4 loops merged into one with switch
60 * in each loop (glacial)
61 * On i386, sizes are roughly (-Os -fno-builtin):
62 * 0: 3k 1: 2.5k 2: 2.2k 3: 2k
63 *
64 *
65 * Since SuSv3 does not require crypt_r, modified again August 7, 2002
66 * by Erik Andersen to remove reentrance stuff...
67 */
68
69/*
70 * Valid values are 1 (fastest/largest) to 3 (smallest/slowest).
71 */
72#define MD5_SIZE_OVER_SPEED 3
73
74/**********************************************************************/
75
76/* MD5 context. */
77struct MD5Context {
78 uint32_t state[4]; /* state (ABCD) */
79 uint32_t count[2]; /* number of bits, modulo 2^64 (lsb first) */
80 unsigned char buffer[64]; /* input buffer */
81};
82
83static void __md5_Init(struct MD5Context *);
84static void __md5_Update(struct MD5Context *, const unsigned char *, unsigned int);
85static void __md5_Pad(struct MD5Context *);
86static void __md5_Final(unsigned char [16], struct MD5Context *);
87static void __md5_Transform(uint32_t [4], const unsigned char [64]);
88
89
90#define MD5_MAGIC_STR "$1$"
91#define MD5_MAGIC_LEN (sizeof(MD5_MAGIC_STR) - 1)
92static const unsigned char __md5__magic[] = MD5_MAGIC_STR;
93
94
95#ifdef i386
96#define __md5_Encode memcpy
97#define __md5_Decode memcpy
98#else /* i386 */
99
100/*
101 * __md5_Encodes input (uint32_t) into output (unsigned char). Assumes len is
102 * a multiple of 4.
103 */
104
105static void
106__md5_Encode(unsigned char *output, uint32_t *input, unsigned int len)
107{
108 unsigned int i, j;
109
110 for (i = 0, j = 0; j < len; i++, j += 4) {
111 output[j] = input[i];
112 output[j+1] = (input[i] >> 8);
113 output[j+2] = (input[i] >> 16);
114 output[j+3] = (input[i] >> 24);
115 }
116}
117
118/*
119 * __md5_Decodes input (unsigned char) into output (uint32_t). Assumes len is
120 * a multiple of 4.
121 */
122
123static void
124__md5_Decode(uint32_t *output, const unsigned char *input, unsigned int len)
125{
126 unsigned int i, j;
127
128 for (i = 0, j = 0; j < len; i++, j += 4)
129 output[i] = ((uint32_t)input[j]) | (((uint32_t)input[j+1]) << 8) |
130 (((uint32_t)input[j+2]) << 16) | (((uint32_t)input[j+3]) << 24);
131}
132#endif /* i386 */
133
134/* F, G, H and I are basic MD5 functions. */
135#define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
136#define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
137#define H(x, y, z) ((x) ^ (y) ^ (z))
138#define I(x, y, z) ((y) ^ ((x) | ~(z)))
139
140/* ROTATE_LEFT rotates x left n bits. */
141#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
142
143/*
144 * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
145 * Rotation is separate from addition to prevent recomputation.
146 */
147#define FF(a, b, c, d, x, s, ac) { \
148 (a) += F ((b), (c), (d)) + (x) + (uint32_t)(ac); \
149 (a) = ROTATE_LEFT((a), (s)); \
150 (a) += (b); \
151 }
152#define GG(a, b, c, d, x, s, ac) { \
153 (a) += G ((b), (c), (d)) + (x) + (uint32_t)(ac); \
154 (a) = ROTATE_LEFT((a), (s)); \
155 (a) += (b); \
156 }
157#define HH(a, b, c, d, x, s, ac) { \
158 (a) += H ((b), (c), (d)) + (x) + (uint32_t)(ac); \
159 (a) = ROTATE_LEFT((a), (s)); \
160 (a) += (b); \
161 }
162#define II(a, b, c, d, x, s, ac) { \
163 (a) += I ((b), (c), (d)) + (x) + (uint32_t)(ac); \
164 (a) = ROTATE_LEFT((a), (s)); \
165 (a) += (b); \
166 }
167
168/* MD5 initialization. Begins an MD5 operation, writing a new context. */
169
170static void __md5_Init(struct MD5Context *context)
171{
172 context->count[0] = context->count[1] = 0;
173
174 /* Load magic initialization constants. */
175 context->state[0] = 0x67452301;
176 context->state[1] = 0xefcdab89;
177 context->state[2] = 0x98badcfe;
178 context->state[3] = 0x10325476;
179}
180
181/*
182 * MD5 block update operation. Continues an MD5 message-digest
183 * operation, processing another message block, and updating the
184 * context.
185 */
186
187static void __md5_Update(struct MD5Context *context, const unsigned char *input, unsigned int inputLen)
188{
189 unsigned int i, idx, partLen;
190
191 /* Compute number of bytes mod 64 */
192 idx = (context->count[0] >> 3) & 0x3F;
193
194 /* Update number of bits */
195 context->count[0] += (inputLen << 3);
196 if (context->count[0] < (inputLen << 3))
197 context->count[1]++;
198 context->count[1] += (inputLen >> 29);
199
200 partLen = 64 - idx;
201
202 /* Transform as many times as possible. */
203 if (inputLen >= partLen) {
204 memcpy(&context->buffer[idx], input, partLen);
205 __md5_Transform(context->state, context->buffer);
206
207 for (i = partLen; i + 63 < inputLen; i += 64)
208 __md5_Transform(context->state, &input[i]);
209
210 idx = 0;
211 } else
212 i = 0;
213
214 /* Buffer remaining input */
215 memcpy(&context->buffer[idx], &input[i], inputLen - i);
216}
217
218/*
219 * MD5 padding. Adds padding followed by original length.
220 */
221
222static void __md5_Pad(struct MD5Context *context)
223{
224 unsigned char bits[8];
225 unsigned int idx, padLen;
226 unsigned char PADDING[64];
227
228 memset(PADDING, 0, sizeof(PADDING));
229 PADDING[0] = 0x80;
230
231 /* Save number of bits */
232 __md5_Encode(bits, context->count, 8);
233
234 /* Pad out to 56 mod 64. */
235 idx = (context->count[0] >> 3) & 0x3f;
236 padLen = (idx < 56) ? (56 - idx) : (120 - idx);
237 __md5_Update(context, PADDING, padLen);
238
239 /* Append length (before padding) */
240 __md5_Update(context, bits, 8);
241}
242
243/*
244 * MD5 finalization. Ends an MD5 message-digest operation, writing the
245 * the message digest and zeroizing the context.
246 */
247
248static void __md5_Final(unsigned char digest[16], struct MD5Context *context)
249{
250 /* Do padding. */
251 __md5_Pad(context);
252
253 /* Store state in digest */
254 __md5_Encode(digest, context->state, 16);
255
256 /* Zeroize sensitive information. */
257 memset(context, 0, sizeof(*context));
258}
259
260/* MD5 basic transformation. Transforms state based on block. */
261
262static void __md5_Transform(uint32_t state[4], const unsigned char block[64])
263{
264 uint32_t a, b, c, d, x[16];
265#if MD5_SIZE_OVER_SPEED > 1
266 uint32_t temp;
267 const unsigned char *ps;
268
269 static const unsigned char S[] = {
270 7, 12, 17, 22,
271 5, 9, 14, 20,
272 4, 11, 16, 23,
273 6, 10, 15, 21
274 };
275#endif /* MD5_SIZE_OVER_SPEED > 1 */
276
277#if MD5_SIZE_OVER_SPEED > 0
278 const uint32_t *pc;
279 const unsigned char *pp;
280 int i;
281
282 static const uint32_t C[] = {
283 /* round 1 */
284 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
285 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
286 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
287 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
288 /* round 2 */
289 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
290 0xd62f105d, 0x2441453, 0xd8a1e681, 0xe7d3fbc8,
291 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
292 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
293 /* round 3 */
294 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
295 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
296 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
297 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
298 /* round 4 */
299 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
300 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
301 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
302 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
303 };
304
305 static const unsigned char P[] = {
306 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, /* 1 */
307 1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12, /* 2 */
308 5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2, /* 3 */
309 0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9 /* 4 */
310 };
311
312#endif /* MD5_SIZE_OVER_SPEED > 0 */
313
314 __md5_Decode(x, block, 64);
315
316 a = state[0]; b = state[1]; c = state[2]; d = state[3];
317
318#if MD5_SIZE_OVER_SPEED > 2
319 pc = C; pp = P; ps = S - 4;
320
321 for (i = 0; i < 64; i++) {
322 if ((i & 0x0f) == 0) ps += 4;
323 temp = a;
324 switch (i>>4) {
325 case 0:
326 temp += F(b, c, d);
327 break;
328 case 1:
329 temp += G(b, c, d);
330 break;
331 case 2:
332 temp += H(b, c, d);
333 break;
334 case 3:
335 temp += I(b, c, d);
336 break;
337 }
338 temp += x[*pp++] + *pc++;
339 temp = ROTATE_LEFT(temp, ps[i & 3]);
340 temp += b;
341 a = d; d = c; c = b; b = temp;
342 }
343#elif MD5_SIZE_OVER_SPEED > 1
344 pc = C; pp = P; ps = S;
345
346 /* Round 1 */
347 for (i = 0; i < 16; i++) {
348 FF(a, b, c, d, x[*pp], ps[i & 0x3], *pc); pp++; pc++;
349 temp = d; d = c; c = b; b = a; a = temp;
350 }
351
352 /* Round 2 */
353 ps += 4;
354 for (; i < 32; i++) {
355 GG(a, b, c, d, x[*pp], ps[i & 0x3], *pc); pp++; pc++;
356 temp = d; d = c; c = b; b = a; a = temp;
357 }
358 /* Round 3 */
359 ps += 4;
360 for (; i < 48; i++) {
361 HH(a, b, c, d, x[*pp], ps[i & 0x3], *pc); pp++; pc++;
362 temp = d; d = c; c = b; b = a; a = temp;
363 }
364
365 /* Round 4 */
366 ps += 4;
367 for (; i < 64; i++) {
368 II(a, b, c, d, x[*pp], ps[i & 0x3], *pc); pp++; pc++;
369 temp = d; d = c; c = b; b = a; a = temp;
370 }
371#elif MD5_SIZE_OVER_SPEED > 0
372 pc = C; pp = P;
373
374 /* Round 1 */
375 for (i = 0; i < 4; i++) {
376 FF(a, b, c, d, x[*pp], 7, *pc); pp++; pc++;
377 FF(d, a, b, c, x[*pp], 12, *pc); pp++; pc++;
378 FF(c, d, a, b, x[*pp], 17, *pc); pp++; pc++;
379 FF(b, c, d, a, x[*pp], 22, *pc); pp++; pc++;
380 }
381
382 /* Round 2 */
383 for (i = 0; i < 4; i++) {
384 GG(a, b, c, d, x[*pp], 5, *pc); pp++; pc++;
385 GG(d, a, b, c, x[*pp], 9, *pc); pp++; pc++;
386 GG(c, d, a, b, x[*pp], 14, *pc); pp++; pc++;
387 GG(b, c, d, a, x[*pp], 20, *pc); pp++; pc++;
388 }
389 /* Round 3 */
390 for (i = 0; i < 4; i++) {
391 HH(a, b, c, d, x[*pp], 4, *pc); pp++; pc++;
392 HH(d, a, b, c, x[*pp], 11, *pc); pp++; pc++;
393 HH(c, d, a, b, x[*pp], 16, *pc); pp++; pc++;
394 HH(b, c, d, a, x[*pp], 23, *pc); pp++; pc++;
395 }
396
397 /* Round 4 */
398 for (i = 0; i < 4; i++) {
399 II(a, b, c, d, x[*pp], 6, *pc); pp++; pc++;
400 II(d, a, b, c, x[*pp], 10, *pc); pp++; pc++;
401 II(c, d, a, b, x[*pp], 15, *pc); pp++; pc++;
402 II(b, c, d, a, x[*pp], 21, *pc); pp++; pc++;
403 }
404#else
405 /* Round 1 */
406#define S11 7
407#define S12 12
408#define S13 17
409#define S14 22
410 FF(a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
411 FF(d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
412 FF(c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
413 FF(b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
414 FF(a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
415 FF(d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
416 FF(c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
417 FF(b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
418 FF(a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
419 FF(d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
420 FF(c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
421 FF(b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
422 FF(a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
423 FF(d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
424 FF(c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
425 FF(b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
426
427 /* Round 2 */
428#define S21 5
429#define S22 9
430#define S23 14
431#define S24 20
432 GG(a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
433 GG(d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
434 GG(c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
435 GG(b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
436 GG(a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
437 GG(d, a, b, c, x[10], S22, 0x2441453); /* 22 */
438 GG(c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
439 GG(b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
440 GG(a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
441 GG(d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
442 GG(c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
443 GG(b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
444 GG(a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
445 GG(d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
446 GG(c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
447 GG(b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
448
449 /* Round 3 */
450#define S31 4
451#define S32 11
452#define S33 16
453#define S34 23
454 HH(a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
455 HH(d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
456 HH(c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
457 HH(b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
458 HH(a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
459 HH(d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
460 HH(c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
461 HH(b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
462 HH(a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
463 HH(d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
464 HH(c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
465 HH(b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
466 HH(a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
467 HH(d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
468 HH(c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
469 HH(b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
470
471 /* Round 4 */
472#define S41 6
473#define S42 10
474#define S43 15
475#define S44 21
476 II(a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
477 II(d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
478 II(c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
479 II(b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
480 II(a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
481 II(d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
482 II(c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
483 II(b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
484 II(a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
485 II(d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
486 II(c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
487 II(b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
488 II(a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
489 II(d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
490 II(c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
491 II(b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
492#endif
493
494 state[0] += a;
495 state[1] += b;
496 state[2] += c;
497 state[3] += d;
498
499 /* Zeroize sensitive information. */
500 memset(x, 0, sizeof(x));
501}
502
503
504static void
505__md5_to64(char *s, unsigned long v, int n)
506{
507 while (--n >= 0) {
508 *s++ = ascii64[v & 0x3f];
509 v >>= 6;
510 }
511}
512
513/*
514 * UNIX password
515 *
516 * Use MD5 for what it is best at...
517 */
518#define MD5_OUT_BUFSIZE 120
519
520static char *
521md5_crypt(char passwd[120], const unsigned char *pw, const unsigned char *salt)
522{
523 const unsigned char *sp, *ep;
524 char *p;
525 unsigned char final[17]; /* final[16] exists only to aid in looping */
526 int sl, pl, i, pw_len;
527 struct MD5Context ctx, ctx1;
528 unsigned long l;
529
530 /* Refine the Salt first */
531 sp = salt;
532
533// always true for bbox
534// /* If it starts with the magic string, then skip that */
535// if (!strncmp(sp, __md5__magic, MD5_MAGIC_LEN))
536 sp += MD5_MAGIC_LEN;
537
538 /* It stops at the first '$', max 8 chars */
539 for (ep = sp; *ep && *ep != '$' && ep < (sp+8); ep++)
540 continue;
541
542 /* get the length of the true salt */
543 sl = ep - sp;
544
545 __md5_Init(&ctx);
546
547 /* The password first, since that is what is most unknown */
548 pw_len = strlen((char*)pw);
549 __md5_Update(&ctx, pw, pw_len);
550
551 /* Then our magic string */
552 __md5_Update(&ctx, __md5__magic, MD5_MAGIC_LEN);
553
554 /* Then the raw salt */
555 __md5_Update(&ctx, sp, sl);
556
557 /* Then just as many characters of the MD5(pw, salt, pw) */
558 __md5_Init(&ctx1);
559 __md5_Update(&ctx1, pw, pw_len);
560 __md5_Update(&ctx1, sp, sl);
561 __md5_Update(&ctx1, pw, pw_len);
562 __md5_Final(final, &ctx1);
563 for (pl = pw_len; pl > 0; pl -= 16)
564 __md5_Update(&ctx, final, pl > 16 ? 16 : pl);
565
566 /* Don't leave anything around in vm they could use. */
567//TODO: the above comment seems to be wrong. final is used later.
568 memset(final, 0, sizeof(final));
569
570 /* Then something really weird... */
571 for (i = pw_len; i; i >>= 1) {
572 __md5_Update(&ctx, ((i & 1) ? final : (const unsigned char *) pw), 1);
573 }
574
575 /* Now make the output string */
576 passwd[0] = '$';
577 passwd[1] = '1';
578 passwd[2] = '$';
579 strncpy(passwd + 3, (char*)sp, sl);
580 passwd[sl + 3] = '$';
581 passwd[sl + 4] = '\0';
582
583 __md5_Final(final, &ctx);
584
585 /*
586 * and now, just to make sure things don't run too fast
587 * On a 60 Mhz Pentium this takes 34 msec, so you would
588 * need 30 seconds to build a 1000 entry dictionary...
589 */
590 for (i = 0; i < 1000; i++) {
591 __md5_Init(&ctx1);
592 if (i & 1)
593 __md5_Update(&ctx1, pw, pw_len);
594 else
595 __md5_Update(&ctx1, final, 16);
596
597 if (i % 3)
598 __md5_Update(&ctx1, sp, sl);
599
600 if (i % 7)
601 __md5_Update(&ctx1, pw, pw_len);
602
603 if (i & 1)
604 __md5_Update(&ctx1, final, 16);
605 else
606 __md5_Update(&ctx1, pw, pw_len);
607 __md5_Final(final, &ctx1);
608 }
609
610 p = passwd + sl + 4; /*strlen(passwd);*/
611
612 final[16] = final[5];
613 for (i = 0; i < 5; i++) {
614 l = (final[i] << 16) | (final[i+6] << 8) | final[i+12];
615 __md5_to64(p, l, 4); p += 4;
616 }
617 l = final[11];
618 __md5_to64(p, l, 2); p += 2;
619 *p = '\0';
620
621 /* Don't leave anything around in vm they could use. */
622 memset(final, 0, sizeof(final));
623
624 return passwd;
625}
626
627#undef MD5_SIZE_OVER_SPEED
628#undef MD5_MAGIC_STR
629#undef MD5_MAGIC_LEN
630#undef __md5_Encode
631#undef __md5_Decode
632#undef F
633#undef G
634#undef H
635#undef I
636#undef ROTATE_LEFT
637#undef FF
638#undef GG
639#undef HH
640#undef II
641#undef S11
642#undef S12
643#undef S13
644#undef S14
645#undef S21
646#undef S22
647#undef S23
648#undef S24
649#undef S31
650#undef S32
651#undef S33
652#undef S34
653#undef S41
654#undef S42
655#undef S43
656#undef S44
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-03-17 20:38:04 +0000