md5.c 10 KB

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