md5.cpp 9.9 KB

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