PageRenderTime 61ms CodeModel.GetById 32ms RepoModel.GetById 1ms app.codeStats 0ms

/ext/digest/md5/md5.c

https://github.com/yuvrajm/ruby
C | 422 lines | 288 code | 34 blank | 100 comment | 17 complexity | dd8b649c9b05357e0cbb036df3814af4 MD5 | raw file
  1. /*
  2. Copyright (C) 1999, 2000 Aladdin Enterprises. All rights reserved.
  3. This software is provided 'as-is', without any express or implied
  4. warranty. In no event will the authors be held liable for any damages
  5. arising from the use of this software.
  6. Permission is granted to anyone to use this software for any purpose,
  7. including commercial applications, and to alter it and redistribute it
  8. freely, subject to the following restrictions:
  9. 1. The origin of this software must not be misrepresented; you must not
  10. claim that you wrote the original software. If you use this software
  11. in a product, an acknowledgment in the product documentation would be
  12. appreciated but is not required.
  13. 2. Altered source versions must be plainly marked as such, and must not be
  14. misrepresented as being the original software.
  15. 3. This notice may not be removed or altered from any source distribution.
  16. L. Peter Deutsch
  17. ghost@aladdin.com
  18. */
  19. /*
  20. Independent implementation of MD5 (RFC 1321).
  21. This code implements the MD5 Algorithm defined in RFC 1321.
  22. It is derived directly from the text of the RFC and not from the
  23. reference implementation.
  24. The original and principal author of md5.c is L. Peter Deutsch
  25. <ghost@aladdin.com>. Other authors are noted in the change history
  26. that follows (in reverse chronological order):
  27. 2000-07-03 lpd Patched to eliminate warnings about "constant is
  28. unsigned in ANSI C, signed in traditional";
  29. made test program self-checking.
  30. 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
  31. 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
  32. 1999-05-03 lpd Original version.
  33. */
  34. /*
  35. This code was modified for use in Ruby.
  36. - Akinori MUSHA <knu@idaemons.org>
  37. */
  38. /*$OrigId: md5c.c,v 1.2 2001/03/26 08:57:14 matz Exp $ */
  39. /*$RoughId: md5.c,v 1.2 2001/07/13 19:48:41 knu Exp $ */
  40. /*$Id$ */
  41. #include "md5.h"
  42. #ifdef TEST
  43. /*
  44. * Compile with -DTEST to create a self-contained executable test program.
  45. * The test program should print out the same values as given in section
  46. * A.5 of RFC 1321, reproduced below.
  47. */
  48. #include <string.h>
  49. int
  50. main()
  51. {
  52. static const char *const test[7*2] = {
  53. "", "d41d8cd98f00b204e9800998ecf8427e",
  54. "a", "0cc175b9c0f1b6a831c399e269772661",
  55. "abc", "900150983cd24fb0d6963f7d28e17f72",
  56. "message digest", "f96b697d7cb7938d525a2f31aaf161d0",
  57. "abcdefghijklmnopqrstuvwxyz", "c3fcd3d76192e4007dfb496cca67e13b",
  58. "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
  59. "d174ab98d277d9f5a5611c2c9f419d9f",
  60. "12345678901234567890123456789012345678901234567890123456789012345678901234567890", "57edf4a22be3c955ac49da2e2107b67a"
  61. };
  62. int i;
  63. for (i = 0; i < 7*2; i += 2) {
  64. MD5_CTX state;
  65. uint8_t digest[16];
  66. char hex_output[16*2 + 1];
  67. int di;
  68. MD5_Init(&state);
  69. MD5_Update(&state, (const uint8_t *)test[i], strlen(test[i]));
  70. MD5_Final(digest, &state);
  71. printf("MD5 (\"%s\") = ", test[i]);
  72. for (di = 0; di < 16; ++di)
  73. sprintf(hex_output + di * 2, "%02x", digest[di]);
  74. puts(hex_output);
  75. if (strcmp(hex_output, test[i + 1]))
  76. printf("**** ERROR, should be: %s\n", test[i + 1]);
  77. }
  78. return 0;
  79. }
  80. #endif /* TEST */
  81. /*
  82. * For reference, here is the program that computed the T values.
  83. */
  84. #ifdef COMPUTE_T_VALUES
  85. #include <math.h>
  86. int
  87. main()
  88. {
  89. int i;
  90. for (i = 1; i <= 64; ++i) {
  91. unsigned long v = (unsigned long)(4294967296.0 * fabs(sin((double)i)));
  92. /*
  93. * The following nonsense is only to avoid compiler warnings about
  94. * "integer constant is unsigned in ANSI C, signed with -traditional".
  95. */
  96. if (v >> 31) {
  97. printf("#define T%d /* 0x%08lx */ (T_MASK ^ 0x%08lx)\n", i,
  98. v, (unsigned long)(unsigned int)(~v));
  99. } else {
  100. printf("#define T%d 0x%08lx\n", i, v);
  101. }
  102. }
  103. return 0;
  104. }
  105. #endif /* COMPUTE_T_VALUES */
  106. /*
  107. * End of T computation program.
  108. */
  109. #ifdef T_MASK
  110. #undef T_MASK
  111. #endif
  112. #define T_MASK ((uint32_t)~0)
  113. #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
  114. #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
  115. #define T3 0x242070db
  116. #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
  117. #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
  118. #define T6 0x4787c62a
  119. #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
  120. #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
  121. #define T9 0x698098d8
  122. #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
  123. #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
  124. #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
  125. #define T13 0x6b901122
  126. #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
  127. #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
  128. #define T16 0x49b40821
  129. #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
  130. #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
  131. #define T19 0x265e5a51
  132. #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
  133. #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
  134. #define T22 0x02441453
  135. #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
  136. #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
  137. #define T25 0x21e1cde6
  138. #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
  139. #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
  140. #define T28 0x455a14ed
  141. #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
  142. #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
  143. #define T31 0x676f02d9
  144. #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
  145. #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
  146. #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
  147. #define T35 0x6d9d6122
  148. #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
  149. #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
  150. #define T38 0x4bdecfa9
  151. #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
  152. #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
  153. #define T41 0x289b7ec6
  154. #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
  155. #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
  156. #define T44 0x04881d05
  157. #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
  158. #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
  159. #define T47 0x1fa27cf8
  160. #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
  161. #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
  162. #define T50 0x432aff97
  163. #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
  164. #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
  165. #define T53 0x655b59c3
  166. #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
  167. #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
  168. #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
  169. #define T57 0x6fa87e4f
  170. #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
  171. #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
  172. #define T60 0x4e0811a1
  173. #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
  174. #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
  175. #define T63 0x2ad7d2bb
  176. #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
  177. static void
  178. md5_process(MD5_CTX *pms, const uint8_t *data /*[64]*/)
  179. {
  180. uint32_t
  181. a = pms->state[0], b = pms->state[1],
  182. c = pms->state[2], d = pms->state[3];
  183. uint32_t t;
  184. #ifdef WORDS_BIGENDIAN
  185. /*
  186. * On big-endian machines, we must arrange the bytes in the right
  187. * order. (This also works on machines of unknown byte order.)
  188. */
  189. uint32_t X[16];
  190. const uint8_t *xp = data;
  191. int i;
  192. for (i = 0; i < 16; ++i, xp += 4)
  193. X[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
  194. #else
  195. /*
  196. * On little-endian machines, we can process properly aligned data
  197. * without copying it.
  198. */
  199. uint32_t xbuf[16];
  200. const uint32_t *X;
  201. if (!((data - (const uint8_t *)0) & 3)) {
  202. /* data are properly aligned */
  203. X = (const uint32_t *)data;
  204. } else {
  205. /* not aligned */
  206. memcpy(xbuf, data, 64);
  207. X = xbuf;
  208. }
  209. #endif
  210. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
  211. /* Round 1. */
  212. /* Let [abcd k s i] denote the operation
  213. a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
  214. #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
  215. #define SET(a, b, c, d, k, s, Ti)\
  216. t = a + F(b,c,d) + X[k] + Ti;\
  217. a = ROTATE_LEFT(t, s) + b
  218. /* Do the following 16 operations. */
  219. SET(a, b, c, d, 0, 7, T1);
  220. SET(d, a, b, c, 1, 12, T2);
  221. SET(c, d, a, b, 2, 17, T3);
  222. SET(b, c, d, a, 3, 22, T4);
  223. SET(a, b, c, d, 4, 7, T5);
  224. SET(d, a, b, c, 5, 12, T6);
  225. SET(c, d, a, b, 6, 17, T7);
  226. SET(b, c, d, a, 7, 22, T8);
  227. SET(a, b, c, d, 8, 7, T9);
  228. SET(d, a, b, c, 9, 12, T10);
  229. SET(c, d, a, b, 10, 17, T11);
  230. SET(b, c, d, a, 11, 22, T12);
  231. SET(a, b, c, d, 12, 7, T13);
  232. SET(d, a, b, c, 13, 12, T14);
  233. SET(c, d, a, b, 14, 17, T15);
  234. SET(b, c, d, a, 15, 22, T16);
  235. #undef SET
  236. /* Round 2. */
  237. /* Let [abcd k s i] denote the operation
  238. a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
  239. #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
  240. #define SET(a, b, c, d, k, s, Ti)\
  241. t = a + G(b,c,d) + X[k] + Ti;\
  242. a = ROTATE_LEFT(t, s) + b
  243. /* Do the following 16 operations. */
  244. SET(a, b, c, d, 1, 5, T17);
  245. SET(d, a, b, c, 6, 9, T18);
  246. SET(c, d, a, b, 11, 14, T19);
  247. SET(b, c, d, a, 0, 20, T20);
  248. SET(a, b, c, d, 5, 5, T21);
  249. SET(d, a, b, c, 10, 9, T22);
  250. SET(c, d, a, b, 15, 14, T23);
  251. SET(b, c, d, a, 4, 20, T24);
  252. SET(a, b, c, d, 9, 5, T25);
  253. SET(d, a, b, c, 14, 9, T26);
  254. SET(c, d, a, b, 3, 14, T27);
  255. SET(b, c, d, a, 8, 20, T28);
  256. SET(a, b, c, d, 13, 5, T29);
  257. SET(d, a, b, c, 2, 9, T30);
  258. SET(c, d, a, b, 7, 14, T31);
  259. SET(b, c, d, a, 12, 20, T32);
  260. #undef SET
  261. /* Round 3. */
  262. /* Let [abcd k s t] denote the operation
  263. a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
  264. #define H(x, y, z) ((x) ^ (y) ^ (z))
  265. #define SET(a, b, c, d, k, s, Ti)\
  266. t = a + H(b,c,d) + X[k] + Ti;\
  267. a = ROTATE_LEFT(t, s) + b
  268. /* Do the following 16 operations. */
  269. SET(a, b, c, d, 5, 4, T33);
  270. SET(d, a, b, c, 8, 11, T34);
  271. SET(c, d, a, b, 11, 16, T35);
  272. SET(b, c, d, a, 14, 23, T36);
  273. SET(a, b, c, d, 1, 4, T37);
  274. SET(d, a, b, c, 4, 11, T38);
  275. SET(c, d, a, b, 7, 16, T39);
  276. SET(b, c, d, a, 10, 23, T40);
  277. SET(a, b, c, d, 13, 4, T41);
  278. SET(d, a, b, c, 0, 11, T42);
  279. SET(c, d, a, b, 3, 16, T43);
  280. SET(b, c, d, a, 6, 23, T44);
  281. SET(a, b, c, d, 9, 4, T45);
  282. SET(d, a, b, c, 12, 11, T46);
  283. SET(c, d, a, b, 15, 16, T47);
  284. SET(b, c, d, a, 2, 23, T48);
  285. #undef SET
  286. /* Round 4. */
  287. /* Let [abcd k s t] denote the operation
  288. a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
  289. #define I(x, y, z) ((y) ^ ((x) | ~(z)))
  290. #define SET(a, b, c, d, k, s, Ti)\
  291. t = a + I(b,c,d) + X[k] + Ti;\
  292. a = ROTATE_LEFT(t, s) + b
  293. /* Do the following 16 operations. */
  294. SET(a, b, c, d, 0, 6, T49);
  295. SET(d, a, b, c, 7, 10, T50);
  296. SET(c, d, a, b, 14, 15, T51);
  297. SET(b, c, d, a, 5, 21, T52);
  298. SET(a, b, c, d, 12, 6, T53);
  299. SET(d, a, b, c, 3, 10, T54);
  300. SET(c, d, a, b, 10, 15, T55);
  301. SET(b, c, d, a, 1, 21, T56);
  302. SET(a, b, c, d, 8, 6, T57);
  303. SET(d, a, b, c, 15, 10, T58);
  304. SET(c, d, a, b, 6, 15, T59);
  305. SET(b, c, d, a, 13, 21, T60);
  306. SET(a, b, c, d, 4, 6, T61);
  307. SET(d, a, b, c, 11, 10, T62);
  308. SET(c, d, a, b, 2, 15, T63);
  309. SET(b, c, d, a, 9, 21, T64);
  310. #undef SET
  311. /* Then perform the following additions. (That is increment each
  312. of the four registers by the value it had before this block
  313. was started.) */
  314. pms->state[0] += a;
  315. pms->state[1] += b;
  316. pms->state[2] += c;
  317. pms->state[3] += d;
  318. }
  319. void
  320. MD5_Init(MD5_CTX *pms)
  321. {
  322. pms->count[0] = pms->count[1] = 0;
  323. pms->state[0] = 0x67452301;
  324. pms->state[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
  325. pms->state[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
  326. pms->state[3] = 0x10325476;
  327. }
  328. void
  329. MD5_Update(MD5_CTX *pms, const uint8_t *data, size_t nbytes)
  330. {
  331. const uint8_t *p = data;
  332. size_t left = nbytes;
  333. size_t offset = (pms->count[0] >> 3) & 63;
  334. uint32_t nbits = (uint32_t)(nbytes << 3);
  335. if (nbytes <= 0)
  336. return;
  337. /* Update the message length. */
  338. pms->count[1] += nbytes >> 29;
  339. pms->count[0] += nbits;
  340. if (pms->count[0] < nbits)
  341. pms->count[1]++;
  342. /* Process an initial partial block. */
  343. if (offset) {
  344. size_t copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
  345. memcpy(pms->buffer + offset, p, copy);
  346. if (offset + copy < 64)
  347. return;
  348. p += copy;
  349. left -= copy;
  350. md5_process(pms, pms->buffer);
  351. }
  352. /* Process full blocks. */
  353. for (; left >= 64; p += 64, left -= 64)
  354. md5_process(pms, p);
  355. /* Process a final partial block. */
  356. if (left)
  357. memcpy(pms->buffer, p, left);
  358. }
  359. void
  360. MD5_Finish(MD5_CTX *pms, uint8_t *digest)
  361. {
  362. static const uint8_t pad[64] = {
  363. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  364. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  365. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  366. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  367. };
  368. uint8_t data[8];
  369. size_t i;
  370. /* Save the length before padding. */
  371. for (i = 0; i < 8; ++i)
  372. data[i] = (uint8_t)(pms->count[i >> 2] >> ((i & 3) << 3));
  373. /* Pad to 56 bytes mod 64. */
  374. MD5_Update(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
  375. /* Append the length. */
  376. MD5_Update(pms, data, 8);
  377. for (i = 0; i < 16; ++i)
  378. digest[i] = (uint8_t)(pms->state[i >> 2] >> ((i & 3) << 3));
  379. }