source: trunk/cscrypt/md5.c@ 3181

Last change on this file since 3181 was 3181, checked in by dingo35, 10 years ago

Adding threadsafety FIXMEs, feel free to join checking..

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