2 * MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
4 * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
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
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.
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.
22 * These notices must be retained in any copies of any part of this
23 * documentation and/or software.
25 * $FreeBSD: src/lib/libmd/md5c.c,v 1.9.2.1 1999/08/29 14:57:12 peter Exp $
27 * This code is the same as the code published by RSA Inc. It has been
28 * edited for clarity and style only.
30 * ----------------------------------------------------------------------------
31 * The md5_crypt() function was taken from freeBSD's libcrypt and contains
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
38 * $FreeBSD: src/lib/libcrypt/crypt.c,v 1.7.2.1 1999/08/29 14:56:33 peter Exp $
40 * ----------------------------------------------------------------------------
41 * On April 19th, 2001 md5_crypt() was modified to make it reentrant
42 * by Erik Andersen <andersen@uclibc.org>
45 * June 28, 2001 Manuel Novoa III
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).
50 * June 29, 2001 Manuel Novoa III
52 * Completely removed static PADDING array.
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
65 * Since SuSv3 does not require crypt_r, modified again August 7, 2002
66 * by Erik Andersen to remove reentrance stuff...
70 * Valid values are 1 (fastest/largest) to 3 (smallest/slowest).
72 #define MD5_SIZE_OVER_SPEED 3
74 /**********************************************************************/
76 #include <sys/types.h>
81 #include <sys/cdefs.h>
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 */
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]));
98 #define MD5_MAGIC_STR "$1$"
99 #define MD5_MAGIC_LEN (sizeof(MD5_MAGIC_STR) - 1)
100 static const unsigned char __md5__magic[] = MD5_MAGIC_STR;
101 /* This string is magic for this algorithm. Having
102 * it this way, we can get better later on */
103 static const unsigned char __md5_itoa64[] = /* 0 ... 63 => ascii - 64 */
104 "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
108 #define __md5_Encode memcpy
109 #define __md5_Decode memcpy
113 * __md5_Encodes input (u_int32_t) into output (unsigned char). Assumes len is
118 __md5_Encode (unsigned char *output, u_int32_t *input, unsigned int len)
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);
131 * __md5_Decodes input (unsigned char) into output (u_int32_t). Assumes len is
136 __md5_Decode (u_int32_t *output, const unsigned char *input, unsigned int len)
140 for (i = 0, j = 0; j < len; i++, j += 4)
141 output[i] = ((u_int32_t)input[j]) | (((u_int32_t)input[j+1]) << 8) |
142 (((u_int32_t)input[j+2]) << 16) | (((u_int32_t)input[j+3]) << 24);
146 /* F, G, H and I are basic MD5 functions. */
147 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
148 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
149 #define H(x, y, z) ((x) ^ (y) ^ (z))
150 #define I(x, y, z) ((y) ^ ((x) | (~z)))
152 /* ROTATE_LEFT rotates x left n bits. */
153 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
156 * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
157 * Rotation is separate from addition to prevent recomputation.
159 #define FF(a, b, c, d, x, s, ac) { \
160 (a) += F ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
161 (a) = ROTATE_LEFT ((a), (s)); \
164 #define GG(a, b, c, d, x, s, ac) { \
165 (a) += G ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
166 (a) = ROTATE_LEFT ((a), (s)); \
169 #define HH(a, b, c, d, x, s, ac) { \
170 (a) += H ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
171 (a) = ROTATE_LEFT ((a), (s)); \
174 #define II(a, b, c, d, x, s, ac) { \
175 (a) += I ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
176 (a) = ROTATE_LEFT ((a), (s)); \
180 /* MD5 initialization. Begins an MD5 operation, writing a new context. */
182 static void __md5_Init (struct MD5Context *context)
184 context->count[0] = context->count[1] = 0;
186 /* Load magic initialization constants. */
187 context->state[0] = 0x67452301;
188 context->state[1] = 0xefcdab89;
189 context->state[2] = 0x98badcfe;
190 context->state[3] = 0x10325476;
194 * MD5 block update operation. Continues an MD5 message-digest
195 * operation, processing another message block, and updating the
199 static void __md5_Update ( struct MD5Context *context, const unsigned char *input, unsigned int inputLen)
201 unsigned int i, idx, partLen;
203 /* Compute number of bytes mod 64 */
204 idx = (unsigned int)((context->count[0] >> 3) & 0x3F);
206 /* Update number of bits */
207 if ((context->count[0] += ((u_int32_t)inputLen << 3))
208 < ((u_int32_t)inputLen << 3))
210 context->count[1] += ((u_int32_t)inputLen >> 29);
214 /* Transform as many times as possible. */
215 if (inputLen >= partLen) {
216 memcpy((void *)&context->buffer[idx], (const void *)input,
218 __md5_Transform (context->state, context->buffer);
220 for (i = partLen; i + 63 < inputLen; i += 64)
221 __md5_Transform (context->state, &input[i]);
228 /* Buffer remaining input */
229 memcpy ((void *)&context->buffer[idx], (const void *)&input[i],
234 * MD5 padding. Adds padding followed by original length.
237 static void __md5_Pad ( struct MD5Context *context)
239 unsigned char bits[8];
240 unsigned int idx, padLen;
241 unsigned char PADDING[64];
243 memset(PADDING, 0, sizeof(PADDING));
246 /* Save number of bits */
247 __md5_Encode (bits, context->count, 8);
249 /* Pad out to 56 mod 64. */
250 idx = (unsigned int)((context->count[0] >> 3) & 0x3f);
251 padLen = (idx < 56) ? (56 - idx) : (120 - idx);
252 __md5_Update (context, PADDING, padLen);
254 /* Append length (before padding) */
255 __md5_Update (context, bits, 8);
259 * MD5 finalization. Ends an MD5 message-digest operation, writing the
260 * the message digest and zeroizing the context.
263 static void __md5_Final ( unsigned char digest[16], struct MD5Context *context)
268 /* Store state in digest */
269 __md5_Encode (digest, context->state, 16);
271 /* Zeroize sensitive information. */
272 memset ((void *)context, 0, sizeof (*context));
275 /* MD5 basic transformation. Transforms state based on block. */
277 static void __md5_Transform (u_int32_t state[4], const unsigned char block[64])
279 u_int32_t a, b, c, d, x[16];
280 #if MD5_SIZE_OVER_SPEED > 1
284 static const char S[] = {
290 #endif /* MD5_SIZE_OVER_SPEED > 1 */
292 #if MD5_SIZE_OVER_SPEED > 0
297 static const u_int32_t C[] = {
299 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
300 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
301 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
302 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
304 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
305 0xd62f105d, 0x2441453, 0xd8a1e681, 0xe7d3fbc8,
306 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
307 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
309 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
310 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
311 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
312 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
314 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
315 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
316 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
317 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
320 static const char P[] = {
321 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, /* 1 */
322 1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12, /* 2 */
323 5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2, /* 3 */
324 0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9 /* 4 */
327 #endif /* MD5_SIZE_OVER_SPEED > 0 */
329 __md5_Decode (x, block, 64);
331 a = state[0]; b = state[1]; c = state[2]; d = state[3];
333 #if MD5_SIZE_OVER_SPEED > 2
334 pc = C; pp = P; ps = S - 4;
336 for ( i = 0 ; i < 64 ; i++ ) {
337 if ((i&0x0f) == 0) ps += 4;
353 temp += x[(int)(*pp++)] + *pc++;
354 temp = ROTATE_LEFT(temp, ps[i&3]);
356 a = d; d = c; c = b; b = temp;
358 #elif MD5_SIZE_OVER_SPEED > 1
359 pc = C; pp = P; ps = S;
362 for ( i = 0 ; i < 16 ; i++ ) {
363 FF (a, b, c, d, x[(int)(*pp++)], ps[i&0x3], *pc++);
364 temp = d; d = c; c = b; b = a; a = temp;
369 for ( ; i < 32 ; i++ ) {
370 GG (a, b, c, d, x[(int)(*pp++)], ps[i&0x3], *pc++);
371 temp = d; d = c; c = b; b = a; a = temp;
375 for ( ; i < 48 ; i++ ) {
376 HH (a, b, c, d, x[(int)(*pp++)], ps[i&0x3], *pc++);
377 temp = d; d = c; c = b; b = a; a = temp;
382 for ( ; i < 64 ; i++ ) {
383 II (a, b, c, d, x[(int)(*pp++)], ps[i&0x3], *pc++);
384 temp = d; d = c; c = b; b = a; a = temp;
386 #elif MD5_SIZE_OVER_SPEED > 0
390 for ( i = 0 ; i < 4 ; i++ ) {
391 FF (a, b, c, d, x[(int)(*pp++)], 7, *pc++);
392 FF (d, a, b, c, x[(int)(*pp++)], 12, *pc++);
393 FF (c, d, a, b, x[(int)(*pp++)], 17, *pc++);
394 FF (b, c, d, a, x[(int)(*pp++)], 22, *pc++);
398 for ( i = 0 ; i < 4 ; i++ ) {
399 GG (a, b, c, d, x[(int)(*pp++)], 5, *pc++);
400 GG (d, a, b, c, x[(int)(*pp++)], 9, *pc++);
401 GG (c, d, a, b, x[(int)(*pp++)], 14, *pc++);
402 GG (b, c, d, a, x[(int)(*pp++)], 20, *pc++);
405 for ( i = 0 ; i < 4 ; i++ ) {
406 HH (a, b, c, d, x[(int)(*pp++)], 4, *pc++);
407 HH (d, a, b, c, x[(int)(*pp++)], 11, *pc++);
408 HH (c, d, a, b, x[(int)(*pp++)], 16, *pc++);
409 HH (b, c, d, a, x[(int)(*pp++)], 23, *pc++);
413 for ( i = 0 ; i < 4 ; i++ ) {
414 II (a, b, c, d, x[(int)(*pp++)], 6, *pc++);
415 II (d, a, b, c, x[(int)(*pp++)], 10, *pc++);
416 II (c, d, a, b, x[(int)(*pp++)], 15, *pc++);
417 II (b, c, d, a, x[(int)(*pp++)], 21, *pc++);
425 FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
426 FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
427 FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
428 FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
429 FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
430 FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
431 FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
432 FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
433 FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
434 FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
435 FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
436 FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
437 FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
438 FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
439 FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
440 FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
447 GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
448 GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
449 GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
450 GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
451 GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
452 GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
453 GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
454 GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
455 GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
456 GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
457 GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
458 GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
459 GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
460 GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
461 GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
462 GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
469 HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
470 HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
471 HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
472 HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
473 HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
474 HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
475 HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
476 HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
477 HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
478 HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
479 HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
480 HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
481 HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
482 HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
483 HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
484 HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
491 II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
492 II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
493 II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
494 II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
495 II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
496 II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
497 II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
498 II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
499 II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
500 II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
501 II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
502 II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
503 II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
504 II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
505 II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
506 II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
514 /* Zeroize sensitive information. */
515 memset ((void *)x, 0, sizeof (x));
519 static void __md5_to64( char *s, unsigned long v, int n)
522 *s++ = __md5_itoa64[v&0x3f];
530 * Use MD5 for what it is best at...
533 char *__md5_crypt(const unsigned char *pw, const unsigned char *salt)
536 static char passwd[120];
538 const unsigned char *sp, *ep;
540 unsigned char final[17]; /* final[16] exists only to aid in looping */
542 struct MD5Context ctx,ctx1;
545 /* Refine the Salt first */
548 /* If it starts with the magic string, then skip that */
549 if(!strncmp(sp,__md5__magic,MD5_MAGIC_LEN))
552 /* It stops at the first '$', max 8 chars */
553 for(ep=sp;*ep && *ep != '$' && ep < (sp+8);ep++)
556 /* get the length of the true salt */
561 /* The password first, since that is what is most unknown */
563 __md5_Update(&ctx,pw,pw_len);
565 /* Then our magic string */
566 __md5_Update(&ctx,__md5__magic,MD5_MAGIC_LEN);
568 /* Then the raw salt */
569 __md5_Update(&ctx,sp,sl);
571 /* Then just as many characters of the MD5(pw,salt,pw) */
573 __md5_Update(&ctx1,pw,pw_len);
574 __md5_Update(&ctx1,sp,sl);
575 __md5_Update(&ctx1,pw,pw_len);
576 __md5_Final(final,&ctx1);
577 for(pl = pw_len; pl > 0; pl -= 16)
578 __md5_Update(&ctx,final,pl>16 ? 16 : pl);
580 /* Don't leave anything around in vm they could use. */
581 memset(final,0,sizeof final);
583 /* Then something really weird... */
584 for (i = pw_len; i ; i >>= 1) {
585 __md5_Update(&ctx, ((i&1) ? final : (const unsigned char *) pw), 1);
588 /* Now make the output string */
589 strcpy(passwd,__md5__magic);
590 strncat(passwd,sp,sl);
593 __md5_Final(final,&ctx);
596 * and now, just to make sure things don't run too fast
597 * On a 60 Mhz Pentium this takes 34 msec, so you would
598 * need 30 seconds to build a 1000 entry dictionary...
600 for(i=0;i<1000;i++) {
603 __md5_Update(&ctx1,pw,pw_len);
605 __md5_Update(&ctx1,final,16);
608 __md5_Update(&ctx1,sp,sl);
611 __md5_Update(&ctx1,pw,pw_len);
614 __md5_Update(&ctx1,final,16);
616 __md5_Update(&ctx1,pw,pw_len);
617 __md5_Final(final,&ctx1);
620 p = passwd + strlen(passwd);
622 final[16] = final[5];
623 for ( i=0 ; i < 5 ; i++ ) {
624 l = (final[i]<<16) | (final[i+6]<<8) | final[i+12];
625 __md5_to64(p,l,4); p += 4;
628 __md5_to64(p,l,2); p += 2;
631 /* Don't leave anything around in vm they could use. */
632 memset(final,0,sizeof final);