md5.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340
  1. /*
  2. ** Command & Conquer Renegade(tm)
  3. ** Copyright 2025 Electronic Arts Inc.
  4. **
  5. ** This program is free software: you can redistribute it and/or modify
  6. ** it under the terms of the GNU General Public License as published by
  7. ** the Free Software Foundation, either version 3 of the License, or
  8. ** (at your option) any later version.
  9. **
  10. ** This program is distributed in the hope that it will be useful,
  11. ** but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. ** GNU General Public License for more details.
  14. **
  15. ** You should have received a copy of the GNU General Public License
  16. ** along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. /* MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
  19. */
  20. /* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
  21. rights reserved.
  22. License to copy and use this software is granted provided that it
  23. is identified as the "RSA Data Security, Inc. MD5 Message-Digest
  24. Algorithm" in all material mentioning or referencing this software
  25. or this function.
  26. License is also granted to make and use derivative works provided
  27. that such works are identified as "derived from the RSA Data
  28. Security, Inc. MD5 Message-Digest Algorithm" in all material
  29. mentioning or referencing the derived work.
  30. RSA Data Security, Inc. makes no representations concerning either
  31. the merchantability of this software or the suitability of this
  32. software for any particular purpose. It is provided "as is"
  33. without express or implied warranty of any kind.
  34. These notices must be retained in any copies of any part of this
  35. documentation and/or software.
  36. */
  37. #include "global.h"
  38. #include "md5.h"
  39. /* Constants for MD5Transform routine.
  40. */
  41. // 'function selected for automatic inlining'
  42. #pragma warning(disable : 4711)
  43. #define S11 7
  44. #define S12 12
  45. #define S13 17
  46. #define S14 22
  47. #define S21 5
  48. #define S22 9
  49. #define S23 14
  50. #define S24 20
  51. #define S31 4
  52. #define S32 11
  53. #define S33 16
  54. #define S34 23
  55. #define S41 6
  56. #define S42 10
  57. #define S43 15
  58. #define S44 21
  59. static void MD5Transform PROTO_LIST ((UINT4 [4], unsigned char [64]));
  60. static void Encode PROTO_LIST
  61. ((unsigned char *, UINT4 *, unsigned int));
  62. static void Decode PROTO_LIST
  63. ((UINT4 *, unsigned char *, unsigned int));
  64. static void MD5_memcpy PROTO_LIST ((POINTER, POINTER, unsigned int));
  65. static void MD5_memset PROTO_LIST ((POINTER, int, unsigned int));
  66. static unsigned char PADDING[64] = {
  67. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  68. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  69. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  70. };
  71. /* F, G, H and I are basic MD5 functions.
  72. */
  73. #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
  74. #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
  75. #define H(x, y, z) ((x) ^ (y) ^ (z))
  76. #define I(x, y, z) ((y) ^ ((x) | (~z)))
  77. /* ROTATE_LEFT rotates x left n bits.
  78. */
  79. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
  80. /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
  81. Rotation is separate from addition to prevent recomputation.
  82. */
  83. #define FF(a, b, c, d, x, s, ac) { \
  84. (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
  85. (a) = ROTATE_LEFT ((a), (s)); \
  86. (a) += (b); \
  87. }
  88. #define GG(a, b, c, d, x, s, ac) { \
  89. (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
  90. (a) = ROTATE_LEFT ((a), (s)); \
  91. (a) += (b); \
  92. }
  93. #define HH(a, b, c, d, x, s, ac) { \
  94. (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
  95. (a) = ROTATE_LEFT ((a), (s)); \
  96. (a) += (b); \
  97. }
  98. #define II(a, b, c, d, x, s, ac) { \
  99. (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
  100. (a) = ROTATE_LEFT ((a), (s)); \
  101. (a) += (b); \
  102. }
  103. /* MD5 initialization. Begins an MD5 operation, writing a new context.
  104. */
  105. void MD5Init (MD5_CTX *context)
  106. {
  107. context->count[0] = context->count[1] = 0;
  108. /* Load magic initialization constants.
  109. */
  110. context->state[0] = 0x67452301;
  111. context->state[1] = 0xefcdab89;
  112. context->state[2] = 0x98badcfe;
  113. context->state[3] = 0x10325476;
  114. }
  115. /* MD5 block update operation. Continues an MD5 message-digest
  116. operation, processing another message block, and updating the
  117. context.
  118. */
  119. void MD5Update (MD5_CTX *context, unsigned char *input, unsigned int inputLen)
  120. {
  121. unsigned int i, index, partLen;
  122. /* Compute number of bytes mod 64 */
  123. index = (unsigned int)((context->count[0] >> 3) & 0x3F);
  124. /* Update number of bits */
  125. if ((context->count[0] += ((UINT4)inputLen << 3))
  126. < ((UINT4)inputLen << 3))
  127. context->count[1]++;
  128. context->count[1] += ((UINT4)inputLen >> 29);
  129. partLen = 64 - index;
  130. /* Transform as many times as possible.
  131. */
  132. if (inputLen >= partLen) {
  133. MD5_memcpy
  134. ((POINTER)&context->buffer[index], (POINTER)input, partLen);
  135. MD5Transform (context->state, context->buffer);
  136. for (i = partLen; i + 63 < inputLen; i += 64)
  137. MD5Transform (context->state, &input[i]);
  138. index = 0;
  139. }
  140. else
  141. i = 0;
  142. /* Buffer remaining input */
  143. MD5_memcpy
  144. ((POINTER)&context->buffer[index], (POINTER)&input[i],
  145. inputLen-i);
  146. }
  147. /* MD5 finalization. Ends an MD5 message-digest operation, writing the
  148. the message digest and zeroizing the context.
  149. */
  150. void MD5Final (unsigned char digest[16], MD5_CTX *context)
  151. {
  152. unsigned char bits[8];
  153. unsigned int index, padLen;
  154. /* Save number of bits */
  155. Encode (bits, context->count, 8);
  156. /* Pad out to 56 mod 64.
  157. */
  158. index = (unsigned int)((context->count[0] >> 3) & 0x3f);
  159. padLen = (index < 56) ? (56 - index) : (120 - index);
  160. MD5Update (context, PADDING, padLen);
  161. /* Append length (before padding) */
  162. MD5Update (context, bits, 8);
  163. /* Store state in digest */
  164. Encode (digest, context->state, 16);
  165. /* Zeroize sensitive information.
  166. */
  167. MD5_memset ((POINTER)context, 0, sizeof (*context));
  168. }
  169. /* MD5 basic transformation. Transforms state based on block.
  170. */
  171. static void MD5Transform (UINT4 state[4], unsigned char block[64])
  172. {
  173. UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
  174. Decode (x, block, 64);
  175. /* Round 1 */
  176. FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
  177. FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
  178. FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
  179. FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
  180. FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
  181. FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
  182. FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
  183. FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
  184. FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
  185. FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
  186. FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
  187. FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
  188. FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
  189. FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
  190. FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
  191. FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
  192. /* Round 2 */
  193. GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
  194. GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
  195. GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
  196. GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
  197. GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
  198. GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
  199. GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
  200. GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
  201. GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
  202. GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
  203. GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
  204. GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
  205. GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
  206. GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
  207. GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
  208. GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
  209. /* Round 3 */
  210. HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
  211. HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
  212. HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
  213. HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
  214. HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
  215. HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
  216. HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
  217. HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
  218. HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
  219. HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
  220. HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
  221. HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
  222. HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
  223. HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
  224. HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
  225. HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
  226. /* Round 4 */
  227. II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
  228. II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
  229. II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
  230. II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
  231. II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
  232. II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
  233. II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
  234. II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
  235. II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
  236. II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
  237. II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
  238. II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
  239. II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
  240. II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
  241. II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
  242. II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
  243. state[0] += a;
  244. state[1] += b;
  245. state[2] += c;
  246. state[3] += d;
  247. /* Zeroize sensitive information.
  248. */
  249. MD5_memset ((POINTER)x, 0, sizeof (x));
  250. }
  251. /* Encodes input (UINT4) into output (unsigned char). Assumes len is
  252. a multiple of 4.
  253. */
  254. static void Encode (unsigned char *output, UINT4 *input, unsigned int len)
  255. {
  256. unsigned int i, j;
  257. for (i = 0, j = 0; j < len; i++, j += 4) {
  258. output[j] = (unsigned char)(input[i] & 0xff);
  259. output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
  260. output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
  261. output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
  262. }
  263. }
  264. /* Decodes input (unsigned char) into output (UINT4). Assumes len is
  265. a multiple of 4.
  266. */
  267. static void Decode (UINT4 *output, unsigned char *input, unsigned int len)
  268. {
  269. unsigned int i, j;
  270. for (i = 0, j = 0; j < len; i++, j += 4)
  271. output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
  272. (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
  273. }
  274. /* Note: Replace "for loop" with standard memcpy if possible.
  275. */
  276. static void MD5_memcpy (POINTER output, POINTER input, unsigned int len)
  277. {
  278. unsigned int i;
  279. for (i = 0; i < len; i++)
  280. output[i] = input[i];
  281. }
  282. /* Note: Replace "for loop" with standard memset if possible.
  283. */
  284. static void MD5_memset (POINTER output, int value, unsigned int len)
  285. {
  286. unsigned int i;
  287. for (i = 0; i < len; i++)
  288. ((char *)output)[i] = (char)value;
  289. }