md5.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650
  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@lineo.com>, <andersee@debian.org>
  43. *
  44. * June 28, 2001 Manuel Novoa III
  45. *
  46. * "Un-inlined" code using loops and static const tables in order to
  47. * reduce generated code size (on i386 from approx 4k to approx 2.5k).
  48. *
  49. * June 29, 2001 Manuel Novoa III
  50. *
  51. * Completely removed static PADDING array.
  52. *
  53. * Reintroduced the loop unrolling in MD5_Transform and added the
  54. * MD5_SIZE_OVER_SPEED option for configurability. Define below as:
  55. * 0 fully unrolled loops
  56. * 1 partially unrolled (4 ops per loop)
  57. * 2 no unrolling -- introduces the need to swap 4 variables (slow)
  58. * 3 no unrolling and all 4 loops merged into one with switch
  59. * in each loop (glacial)
  60. * On i386, sizes are roughly (-Os -fno-builtin):
  61. * 0: 3k 1: 2.5k 2: 2.2k 3: 2k
  62. */
  63. /*
  64. * Valid values are 1 (fastest/largest) to 3 (smallest/slowest).
  65. */
  66. #define MD5_SIZE_OVER_SPEED 3
  67. /**********************************************************************/
  68. #include <sys/types.h>
  69. #include <string.h>
  70. #include <unistd.h>
  71. #include <stdio.h>
  72. #include <crypt.h>
  73. #include <sys/cdefs.h>
  74. /* MD5 context. */
  75. typedef struct MD5Context {
  76. u_int32_t state[4]; /* state (ABCD) */
  77. u_int32_t count[2]; /* number of bits, modulo 2^64 (lsb first) */
  78. unsigned char buffer[64]; /* input buffer */
  79. } MD5_CTX;
  80. void MD5Init (MD5_CTX *);
  81. void MD5Update (MD5_CTX *, const unsigned char *, unsigned int);
  82. void MD5Pad (MD5_CTX *);
  83. void MD5Final (unsigned char [16], MD5_CTX *);
  84. char * MD5End(MD5_CTX *, char *);
  85. char * MD5File(const char *, char *);
  86. char * MD5Data(const unsigned char *, unsigned int, char *);
  87. char * md5_crypt_r( const char *pw, const char *salt, struct crypt_data * data);
  88. char *md5_magic = "$1$"; /* * This string is magic for this algorithm. Having
  89. it this way, we can get better later on */
  90. static const unsigned char itoa64[] = /* 0 ... 63 => ascii - 64 */
  91. "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
  92. static void MD5Transform __P((u_int32_t [4], const unsigned char [64]));
  93. #ifdef KERNEL
  94. #define memset(x,y,z) bzero(x,z);
  95. #define memcpy(x,y,z) bcopy(y, x, z)
  96. #endif
  97. #ifdef i386
  98. #define Encode memcpy
  99. #define Decode memcpy
  100. #else /* i386 */
  101. /*
  102. * Encodes input (u_int32_t) into output (unsigned char). Assumes len is
  103. * a multiple of 4.
  104. */
  105. static void
  106. Encode (output, input, len)
  107. unsigned char *output;
  108. u_int32_t *input;
  109. unsigned int len;
  110. {
  111. unsigned int i, j;
  112. for (i = 0, j = 0; j < len; i++, j += 4) {
  113. output[j] = (unsigned char)(input[i] & 0xff);
  114. output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
  115. output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
  116. output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
  117. }
  118. }
  119. /*
  120. * Decodes input (unsigned char) into output (u_int32_t). Assumes len is
  121. * a multiple of 4.
  122. */
  123. static void
  124. Decode (output, input, len)
  125. u_int32_t *output;
  126. const unsigned char *input;
  127. unsigned int len;
  128. {
  129. unsigned int i, j;
  130. for (i = 0, j = 0; j < len; i++, j += 4)
  131. output[i] = ((u_int32_t)input[j]) | (((u_int32_t)input[j+1]) << 8) |
  132. (((u_int32_t)input[j+2]) << 16) | (((u_int32_t)input[j+3]) << 24);
  133. }
  134. #endif /* i386 */
  135. /* F, G, H and I are basic MD5 functions. */
  136. #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
  137. #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
  138. #define H(x, y, z) ((x) ^ (y) ^ (z))
  139. #define I(x, y, z) ((y) ^ ((x) | (~z)))
  140. /* ROTATE_LEFT rotates x left n bits. */
  141. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
  142. /*
  143. * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
  144. * Rotation is separate from addition to prevent recomputation.
  145. */
  146. #define FF(a, b, c, d, x, s, ac) { \
  147. (a) += F ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
  148. (a) = ROTATE_LEFT ((a), (s)); \
  149. (a) += (b); \
  150. }
  151. #define GG(a, b, c, d, x, s, ac) { \
  152. (a) += G ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
  153. (a) = ROTATE_LEFT ((a), (s)); \
  154. (a) += (b); \
  155. }
  156. #define HH(a, b, c, d, x, s, ac) { \
  157. (a) += H ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
  158. (a) = ROTATE_LEFT ((a), (s)); \
  159. (a) += (b); \
  160. }
  161. #define II(a, b, c, d, x, s, ac) { \
  162. (a) += I ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
  163. (a) = ROTATE_LEFT ((a), (s)); \
  164. (a) += (b); \
  165. }
  166. /* MD5 initialization. Begins an MD5 operation, writing a new context. */
  167. void MD5Init (MD5_CTX *context)
  168. {
  169. context->count[0] = context->count[1] = 0;
  170. /* Load magic initialization constants. */
  171. context->state[0] = 0x67452301;
  172. context->state[1] = 0xefcdab89;
  173. context->state[2] = 0x98badcfe;
  174. context->state[3] = 0x10325476;
  175. }
  176. /*
  177. * MD5 block update operation. Continues an MD5 message-digest
  178. * operation, processing another message block, and updating the
  179. * context.
  180. */
  181. void MD5Update ( MD5_CTX *context, const unsigned char *input, unsigned int inputLen)
  182. {
  183. unsigned int i, index, partLen;
  184. /* Compute number of bytes mod 64 */
  185. index = (unsigned int)((context->count[0] >> 3) & 0x3F);
  186. /* Update number of bits */
  187. if ((context->count[0] += ((u_int32_t)inputLen << 3))
  188. < ((u_int32_t)inputLen << 3))
  189. context->count[1]++;
  190. context->count[1] += ((u_int32_t)inputLen >> 29);
  191. partLen = 64 - index;
  192. /* Transform as many times as possible. */
  193. if (inputLen >= partLen) {
  194. memcpy((void *)&context->buffer[index], (const void *)input,
  195. partLen);
  196. MD5Transform (context->state, context->buffer);
  197. for (i = partLen; i + 63 < inputLen; i += 64)
  198. MD5Transform (context->state, &input[i]);
  199. index = 0;
  200. }
  201. else
  202. i = 0;
  203. /* Buffer remaining input */
  204. memcpy ((void *)&context->buffer[index], (const void *)&input[i],
  205. inputLen-i);
  206. }
  207. /*
  208. * MD5 padding. Adds padding followed by original length.
  209. */
  210. void MD5Pad ( MD5_CTX *context)
  211. {
  212. unsigned char bits[8];
  213. unsigned int index, padLen;
  214. unsigned char PADDING[64];
  215. memset(PADDING, 0, sizeof(PADDING));
  216. PADDING[0] = 0x80;
  217. /* Save number of bits */
  218. Encode (bits, context->count, 8);
  219. /* Pad out to 56 mod 64. */
  220. index = (unsigned int)((context->count[0] >> 3) & 0x3f);
  221. padLen = (index < 56) ? (56 - index) : (120 - index);
  222. MD5Update (context, PADDING, padLen);
  223. /* Append length (before padding) */
  224. MD5Update (context, bits, 8);
  225. }
  226. /*
  227. * MD5 finalization. Ends an MD5 message-digest operation, writing the
  228. * the message digest and zeroizing the context.
  229. */
  230. void MD5Final ( unsigned char digest[16], MD5_CTX *context)
  231. {
  232. /* Do padding. */
  233. MD5Pad (context);
  234. /* Store state in digest */
  235. Encode (digest, context->state, 16);
  236. /* Zeroize sensitive information. */
  237. memset ((void *)context, 0, sizeof (*context));
  238. }
  239. /* MD5 basic transformation. Transforms state based on block. */
  240. static void
  241. MD5Transform (state, block)
  242. u_int32_t state[4];
  243. const unsigned char block[64];
  244. {
  245. u_int32_t a, b, c, d, x[16];
  246. #if MD5_SIZE_OVER_SPEED > 1
  247. u_int32_t temp;
  248. const char *ps;
  249. static const char S[] = {
  250. 7, 12, 17, 22,
  251. 5, 9, 14, 20,
  252. 4, 11, 16, 23,
  253. 6, 10, 15, 21
  254. };
  255. #endif /* MD5_SIZE_OVER_SPEED > 1 */
  256. #if MD5_SIZE_OVER_SPEED > 0
  257. const u_int32_t *pc;
  258. const char *pp;
  259. int i;
  260. static const u_int32_t C[] = {
  261. /* round 1 */
  262. 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
  263. 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  264. 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  265. 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  266. /* round 2 */
  267. 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
  268. 0xd62f105d, 0x2441453, 0xd8a1e681, 0xe7d3fbc8,
  269. 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  270. 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  271. /* round 3 */
  272. 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
  273. 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  274. 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
  275. 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  276. /* round 4 */
  277. 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
  278. 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  279. 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  280. 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
  281. };
  282. static const char P[] = {
  283. 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, /* 1 */
  284. 1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12, /* 2 */
  285. 5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2, /* 3 */
  286. 0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9 /* 4 */
  287. };
  288. #endif /* MD5_SIZE_OVER_SPEED > 0 */
  289. Decode (x, block, 64);
  290. a = state[0]; b = state[1]; c = state[2]; d = state[3];
  291. #if MD5_SIZE_OVER_SPEED > 2
  292. pc = C; pp = P; ps = S - 4;
  293. for ( i = 0 ; i < 64 ; i++ ) {
  294. if ((i&0x0f) == 0) ps += 4;
  295. temp = a;
  296. switch (i>>4) {
  297. case 0:
  298. temp += F(b,c,d);
  299. break;
  300. case 1:
  301. temp += G(b,c,d);
  302. break;
  303. case 2:
  304. temp += H(b,c,d);
  305. break;
  306. case 3:
  307. temp += I(b,c,d);
  308. break;
  309. }
  310. temp += x[(int)(*pp++)] + *pc++;
  311. temp = ROTATE_LEFT(temp, ps[i&3]);
  312. temp += b;
  313. a = d; d = c; c = b; b = temp;
  314. }
  315. #elif MD5_SIZE_OVER_SPEED > 1
  316. pc = C; pp = P; ps = S;
  317. /* Round 1 */
  318. for ( i = 0 ; i < 16 ; i++ ) {
  319. FF (a, b, c, d, x[(int)(*pp++)], ps[i&0x3], *pc++);
  320. temp = d; d = c; c = b; b = a; a = temp;
  321. }
  322. /* Round 2 */
  323. ps += 4;
  324. for ( ; i < 32 ; i++ ) {
  325. GG (a, b, c, d, x[(int)(*pp++)], ps[i&0x3], *pc++);
  326. temp = d; d = c; c = b; b = a; a = temp;
  327. }
  328. /* Round 3 */
  329. ps += 4;
  330. for ( ; i < 48 ; i++ ) {
  331. HH (a, b, c, d, x[(int)(*pp++)], ps[i&0x3], *pc++);
  332. temp = d; d = c; c = b; b = a; a = temp;
  333. }
  334. /* Round 4 */
  335. ps += 4;
  336. for ( ; i < 64 ; i++ ) {
  337. II (a, b, c, d, x[(int)(*pp++)], ps[i&0x3], *pc++);
  338. temp = d; d = c; c = b; b = a; a = temp;
  339. }
  340. #elif MD5_SIZE_OVER_SPEED > 0
  341. pc = C; pp = P;
  342. /* Round 1 */
  343. for ( i = 0 ; i < 4 ; i++ ) {
  344. FF (a, b, c, d, x[(int)(*pp++)], 7, *pc++);
  345. FF (d, a, b, c, x[(int)(*pp++)], 12, *pc++);
  346. FF (c, d, a, b, x[(int)(*pp++)], 17, *pc++);
  347. FF (b, c, d, a, x[(int)(*pp++)], 22, *pc++);
  348. }
  349. /* Round 2 */
  350. for ( i = 0 ; i < 4 ; i++ ) {
  351. GG (a, b, c, d, x[(int)(*pp++)], 5, *pc++);
  352. GG (d, a, b, c, x[(int)(*pp++)], 9, *pc++);
  353. GG (c, d, a, b, x[(int)(*pp++)], 14, *pc++);
  354. GG (b, c, d, a, x[(int)(*pp++)], 20, *pc++);
  355. }
  356. /* Round 3 */
  357. for ( i = 0 ; i < 4 ; i++ ) {
  358. HH (a, b, c, d, x[(int)(*pp++)], 4, *pc++);
  359. HH (d, a, b, c, x[(int)(*pp++)], 11, *pc++);
  360. HH (c, d, a, b, x[(int)(*pp++)], 16, *pc++);
  361. HH (b, c, d, a, x[(int)(*pp++)], 23, *pc++);
  362. }
  363. /* Round 4 */
  364. for ( i = 0 ; i < 4 ; i++ ) {
  365. II (a, b, c, d, x[(int)(*pp++)], 6, *pc++);
  366. II (d, a, b, c, x[(int)(*pp++)], 10, *pc++);
  367. II (c, d, a, b, x[(int)(*pp++)], 15, *pc++);
  368. II (b, c, d, a, x[(int)(*pp++)], 21, *pc++);
  369. }
  370. #else
  371. /* Round 1 */
  372. #define S11 7
  373. #define S12 12
  374. #define S13 17
  375. #define S14 22
  376. FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
  377. FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
  378. FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
  379. FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
  380. FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
  381. FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
  382. FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
  383. FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
  384. FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
  385. FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
  386. FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
  387. FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
  388. FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
  389. FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
  390. FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
  391. FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
  392. /* Round 2 */
  393. #define S21 5
  394. #define S22 9
  395. #define S23 14
  396. #define S24 20
  397. GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
  398. GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
  399. GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
  400. GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
  401. GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
  402. GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
  403. GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
  404. GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
  405. GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
  406. GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
  407. GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
  408. GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
  409. GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
  410. GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
  411. GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
  412. GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
  413. /* Round 3 */
  414. #define S31 4
  415. #define S32 11
  416. #define S33 16
  417. #define S34 23
  418. HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
  419. HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
  420. HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
  421. HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
  422. HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
  423. HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
  424. HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
  425. HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
  426. HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
  427. HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
  428. HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
  429. HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
  430. HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
  431. HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
  432. HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
  433. HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
  434. /* Round 4 */
  435. #define S41 6
  436. #define S42 10
  437. #define S43 15
  438. #define S44 21
  439. II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
  440. II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
  441. II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
  442. II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
  443. II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
  444. II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
  445. II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
  446. II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
  447. II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
  448. II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
  449. II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
  450. II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
  451. II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
  452. II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
  453. II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
  454. II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
  455. #endif
  456. state[0] += a;
  457. state[1] += b;
  458. state[2] += c;
  459. state[3] += d;
  460. /* Zeroize sensitive information. */
  461. memset ((void *)x, 0, sizeof (x));
  462. }
  463. static void to64( char *s, unsigned long v, int n)
  464. {
  465. while (--n >= 0) {
  466. *s++ = itoa64[v&0x3f];
  467. v >>= 6;
  468. }
  469. }
  470. /*
  471. * UNIX password
  472. *
  473. * Use MD5 for what it is best at...
  474. */
  475. char * md5_crypt_r( const char *pw, const char *salt, struct crypt_data * data)
  476. {
  477. char *p = data->p;
  478. const char *sp = data->sp;
  479. const char *ep = data->ep;
  480. char *passwd = data->key.b_data; /* This is a nice place where we can grab
  481. a bit of reentrant space... I'd create
  482. a separate field in struct crypt_data,
  483. but this spot should do nicely... */
  484. unsigned char final[17]; /* final[16] exists only to aid in looping */
  485. int sl,pl,i,md5_magic_len,pw_len;
  486. MD5_CTX ctx,ctx1;
  487. unsigned long l;
  488. /* Refine the Salt first */
  489. sp = salt;
  490. /* If it starts with the magic string, then skip that */
  491. md5_magic_len = strlen(md5_magic);
  492. if(!strncmp(sp,md5_magic,md5_magic_len))
  493. sp += md5_magic_len;
  494. /* It stops at the first '$', max 8 chars */
  495. for(ep=sp;*ep && *ep != '$' && ep < (sp+8);ep++)
  496. continue;
  497. /* get the length of the true salt */
  498. sl = ep - sp;
  499. MD5Init(&ctx);
  500. /* The password first, since that is what is most unknown */
  501. pw_len = strlen(pw);
  502. MD5Update(&ctx,pw,pw_len);
  503. /* Then our magic string */
  504. MD5Update(&ctx,md5_magic,md5_magic_len);
  505. /* Then the raw salt */
  506. MD5Update(&ctx,sp,sl);
  507. /* Then just as many characters of the MD5(pw,salt,pw) */
  508. MD5Init(&ctx1);
  509. MD5Update(&ctx1,pw,pw_len);
  510. MD5Update(&ctx1,sp,sl);
  511. MD5Update(&ctx1,pw,pw_len);
  512. MD5Final(final,&ctx1);
  513. for(pl = pw_len; pl > 0; pl -= 16)
  514. MD5Update(&ctx,final,pl>16 ? 16 : pl);
  515. /* Don't leave anything around in vm they could use. */
  516. memset(final,0,sizeof final);
  517. /* Then something really weird... */
  518. for (i = pw_len; i ; i >>= 1) {
  519. MD5Update(&ctx, ((i&1) ? final : (const unsigned char *) pw), 1);
  520. }
  521. /* Now make the output string */
  522. strcpy(passwd,md5_magic);
  523. strncat(passwd,sp,sl);
  524. strcat(passwd,"$");
  525. MD5Final(final,&ctx);
  526. /*
  527. * and now, just to make sure things don't run too fast
  528. * On a 60 Mhz Pentium this takes 34 msec, so you would
  529. * need 30 seconds to build a 1000 entry dictionary...
  530. */
  531. for(i=0;i<1000;i++) {
  532. MD5Init(&ctx1);
  533. if(i & 1)
  534. MD5Update(&ctx1,pw,pw_len);
  535. else
  536. MD5Update(&ctx1,final,16);
  537. if(i % 3)
  538. MD5Update(&ctx1,sp,sl);
  539. if(i % 7)
  540. MD5Update(&ctx1,pw,pw_len);
  541. if(i & 1)
  542. MD5Update(&ctx1,final,16);
  543. else
  544. MD5Update(&ctx1,pw,pw_len);
  545. MD5Final(final,&ctx1);
  546. }
  547. p = passwd + strlen(passwd);
  548. final[16] = final[5];
  549. for ( i=0 ; i < 5 ; i++ ) {
  550. l = (final[i]<<16) | (final[i+6]<<8) | final[i+12];
  551. to64(p,l,4); p += 4;
  552. }
  553. l = final[11];
  554. to64(p,l,2); p += 2;
  555. *p = '\0';
  556. /* Don't leave anything around in vm they could use. */
  557. memset(final,0,sizeof final);
  558. return passwd;
  559. }