md5.c 18 KB

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