md5.c 11 KB

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