source: trunk/cscrypt/md5.c@ 8

Last change on this file since 8 was 8, checked in by smurzch2, 12 years ago

Start repository for OSCam (Open Source Cam)

The start is from the MpCS source code. Thanks a lot to the authors for this
great sources.

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