md5.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272
  1. /*
  2. **********************************************************************
  3. ** md5.c **
  4. ** RSA Data Security, Inc. MD5 Message Digest Algorithm **
  5. ** Created: 2/17/90 RLR **
  6. ** Revised: 1/91 SRD,AJ,BSK,JT Reference C Version **
  7. **********************************************************************
  8. */
  9. /*
  10. **********************************************************************
  11. ** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
  12. ** **
  13. ** License to copy and use this software is granted provided that **
  14. ** it is identified as the "RSA Data Security, Inc. MD5 Message **
  15. ** Digest Algorithm" in all material mentioning or referencing this **
  16. ** software or this function. **
  17. ** **
  18. ** License is also granted to make and use derivative works **
  19. ** provided that such works are identified as "derived from the RSA **
  20. ** Data Security, Inc. MD5 Message Digest Algorithm" in all **
  21. ** material mentioning or referencing the derived work. **
  22. ** **
  23. ** RSA Data Security, Inc. makes no representations concerning **
  24. ** either the merchantability of this software or the suitability **
  25. ** of this software for any particular purpose. It is provided "as **
  26. ** is" without express or implied warranty of any kind. **
  27. ** **
  28. ** These notices must be retained in any copies of any part of this **
  29. ** documentation and/or software. **
  30. **********************************************************************
  31. */
  32. #include <shim_internal.h>
  33. #include <shim_utils.h>
  34. /* forward declaration */
  35. static void __transform(UINT4* buf, UINT4* in);
  36. static unsigned char PADDING[64] = {
  37. 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  38. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  39. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  40. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  41. /* F, G and H are basic MD5 functions: selection, majority, parity */
  42. #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
  43. #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
  44. #define H(x, y, z) ((x) ^ (y) ^ (z))
  45. #define I(x, y, z) ((y) ^ ((x) | (~z)))
  46. /* ROTATE_LEFT rotates x left n bits */
  47. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
  48. /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
  49. /* Rotation is separate from addition to prevent recomputation */
  50. #define FF(a, b, c, d, x, s, ac) \
  51. { \
  52. (a) += F((b), (c), (d)) + (x) + (UINT4)(ac); \
  53. (a) = ROTATE_LEFT((a), (s)); \
  54. (a) += (b); \
  55. }
  56. #define GG(a, b, c, d, x, s, ac) \
  57. { \
  58. (a) += G((b), (c), (d)) + (x) + (UINT4)(ac); \
  59. (a) = ROTATE_LEFT((a), (s)); \
  60. (a) += (b); \
  61. }
  62. #define HH(a, b, c, d, x, s, ac) \
  63. { \
  64. (a) += H((b), (c), (d)) + (x) + (UINT4)(ac); \
  65. (a) = ROTATE_LEFT((a), (s)); \
  66. (a) += (b); \
  67. }
  68. #define II(a, b, c, d, x, s, ac) \
  69. { \
  70. (a) += I((b), (c), (d)) + (x) + (UINT4)(ac); \
  71. (a) = ROTATE_LEFT((a), (s)); \
  72. (a) += (b); \
  73. }
  74. void md5_init(mdContext)
  75. struct shim_md5_ctx* mdContext;
  76. {
  77. mdContext->i[0] = mdContext->i[1] = (UINT4)0;
  78. /* Load magic initialization constants.
  79. */
  80. mdContext->buf[0] = (UINT4)0x67452301;
  81. mdContext->buf[1] = (UINT4)0xefcdab89;
  82. mdContext->buf[2] = (UINT4)0x98badcfe;
  83. mdContext->buf[3] = (UINT4)0x10325476;
  84. }
  85. EXTERN_ALIAS(md5_init);
  86. void md5_update(mdContext, inBuf, inLen)
  87. struct shim_md5_ctx* mdContext;
  88. const void* inBuf;
  89. size_t inLen;
  90. {
  91. UINT4 in[16];
  92. int mdi;
  93. unsigned int i, ii;
  94. /* compute number of bytes mod 64 */
  95. mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
  96. /* update number of bits */
  97. if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])
  98. mdContext->i[1]++;
  99. mdContext->i[0] += ((UINT4)inLen << 3);
  100. mdContext->i[1] += ((UINT4)inLen >> 29);
  101. while (inLen--) {
  102. /* add new character to buffer, increment mdi */
  103. mdContext->in[mdi++] = *(unsigned char*)inBuf++;
  104. /* transform if necessary */
  105. if (mdi == 0x40) {
  106. for (i = 0, ii = 0; i < 16; i++, ii += 4)
  107. in[i] = (((UINT4)mdContext->in[ii + 3]) << 24) |
  108. (((UINT4)mdContext->in[ii + 2]) << 16) |
  109. (((UINT4)mdContext->in[ii + 1]) << 8) | ((UINT4)mdContext->in[ii]);
  110. __transform(mdContext->buf, in);
  111. mdi = 0;
  112. }
  113. }
  114. }
  115. EXTERN_ALIAS(md5_update);
  116. void md5_final(mdContext)
  117. struct shim_md5_ctx* mdContext;
  118. {
  119. UINT4 in[16];
  120. int mdi;
  121. unsigned int i, ii;
  122. unsigned int padLen;
  123. /* save number of bits */
  124. in[14] = mdContext->i[0];
  125. in[15] = mdContext->i[1];
  126. /* compute number of bytes mod 64 */
  127. mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
  128. /* pad out to 56 mod 64 */
  129. padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
  130. md5_update(mdContext, PADDING, padLen);
  131. /* append length in bits and transform */
  132. for (i = 0, ii = 0; i < 14; i++, ii += 4)
  133. in[i] = (((UINT4)mdContext->in[ii + 3]) << 24) | (((UINT4)mdContext->in[ii + 2]) << 16) |
  134. (((UINT4)mdContext->in[ii + 1]) << 8) | ((UINT4)mdContext->in[ii]);
  135. __transform(mdContext->buf, in);
  136. /* store buffer in digest */
  137. for (i = 0, ii = 0; i < 4; i++, ii += 4) {
  138. mdContext->digest[ii] = (unsigned char)(mdContext->buf[i] & 0xFF);
  139. mdContext->digest[ii + 1] = (unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
  140. mdContext->digest[ii + 2] = (unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
  141. mdContext->digest[ii + 3] = (unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
  142. }
  143. }
  144. /* Basic MD5 step. Transform buf based on in.
  145. */
  146. static void __transform(buf, in)
  147. UINT4* buf;
  148. UINT4* in;
  149. {
  150. UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
  151. /* Round 1 */
  152. #define S11 7
  153. #define S12 12
  154. #define S13 17
  155. #define S14 22
  156. FF(a, b, c, d, in[0], S11, 3614090360); /* 1 */
  157. FF(d, a, b, c, in[1], S12, 3905402710); /* 2 */
  158. FF(c, d, a, b, in[2], S13, 606105819); /* 3 */
  159. FF(b, c, d, a, in[3], S14, 3250441966); /* 4 */
  160. FF(a, b, c, d, in[4], S11, 4118548399); /* 5 */
  161. FF(d, a, b, c, in[5], S12, 1200080426); /* 6 */
  162. FF(c, d, a, b, in[6], S13, 2821735955); /* 7 */
  163. FF(b, c, d, a, in[7], S14, 4249261313); /* 8 */
  164. FF(a, b, c, d, in[8], S11, 1770035416); /* 9 */
  165. FF(d, a, b, c, in[9], S12, 2336552879); /* 10 */
  166. FF(c, d, a, b, in[10], S13, 4294925233); /* 11 */
  167. FF(b, c, d, a, in[11], S14, 2304563134); /* 12 */
  168. FF(a, b, c, d, in[12], S11, 1804603682); /* 13 */
  169. FF(d, a, b, c, in[13], S12, 4254626195); /* 14 */
  170. FF(c, d, a, b, in[14], S13, 2792965006); /* 15 */
  171. FF(b, c, d, a, in[15], S14, 1236535329); /* 16 */
  172. /* Round 2 */
  173. #define S21 5
  174. #define S22 9
  175. #define S23 14
  176. #define S24 20
  177. GG(a, b, c, d, in[1], S21, 4129170786); /* 17 */
  178. GG(d, a, b, c, in[6], S22, 3225465664); /* 18 */
  179. GG(c, d, a, b, in[11], S23, 643717713); /* 19 */
  180. GG(b, c, d, a, in[0], S24, 3921069994); /* 20 */
  181. GG(a, b, c, d, in[5], S21, 3593408605); /* 21 */
  182. GG(d, a, b, c, in[10], S22, 38016083); /* 22 */
  183. GG(c, d, a, b, in[15], S23, 3634488961); /* 23 */
  184. GG(b, c, d, a, in[4], S24, 3889429448); /* 24 */
  185. GG(a, b, c, d, in[9], S21, 568446438); /* 25 */
  186. GG(d, a, b, c, in[14], S22, 3275163606); /* 26 */
  187. GG(c, d, a, b, in[3], S23, 4107603335); /* 27 */
  188. GG(b, c, d, a, in[8], S24, 1163531501); /* 28 */
  189. GG(a, b, c, d, in[13], S21, 2850285829); /* 29 */
  190. GG(d, a, b, c, in[2], S22, 4243563512); /* 30 */
  191. GG(c, d, a, b, in[7], S23, 1735328473); /* 31 */
  192. GG(b, c, d, a, in[12], S24, 2368359562); /* 32 */
  193. /* Round 3 */
  194. #define S31 4
  195. #define S32 11
  196. #define S33 16
  197. #define S34 23
  198. HH(a, b, c, d, in[5], S31, 4294588738); /* 33 */
  199. HH(d, a, b, c, in[8], S32, 2272392833); /* 34 */
  200. HH(c, d, a, b, in[11], S33, 1839030562); /* 35 */
  201. HH(b, c, d, a, in[14], S34, 4259657740); /* 36 */
  202. HH(a, b, c, d, in[1], S31, 2763975236); /* 37 */
  203. HH(d, a, b, c, in[4], S32, 1272893353); /* 38 */
  204. HH(c, d, a, b, in[7], S33, 4139469664); /* 39 */
  205. HH(b, c, d, a, in[10], S34, 3200236656); /* 40 */
  206. HH(a, b, c, d, in[13], S31, 681279174); /* 41 */
  207. HH(d, a, b, c, in[0], S32, 3936430074); /* 42 */
  208. HH(c, d, a, b, in[3], S33, 3572445317); /* 43 */
  209. HH(b, c, d, a, in[6], S34, 76029189); /* 44 */
  210. HH(a, b, c, d, in[9], S31, 3654602809); /* 45 */
  211. HH(d, a, b, c, in[12], S32, 3873151461); /* 46 */
  212. HH(c, d, a, b, in[15], S33, 530742520); /* 47 */
  213. HH(b, c, d, a, in[2], S34, 3299628645); /* 48 */
  214. /* Round 4 */
  215. #define S41 6
  216. #define S42 10
  217. #define S43 15
  218. #define S44 21
  219. II(a, b, c, d, in[0], S41, 4096336452); /* 49 */
  220. II(d, a, b, c, in[7], S42, 1126891415); /* 50 */
  221. II(c, d, a, b, in[14], S43, 2878612391); /* 51 */
  222. II(b, c, d, a, in[5], S44, 4237533241); /* 52 */
  223. II(a, b, c, d, in[12], S41, 1700485571); /* 53 */
  224. II(d, a, b, c, in[3], S42, 2399980690); /* 54 */
  225. II(c, d, a, b, in[10], S43, 4293915773); /* 55 */
  226. II(b, c, d, a, in[1], S44, 2240044497); /* 56 */
  227. II(a, b, c, d, in[8], S41, 1873313359); /* 57 */
  228. II(d, a, b, c, in[15], S42, 4264355552); /* 58 */
  229. II(c, d, a, b, in[6], S43, 2734768916); /* 59 */
  230. II(b, c, d, a, in[13], S44, 1309151649); /* 60 */
  231. II(a, b, c, d, in[4], S41, 4149444226); /* 61 */
  232. II(d, a, b, c, in[11], S42, 3174756917); /* 62 */
  233. II(c, d, a, b, in[2], S43, 718787259); /* 63 */
  234. II(b, c, d, a, in[9], S44, 3951481745); /* 64 */
  235. buf[0] += a;
  236. buf[1] += b;
  237. buf[2] += c;
  238. buf[3] += d;
  239. }
  240. EXTERN_ALIAS(md5_final);
  241. /*
  242. **********************************************************************
  243. ** End of md5.c **
  244. ******************************* (cut) ********************************
  245. */