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