jack1 codebase
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

559 lines
16KB

  1. /*
  2. * Functions to compute MD5 message digest of files or memory blocks
  3. * according to the definition of MD5 in RFC 1321 from April 1992.
  4. * Copyright (C) 1995, 1996 Free Software Foundation, Inc. NOTE: The
  5. * canonical source of this file is maintained with the GNU C Library.
  6. * Bugs can be reported to bug-glibc@prep.ai.mit.edu.
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published
  10. * by the Free Software Foundation; either version 2, or (at your
  11. * option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful, but
  14. * WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  21. * 02111-1307, USA.
  22. *
  23. * Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995.
  24. * Modified by Gray Watson <http://256.com/gray/>, 1997.
  25. *
  26. */
  27. /*
  28. * NOTE: during quick performance tests on a Sun Sparc Ultra 1 and an
  29. * Alpha 255 300, these functions performed upwards of 3mb/sec
  30. * including disk I/O time.
  31. */
  32. /*
  33. * MD5 Test Suite from RFC1321: http://ds.internic.net:/rfc/rfc1321.txt
  34. *
  35. * MD5 ("") = d41d8cd98f00b204e9800998ecf8427e
  36. * MD5 ("a") = 0cc175b9c0f1b6a831c399e269772661
  37. * MD5 ("abc") = 900150983cd24fb0d6963f7d28e17f72
  38. * MD5 ("message digest") = f96b697d7cb7938d525a2f31aaf161d0
  39. * MD5 ("abcdefghijklmnopqrstuvwxyz") = c3fcd3d76192e4007dfb496cca67e13b
  40. * MD5 ("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789") =
  41. * d174ab98d277d9f5a5611c2c9f419d9f
  42. * MD5 ("123456789012345678901234567890123456789012345678901234567890123456
  43. * 78901234567890") = 57edf4a22be3c955ac49da2e2107b67a
  44. */
  45. #include <stdlib.h>
  46. #include <string.h>
  47. #include <sys/types.h>
  48. #include "md5.h"
  49. #include "md5_loc.h"
  50. /* static char *rcs_id =
  51. /* version id for the library */
  52. /* static char *version_id = "$MD5Version: 1.0.0 November-19-1997 $"; */
  53. /****************************** local routines *******************************/
  54. /*
  55. * process_block
  56. *
  57. * DESCRIPTION:
  58. *
  59. * Process a block of bytes into a MD5 state structure.
  60. *
  61. * RETURNS:
  62. *
  63. * None.
  64. *
  65. * ARGUMENTS:
  66. *
  67. * md5_p - Pointer to MD5 structure from which we are getting the result.
  68. *
  69. * buffer - A buffer of bytes whose MD5 signature we are calculating.
  70. *
  71. * buf_len - The length of the buffer.
  72. */
  73. static void process_block (md5_t *md5_p, const void *buffer,
  74. const unsigned int buf_len)
  75. {
  76. md5_uint32 correct[16];
  77. const void *buf_p = buffer, *end_p;
  78. unsigned int words_n;
  79. md5_uint32 A, B, C, D;
  80. words_n = buf_len / sizeof(md5_uint32);
  81. end_p = (char*)buf_p + words_n * sizeof(md5_uint32);
  82. A = md5_p->md_A;
  83. B = md5_p->md_B;
  84. C = md5_p->md_C;
  85. D = md5_p->md_D;
  86. /*
  87. * First increment the byte count. RFC 1321 specifies the possible
  88. * length of the file up to 2^64 bits. Here we only compute the
  89. * number of bytes with a double word increment. Modified to do
  90. * this to better avoid overflows in the lower word -- Gray 10/97.
  91. */
  92. if (md5_p->md_total[0] > MAX_MD5_UINT32 - buf_len) {
  93. md5_p->md_total[1]++;
  94. md5_p->md_total[0] -= (MAX_MD5_UINT32 - buf_len);
  95. } else {
  96. md5_p->md_total[0] += buf_len;
  97. }
  98. /*
  99. * Process all bytes in the buffer with MD5_BLOCK bytes in each
  100. * round of the loop.
  101. */
  102. while (buf_p < end_p) {
  103. md5_uint32 A_save, B_save, C_save, D_save;
  104. md5_uint32 *corr_p = correct;
  105. A_save = A;
  106. B_save = B;
  107. C_save = C;
  108. D_save = D;
  109. /*
  110. * Before we start, one word to the strange constants. They are
  111. * defined in RFC 1321 as
  112. *
  113. * T[i] = (int) (4294967296.0 * fabs (sin (i))), i=1..MD5_BLOCK
  114. */
  115. /* Round 1. */
  116. OP1 (A, B, C, D, buf_p, corr_p, 7, 0xd76aa478);
  117. OP1 (D, A, B, C, buf_p, corr_p, 12, 0xe8c7b756);
  118. OP1 (C, D, A, B, buf_p, corr_p, 17, 0x242070db);
  119. OP1 (B, C, D, A, buf_p, corr_p, 22, 0xc1bdceee);
  120. OP1 (A, B, C, D, buf_p, corr_p, 7, 0xf57c0faf);
  121. OP1 (D, A, B, C, buf_p, corr_p, 12, 0x4787c62a);
  122. OP1 (C, D, A, B, buf_p, corr_p, 17, 0xa8304613);
  123. OP1 (B, C, D, A, buf_p, corr_p, 22, 0xfd469501);
  124. OP1 (A, B, C, D, buf_p, corr_p, 7, 0x698098d8);
  125. OP1 (D, A, B, C, buf_p, corr_p, 12, 0x8b44f7af);
  126. OP1 (C, D, A, B, buf_p, corr_p, 17, 0xffff5bb1);
  127. OP1 (B, C, D, A, buf_p, corr_p, 22, 0x895cd7be);
  128. OP1 (A, B, C, D, buf_p, corr_p, 7, 0x6b901122);
  129. OP1 (D, A, B, C, buf_p, corr_p, 12, 0xfd987193);
  130. OP1 (C, D, A, B, buf_p, corr_p, 17, 0xa679438e);
  131. OP1 (B, C, D, A, buf_p, corr_p, 22, 0x49b40821);
  132. /* Round 2. */
  133. OP234 (FG, A, B, C, D, correct[ 1], 5, 0xf61e2562);
  134. OP234 (FG, D, A, B, C, correct[ 6], 9, 0xc040b340);
  135. OP234 (FG, C, D, A, B, correct[ 11], 14, 0x265e5a51);
  136. OP234 (FG, B, C, D, A, correct[ 0], 20, 0xe9b6c7aa);
  137. OP234 (FG, A, B, C, D, correct[ 5], 5, 0xd62f105d);
  138. OP234 (FG, D, A, B, C, correct[ 10], 9, 0x02441453);
  139. OP234 (FG, C, D, A, B, correct[ 15], 14, 0xd8a1e681);
  140. OP234 (FG, B, C, D, A, correct[ 4], 20, 0xe7d3fbc8);
  141. OP234 (FG, A, B, C, D, correct[ 9], 5, 0x21e1cde6);
  142. OP234 (FG, D, A, B, C, correct[ 14], 9, 0xc33707d6);
  143. OP234 (FG, C, D, A, B, correct[ 3], 14, 0xf4d50d87);
  144. OP234 (FG, B, C, D, A, correct[ 8], 20, 0x455a14ed);
  145. OP234 (FG, A, B, C, D, correct[ 13], 5, 0xa9e3e905);
  146. OP234 (FG, D, A, B, C, correct[ 2], 9, 0xfcefa3f8);
  147. OP234 (FG, C, D, A, B, correct[ 7], 14, 0x676f02d9);
  148. OP234 (FG, B, C, D, A, correct[ 12], 20, 0x8d2a4c8a);
  149. /* Round 3. */
  150. OP234 (FH, A, B, C, D, correct[ 5], 4, 0xfffa3942);
  151. OP234 (FH, D, A, B, C, correct[ 8], 11, 0x8771f681);
  152. OP234 (FH, C, D, A, B, correct[ 11], 16, 0x6d9d6122);
  153. OP234 (FH, B, C, D, A, correct[ 14], 23, 0xfde5380c);
  154. OP234 (FH, A, B, C, D, correct[ 1], 4, 0xa4beea44);
  155. OP234 (FH, D, A, B, C, correct[ 4], 11, 0x4bdecfa9);
  156. OP234 (FH, C, D, A, B, correct[ 7], 16, 0xf6bb4b60);
  157. OP234 (FH, B, C, D, A, correct[ 10], 23, 0xbebfbc70);
  158. OP234 (FH, A, B, C, D, correct[ 13], 4, 0x289b7ec6);
  159. OP234 (FH, D, A, B, C, correct[ 0], 11, 0xeaa127fa);
  160. OP234 (FH, C, D, A, B, correct[ 3], 16, 0xd4ef3085);
  161. OP234 (FH, B, C, D, A, correct[ 6], 23, 0x04881d05);
  162. OP234 (FH, A, B, C, D, correct[ 9], 4, 0xd9d4d039);
  163. OP234 (FH, D, A, B, C, correct[ 12], 11, 0xe6db99e5);
  164. OP234 (FH, C, D, A, B, correct[ 15], 16, 0x1fa27cf8);
  165. OP234 (FH, B, C, D, A, correct[ 2], 23, 0xc4ac5665);
  166. /* Round 4. */
  167. OP234 (FI, A, B, C, D, correct[ 0], 6, 0xf4292244);
  168. OP234 (FI, D, A, B, C, correct[ 7], 10, 0x432aff97);
  169. OP234 (FI, C, D, A, B, correct[ 14], 15, 0xab9423a7);
  170. OP234 (FI, B, C, D, A, correct[ 5], 21, 0xfc93a039);
  171. OP234 (FI, A, B, C, D, correct[ 12], 6, 0x655b59c3);
  172. OP234 (FI, D, A, B, C, correct[ 3], 10, 0x8f0ccc92);
  173. OP234 (FI, C, D, A, B, correct[ 10], 15, 0xffeff47d);
  174. OP234 (FI, B, C, D, A, correct[ 1], 21, 0x85845dd1);
  175. OP234 (FI, A, B, C, D, correct[ 8], 6, 0x6fa87e4f);
  176. OP234 (FI, D, A, B, C, correct[ 15], 10, 0xfe2ce6e0);
  177. OP234 (FI, C, D, A, B, correct[ 6], 15, 0xa3014314);
  178. OP234 (FI, B, C, D, A, correct[ 13], 21, 0x4e0811a1);
  179. OP234 (FI, A, B, C, D, correct[ 4], 6, 0xf7537e82);
  180. OP234 (FI, D, A, B, C, correct[ 11], 10, 0xbd3af235);
  181. OP234 (FI, C, D, A, B, correct[ 2], 15, 0x2ad7d2bb);
  182. OP234 (FI, B, C, D, A, correct[ 9], 21, 0xeb86d391);
  183. /* Add the starting values of the context. */
  184. A += A_save;
  185. B += B_save;
  186. C += C_save;
  187. D += D_save;
  188. }
  189. /* Put checksum in context given as argument. */
  190. md5_p->md_A = A;
  191. md5_p->md_B = B;
  192. md5_p->md_C = C;
  193. md5_p->md_D = D;
  194. }
  195. /*
  196. * md5_get_result
  197. *
  198. * DESCRIPTION:
  199. *
  200. * Copy the resulting MD5 signature from MD5_P into the first 16 bytes
  201. * (MD5_SIZE) of the result buffer.
  202. *
  203. * RETURNS:
  204. *
  205. * None.
  206. *
  207. * ARGUMENTS:
  208. *
  209. * md5_p - Pointer to MD5 structure from which we are getting the result.
  210. *
  211. * result - A 16 byte buffer that will contain the MD5 signature.
  212. */
  213. static void md5_get_result (const md5_t *md5_p, void *result)
  214. {
  215. md5_uint32 hold;
  216. void *res_p = result;
  217. hold = SWAP (md5_p->md_A);
  218. memcpy (res_p, &hold, sizeof(md5_uint32));
  219. res_p = (char*)res_p + sizeof(md5_uint32);
  220. hold = SWAP (md5_p->md_B);
  221. memcpy (res_p, &hold, sizeof(md5_uint32));
  222. res_p = (char*)res_p + sizeof(md5_uint32);
  223. hold = SWAP (md5_p->md_C);
  224. memcpy (res_p, &hold, sizeof(md5_uint32));
  225. res_p = (char*)res_p + sizeof(md5_uint32);
  226. hold = SWAP (md5_p->md_D);
  227. memcpy (res_p, &hold, sizeof(md5_uint32));
  228. }
  229. /***************************** exported routines *****************************/
  230. /*
  231. * md5_init
  232. *
  233. * DESCRIPTION:
  234. *
  235. * Initialize structure containing state of MD5 computation. (RFC 1321,
  236. * 3.3: Step 3). This is for progressive MD5 calculations only. If
  237. * you have the complete string available, md5_buffer should be used.
  238. * md5_process should be called for each bunch of bytes and after the
  239. * last process call, md5_finish should be called to get the
  240. * signature.
  241. *
  242. * RETURNS:
  243. *
  244. * None.
  245. *
  246. * ARGUMENTS:
  247. *
  248. * md5_p - Pointer to md5 structure that we are initializing.
  249. */
  250. void md5_init (md5_t *md5_p)
  251. {
  252. md5_p->md_A = 0x67452301;
  253. md5_p->md_B = 0xefcdab89;
  254. md5_p->md_C = 0x98badcfe;
  255. md5_p->md_D = 0x10325476;
  256. md5_p->md_total[0] = 0;
  257. md5_p->md_total[1] = 0;
  258. md5_p->md_buf_len = 0;
  259. }
  260. /*
  261. * md5_process
  262. *
  263. * DESCRIPTION:
  264. *
  265. * This function is used to progressively calculate a MD5 signature some
  266. * number of bytes at a time. If you have the complete string
  267. * available, md5_buffer should be used. The MD5 structure should
  268. * have been initialized with md5_init and after the last process
  269. * call, md5_finish should be called to get the results.
  270. *
  271. * RETURNS:
  272. *
  273. * None.
  274. *
  275. * ARGUMENTS:
  276. *
  277. * md5_p - Pointer to MD5 structure which we are progressively updating.
  278. *
  279. * buffer - A buffer of bytes whose MD5 signature we are calculating.
  280. *
  281. * buf_len - The length of the buffer.
  282. */
  283. void md5_process (md5_t *md5_p, const void *buffer,
  284. const unsigned int buf_len)
  285. {
  286. unsigned int len = buf_len;
  287. unsigned int in_block, add;
  288. /*
  289. * When we already have some bytes in our internal buffer, copy some
  290. * from the user to fill the block.
  291. */
  292. if (md5_p->md_buf_len > 0) {
  293. in_block = md5_p->md_buf_len;
  294. if (in_block + len > sizeof(md5_p->md_buffer)) {
  295. add = sizeof(md5_p->md_buffer) - in_block;
  296. } else {
  297. add = len;
  298. }
  299. memcpy (md5_p->md_buffer + in_block, buffer, add);
  300. md5_p->md_buf_len += add;
  301. in_block += add;
  302. if (in_block > MD5_BLOCK_SIZE) {
  303. process_block (md5_p, md5_p->md_buffer, in_block & ~BLOCK_SIZE_MASK);
  304. /* the regions in the following copy operation will not overlap. */
  305. memcpy (md5_p->md_buffer,
  306. md5_p->md_buffer + (in_block & ~BLOCK_SIZE_MASK),
  307. in_block & BLOCK_SIZE_MASK);
  308. md5_p->md_buf_len = in_block & BLOCK_SIZE_MASK;
  309. }
  310. buffer = (const char*)buffer + add;
  311. len -= add;
  312. }
  313. /* process available complete blocks right from the user buffer */
  314. if (len > MD5_BLOCK_SIZE) {
  315. process_block (md5_p, buffer, len & ~BLOCK_SIZE_MASK);
  316. buffer = (const char*)buffer + (len & ~BLOCK_SIZE_MASK);
  317. len &= BLOCK_SIZE_MASK;
  318. }
  319. /* copy remaining bytes into the internal buffer */
  320. if (len > 0) {
  321. memcpy (md5_p->md_buffer, buffer, len);
  322. md5_p->md_buf_len = len;
  323. }
  324. }
  325. /*
  326. * md5_finish
  327. *
  328. * DESCRIPTION:
  329. *
  330. * Finish a progressing MD5 calculation and copy the resulting MD5
  331. * signature into the result buffer which should be 16 bytes
  332. * (MD5_SIZE). After this call, the MD5 structure is invalid.
  333. *
  334. * RETURNS:
  335. *
  336. * None.
  337. *
  338. * ARGUMENTS:
  339. *
  340. * md5_p - Pointer to MD5 structure which we are finishing.
  341. *
  342. * signature - A 16 byte buffer that will contain the MD5 signature.
  343. */
  344. void md5_finish (md5_t *md5_p, void *signature)
  345. {
  346. md5_uint32 bytes, hold;
  347. int pad;
  348. /* take yet unprocessed bytes into account */
  349. bytes = md5_p->md_buf_len;
  350. /*
  351. * Count remaining bytes. Modified to do this to better avoid
  352. * overflows in the lower word -- Gray 10/97.
  353. */
  354. if (md5_p->md_total[0] > MAX_MD5_UINT32 - bytes) {
  355. md5_p->md_total[1]++;
  356. md5_p->md_total[0] -= (MAX_MD5_UINT32 - bytes);
  357. } else {
  358. md5_p->md_total[0] += bytes;
  359. }
  360. /*
  361. * Pad the buffer to the next MD5_BLOCK-byte boundary. (RFC 1321,
  362. * 3.1: Step 1). We need enough room for two size words and the
  363. * bytes left in the buffer. For some reason even if we are equal
  364. * to the block-size, we add an addition block of pad bytes.
  365. */
  366. pad = MD5_BLOCK_SIZE - (sizeof(md5_uint32) * 2) - bytes;
  367. if (pad <= 0) {
  368. pad += MD5_BLOCK_SIZE;
  369. }
  370. /*
  371. * Modified from a fixed array to this assignment and memset to be
  372. * more flexible with block-sizes -- Gray 10/97.
  373. */
  374. if (pad > 0) {
  375. /* some sort of padding start byte */
  376. md5_p->md_buffer[bytes] = (unsigned char)0x80;
  377. if (pad > 1) {
  378. memset (md5_p->md_buffer + bytes + 1, 0, pad - 1);
  379. }
  380. bytes += pad;
  381. }
  382. /* put the 64-bit file length in _bits_ (i.e. *8) at the end of the buffer */
  383. hold = SWAP (md5_p->md_total[0] << 3);
  384. memcpy (md5_p->md_buffer + bytes, &hold, sizeof(md5_uint32));
  385. bytes += sizeof(md5_uint32);
  386. /* shift the high word over by 3 and add in the top 3 bits from the low */
  387. hold = SWAP ((md5_p->md_total[1] << 3) | (md5_p->md_total[0] >> 29));
  388. memcpy (md5_p->md_buffer + bytes, &hold, sizeof(md5_uint32));
  389. bytes += sizeof(md5_uint32);
  390. /* process last bytes, the padding chars, and size words */
  391. process_block (md5_p, md5_p->md_buffer, bytes);
  392. md5_get_result (md5_p, signature);
  393. }
  394. /*
  395. * md5_buffer
  396. *
  397. * DESCRIPTION:
  398. *
  399. * This function is used to calculate a MD5 signature for a buffer of
  400. * bytes. If you only have part of a buffer that you want to process
  401. * then md5_init, md5_process, and md5_finish should be used.
  402. *
  403. * RETURNS:
  404. *
  405. * None.
  406. *
  407. * ARGUMENTS:
  408. *
  409. * buffer - A buffer of bytes whose MD5 signature we are calculating.
  410. *
  411. * buf_len - The length of the buffer.
  412. *
  413. * signature - A 16 byte buffer that will contain the MD5 signature.
  414. */
  415. void md5_buffer (const char *buffer, const unsigned int buf_len,
  416. void *signature)
  417. {
  418. md5_t md5;
  419. /* initialize the computation context */
  420. md5_init (&md5);
  421. /* process whole buffer but last buf_len % MD5_BLOCK bytes */
  422. md5_process (&md5, buffer, buf_len);
  423. /* put result in desired memory area */
  424. md5_finish (&md5, signature);
  425. }
  426. /*
  427. * md5_sig_to_string
  428. *
  429. * DESCRIPTION:
  430. *
  431. * Convert a MD5 signature in a 16 byte buffer into a hexadecimal string
  432. * representation.
  433. *
  434. * RETURNS:
  435. *
  436. * None.
  437. *
  438. * ARGUMENTS:
  439. *
  440. * signature - a 16 byte buffer that contains the MD5 signature.
  441. *
  442. * str - a string of charactes which should be at least 33 bytes long (2
  443. * characters per MD5 byte and 1 for the \0).
  444. *
  445. * str_len - the length of the string.
  446. */
  447. void md5_sig_to_string (void *signature, char *str, const int str_len)
  448. {
  449. unsigned char *sig_p;
  450. char *str_p, *max_p;
  451. unsigned int high, low;
  452. str_p = str;
  453. max_p = str + str_len;
  454. for (sig_p = (unsigned char*)signature;
  455. sig_p < (unsigned char*)signature + MD5_SIZE;
  456. sig_p++) {
  457. high = *sig_p / 16;
  458. low = *sig_p % 16;
  459. /* account for 2 chars */
  460. if (str_p + 1 >= max_p) {
  461. break;
  462. }
  463. *str_p++ = HEX_STRING[high];
  464. *str_p++ = HEX_STRING[low];
  465. }
  466. /* account for 2 chars */
  467. if (str_p < max_p) {
  468. *str_p++ = '\0';
  469. }
  470. }
  471. /*
  472. * md5_sig_from_string
  473. *
  474. * DESCRIPTION:
  475. *
  476. * Convert a MD5 signature from a hexadecimal string representation into
  477. * a 16 byte buffer.
  478. *
  479. * RETURNS:
  480. *
  481. * None.
  482. *
  483. * ARGUMENTS:
  484. *
  485. * signature - A 16 byte buffer that will contain the MD5 signature.
  486. *
  487. * str - A string of charactes which _must_ be at least 32 bytes long (2
  488. * characters per MD5 byte).
  489. */
  490. void md5_sig_from_string (void *signature, const char *str)
  491. {
  492. unsigned char *sig_p;
  493. const char *str_p;
  494. char *hex;
  495. unsigned int high, low, val;
  496. hex = HEX_STRING;
  497. sig_p = signature;
  498. for (str_p = str; str_p < str + MD5_SIZE * 2; str_p += 2) {
  499. high = strchr (hex, *str_p) - hex;
  500. low = strchr (hex, *(str_p + 1)) - hex;
  501. val = high * 16 + low;
  502. *sig_p++ = val;
  503. }
  504. }