md4.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506
  1. /***************************************************************************
  2. * _ _ ____ _
  3. * Project ___| | | | _ \| |
  4. * / __| | | | |_) | |
  5. * | (__| |_| | _ <| |___
  6. * \___|\___/|_| \_\_____|
  7. *
  8. * Copyright (C) 1998 - 2021, Daniel Stenberg, <[email protected]>, et al.
  9. *
  10. * This software is licensed as described in the file COPYING, which
  11. * you should have received as part of this distribution. The terms
  12. * are also available at https://curl.se/docs/copyright.html.
  13. *
  14. * You may opt to use, copy, modify, merge, publish, distribute and/or sell
  15. * copies of the Software, and permit persons to whom the Software is
  16. * furnished to do so, under the terms of the COPYING file.
  17. *
  18. * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
  19. * KIND, either express or implied.
  20. *
  21. ***************************************************************************/
  22. #include "curl_setup.h"
  23. #if !defined(CURL_DISABLE_CRYPTO_AUTH)
  24. #include "curl_md4.h"
  25. #include "warnless.h"
  26. #ifdef USE_OPENSSL
  27. #include <openssl/opensslconf.h>
  28. #if defined(OPENSSL_VERSION_MAJOR) && (OPENSSL_VERSION_MAJOR >= 3)
  29. /* OpenSSL 3.0.0 marks the MD4 functions as deprecated */
  30. #define OPENSSL_NO_MD4
  31. #endif
  32. #endif /* USE_OPENSSL */
  33. #ifdef USE_MBEDTLS
  34. #include <mbedtls/version.h>
  35. #if MBEDTLS_VERSION_NUMBER >= 0x03000000
  36. #include <mbedtls/mbedtls_config.h>
  37. #else
  38. #include <mbedtls/config.h>
  39. #endif
  40. #if(MBEDTLS_VERSION_NUMBER >= 0x02070000)
  41. #define HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS
  42. #endif
  43. #endif /* USE_MBEDTLS */
  44. #if defined(USE_GNUTLS)
  45. #include <nettle/md4.h>
  46. #include "curl_memory.h"
  47. /* The last #include file should be: */
  48. #include "memdebug.h"
  49. typedef struct md4_ctx MD4_CTX;
  50. static void MD4_Init(MD4_CTX *ctx)
  51. {
  52. md4_init(ctx);
  53. }
  54. static void MD4_Update(MD4_CTX *ctx, const void *data, unsigned long size)
  55. {
  56. md4_update(ctx, size, data);
  57. }
  58. static void MD4_Final(unsigned char *result, MD4_CTX *ctx)
  59. {
  60. md4_digest(ctx, MD4_DIGEST_SIZE, result);
  61. }
  62. #elif defined(USE_OPENSSL) && !defined(OPENSSL_NO_MD4)
  63. /* When OpenSSL is available we use the MD4-functions from OpenSSL */
  64. #include <openssl/md4.h>
  65. #elif (defined(__MAC_OS_X_VERSION_MAX_ALLOWED) && \
  66. (__MAC_OS_X_VERSION_MAX_ALLOWED >= 1040) && \
  67. defined(__MAC_OS_X_VERSION_MIN_ALLOWED) && \
  68. (__MAC_OS_X_VERSION_MIN_ALLOWED < 101500)) || \
  69. (defined(__IPHONE_OS_VERSION_MAX_ALLOWED) && \
  70. (__IPHONE_OS_VERSION_MAX_ALLOWED >= 20000))
  71. #include <CommonCrypto/CommonDigest.h>
  72. #include "curl_memory.h"
  73. /* The last #include file should be: */
  74. #include "memdebug.h"
  75. typedef CC_MD4_CTX MD4_CTX;
  76. static void MD4_Init(MD4_CTX *ctx)
  77. {
  78. (void)CC_MD4_Init(ctx);
  79. }
  80. static void MD4_Update(MD4_CTX *ctx, const void *data, unsigned long size)
  81. {
  82. (void)CC_MD4_Update(ctx, data, (CC_LONG)size);
  83. }
  84. static void MD4_Final(unsigned char *result, MD4_CTX *ctx)
  85. {
  86. (void)CC_MD4_Final(result, ctx);
  87. }
  88. #elif defined(USE_WIN32_CRYPTO)
  89. #include <wincrypt.h>
  90. #include "curl_memory.h"
  91. /* The last #include file should be: */
  92. #include "memdebug.h"
  93. struct md4_ctx {
  94. HCRYPTPROV hCryptProv;
  95. HCRYPTHASH hHash;
  96. };
  97. typedef struct md4_ctx MD4_CTX;
  98. static void MD4_Init(MD4_CTX *ctx)
  99. {
  100. ctx->hCryptProv = 0;
  101. ctx->hHash = 0;
  102. if(CryptAcquireContext(&ctx->hCryptProv, NULL, NULL, PROV_RSA_FULL,
  103. CRYPT_VERIFYCONTEXT | CRYPT_SILENT)) {
  104. CryptCreateHash(ctx->hCryptProv, CALG_MD4, 0, 0, &ctx->hHash);
  105. }
  106. }
  107. static void MD4_Update(MD4_CTX *ctx, const void *data, unsigned long size)
  108. {
  109. CryptHashData(ctx->hHash, (BYTE *)data, (unsigned int) size, 0);
  110. }
  111. static void MD4_Final(unsigned char *result, MD4_CTX *ctx)
  112. {
  113. unsigned long length = 0;
  114. CryptGetHashParam(ctx->hHash, HP_HASHVAL, NULL, &length, 0);
  115. if(length == MD4_DIGEST_LENGTH)
  116. CryptGetHashParam(ctx->hHash, HP_HASHVAL, result, &length, 0);
  117. if(ctx->hHash)
  118. CryptDestroyHash(ctx->hHash);
  119. if(ctx->hCryptProv)
  120. CryptReleaseContext(ctx->hCryptProv, 0);
  121. }
  122. #elif(defined(USE_MBEDTLS) && defined(MBEDTLS_MD4_C))
  123. #include <mbedtls/md4.h>
  124. #include "curl_memory.h"
  125. /* The last #include file should be: */
  126. #include "memdebug.h"
  127. struct md4_ctx {
  128. void *data;
  129. unsigned long size;
  130. };
  131. typedef struct md4_ctx MD4_CTX;
  132. static void MD4_Init(MD4_CTX *ctx)
  133. {
  134. ctx->data = NULL;
  135. ctx->size = 0;
  136. }
  137. static void MD4_Update(MD4_CTX *ctx, const void *data, unsigned long size)
  138. {
  139. if(!ctx->data) {
  140. ctx->data = malloc(size);
  141. if(ctx->data != NULL) {
  142. memcpy(ctx->data, data, size);
  143. ctx->size = size;
  144. }
  145. }
  146. }
  147. static void MD4_Final(unsigned char *result, MD4_CTX *ctx)
  148. {
  149. if(ctx->data != NULL) {
  150. #if !defined(HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS)
  151. mbedtls_md4(ctx->data, ctx->size, result);
  152. #else
  153. (void) mbedtls_md4_ret(ctx->data, ctx->size, result);
  154. #endif
  155. Curl_safefree(ctx->data);
  156. ctx->size = 0;
  157. }
  158. }
  159. #else
  160. /* When no other crypto library is available, or the crypto library doesn't
  161. * support MD4, we use this code segment this implementation of it
  162. *
  163. * This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.
  164. * MD4 Message-Digest Algorithm (RFC 1320).
  165. *
  166. * Homepage:
  167. https://openwall.info/wiki/people/solar/software/public-domain-source-code/md4
  168. *
  169. * Author:
  170. * Alexander Peslyak, better known as Solar Designer <solar at openwall.com>
  171. *
  172. * This software was written by Alexander Peslyak in 2001. No copyright is
  173. * claimed, and the software is hereby placed in the public domain. In case
  174. * this attempt to disclaim copyright and place the software in the public
  175. * domain is deemed null and void, then the software is Copyright (c) 2001
  176. * Alexander Peslyak and it is hereby released to the general public under the
  177. * following terms:
  178. *
  179. * Redistribution and use in source and binary forms, with or without
  180. * modification, are permitted.
  181. *
  182. * There's ABSOLUTELY NO WARRANTY, express or implied.
  183. *
  184. * (This is a heavily cut-down "BSD license".)
  185. *
  186. * This differs from Colin Plumb's older public domain implementation in that
  187. * no exactly 32-bit integer data type is required (any 32-bit or wider
  188. * unsigned integer data type will do), there's no compile-time endianness
  189. * configuration, and the function prototypes match OpenSSL's. No code from
  190. * Colin Plumb's implementation has been reused; this comment merely compares
  191. * the properties of the two independent implementations.
  192. *
  193. * The primary goals of this implementation are portability and ease of use.
  194. * It is meant to be fast, but not as fast as possible. Some known
  195. * optimizations are not included to reduce source code size and avoid
  196. * compile-time configuration.
  197. */
  198. #include <string.h>
  199. /* Any 32-bit or wider unsigned integer data type will do */
  200. typedef unsigned int MD4_u32plus;
  201. struct md4_ctx {
  202. MD4_u32plus lo, hi;
  203. MD4_u32plus a, b, c, d;
  204. unsigned char buffer[64];
  205. MD4_u32plus block[16];
  206. };
  207. typedef struct md4_ctx MD4_CTX;
  208. static void MD4_Init(MD4_CTX *ctx);
  209. static void MD4_Update(MD4_CTX *ctx, const void *data, unsigned long size);
  210. static void MD4_Final(unsigned char *result, MD4_CTX *ctx);
  211. /*
  212. * The basic MD4 functions.
  213. *
  214. * F and G are optimized compared to their RFC 1320 definitions, with the
  215. * optimization for F borrowed from Colin Plumb's MD5 implementation.
  216. */
  217. #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
  218. #define G(x, y, z) (((x) & ((y) | (z))) | ((y) & (z)))
  219. #define H(x, y, z) ((x) ^ (y) ^ (z))
  220. /*
  221. * The MD4 transformation for all three rounds.
  222. */
  223. #define STEP(f, a, b, c, d, x, s) \
  224. (a) += f((b), (c), (d)) + (x); \
  225. (a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s))));
  226. /*
  227. * SET reads 4 input bytes in little-endian byte order and stores them
  228. * in a properly aligned word in host byte order.
  229. *
  230. * The check for little-endian architectures that tolerate unaligned
  231. * memory accesses is just an optimization. Nothing will break if it
  232. * doesn't work.
  233. */
  234. #if defined(__i386__) || defined(__x86_64__) || defined(__vax__)
  235. #define SET(n) \
  236. (*(MD4_u32plus *)(void *)&ptr[(n) * 4])
  237. #define GET(n) \
  238. SET(n)
  239. #else
  240. #define SET(n) \
  241. (ctx->block[(n)] = \
  242. (MD4_u32plus)ptr[(n) * 4] | \
  243. ((MD4_u32plus)ptr[(n) * 4 + 1] << 8) | \
  244. ((MD4_u32plus)ptr[(n) * 4 + 2] << 16) | \
  245. ((MD4_u32plus)ptr[(n) * 4 + 3] << 24))
  246. #define GET(n) \
  247. (ctx->block[(n)])
  248. #endif
  249. /*
  250. * This processes one or more 64-byte data blocks, but does NOT update
  251. * the bit counters. There are no alignment requirements.
  252. */
  253. static const void *body(MD4_CTX *ctx, const void *data, unsigned long size)
  254. {
  255. const unsigned char *ptr;
  256. MD4_u32plus a, b, c, d;
  257. ptr = (const unsigned char *)data;
  258. a = ctx->a;
  259. b = ctx->b;
  260. c = ctx->c;
  261. d = ctx->d;
  262. do {
  263. MD4_u32plus saved_a, saved_b, saved_c, saved_d;
  264. saved_a = a;
  265. saved_b = b;
  266. saved_c = c;
  267. saved_d = d;
  268. /* Round 1 */
  269. STEP(F, a, b, c, d, SET(0), 3)
  270. STEP(F, d, a, b, c, SET(1), 7)
  271. STEP(F, c, d, a, b, SET(2), 11)
  272. STEP(F, b, c, d, a, SET(3), 19)
  273. STEP(F, a, b, c, d, SET(4), 3)
  274. STEP(F, d, a, b, c, SET(5), 7)
  275. STEP(F, c, d, a, b, SET(6), 11)
  276. STEP(F, b, c, d, a, SET(7), 19)
  277. STEP(F, a, b, c, d, SET(8), 3)
  278. STEP(F, d, a, b, c, SET(9), 7)
  279. STEP(F, c, d, a, b, SET(10), 11)
  280. STEP(F, b, c, d, a, SET(11), 19)
  281. STEP(F, a, b, c, d, SET(12), 3)
  282. STEP(F, d, a, b, c, SET(13), 7)
  283. STEP(F, c, d, a, b, SET(14), 11)
  284. STEP(F, b, c, d, a, SET(15), 19)
  285. /* Round 2 */
  286. STEP(G, a, b, c, d, GET(0) + 0x5a827999, 3)
  287. STEP(G, d, a, b, c, GET(4) + 0x5a827999, 5)
  288. STEP(G, c, d, a, b, GET(8) + 0x5a827999, 9)
  289. STEP(G, b, c, d, a, GET(12) + 0x5a827999, 13)
  290. STEP(G, a, b, c, d, GET(1) + 0x5a827999, 3)
  291. STEP(G, d, a, b, c, GET(5) + 0x5a827999, 5)
  292. STEP(G, c, d, a, b, GET(9) + 0x5a827999, 9)
  293. STEP(G, b, c, d, a, GET(13) + 0x5a827999, 13)
  294. STEP(G, a, b, c, d, GET(2) + 0x5a827999, 3)
  295. STEP(G, d, a, b, c, GET(6) + 0x5a827999, 5)
  296. STEP(G, c, d, a, b, GET(10) + 0x5a827999, 9)
  297. STEP(G, b, c, d, a, GET(14) + 0x5a827999, 13)
  298. STEP(G, a, b, c, d, GET(3) + 0x5a827999, 3)
  299. STEP(G, d, a, b, c, GET(7) + 0x5a827999, 5)
  300. STEP(G, c, d, a, b, GET(11) + 0x5a827999, 9)
  301. STEP(G, b, c, d, a, GET(15) + 0x5a827999, 13)
  302. /* Round 3 */
  303. STEP(H, a, b, c, d, GET(0) + 0x6ed9eba1, 3)
  304. STEP(H, d, a, b, c, GET(8) + 0x6ed9eba1, 9)
  305. STEP(H, c, d, a, b, GET(4) + 0x6ed9eba1, 11)
  306. STEP(H, b, c, d, a, GET(12) + 0x6ed9eba1, 15)
  307. STEP(H, a, b, c, d, GET(2) + 0x6ed9eba1, 3)
  308. STEP(H, d, a, b, c, GET(10) + 0x6ed9eba1, 9)
  309. STEP(H, c, d, a, b, GET(6) + 0x6ed9eba1, 11)
  310. STEP(H, b, c, d, a, GET(14) + 0x6ed9eba1, 15)
  311. STEP(H, a, b, c, d, GET(1) + 0x6ed9eba1, 3)
  312. STEP(H, d, a, b, c, GET(9) + 0x6ed9eba1, 9)
  313. STEP(H, c, d, a, b, GET(5) + 0x6ed9eba1, 11)
  314. STEP(H, b, c, d, a, GET(13) + 0x6ed9eba1, 15)
  315. STEP(H, a, b, c, d, GET(3) + 0x6ed9eba1, 3)
  316. STEP(H, d, a, b, c, GET(11) + 0x6ed9eba1, 9)
  317. STEP(H, c, d, a, b, GET(7) + 0x6ed9eba1, 11)
  318. STEP(H, b, c, d, a, GET(15) + 0x6ed9eba1, 15)
  319. a += saved_a;
  320. b += saved_b;
  321. c += saved_c;
  322. d += saved_d;
  323. ptr += 64;
  324. } while(size -= 64);
  325. ctx->a = a;
  326. ctx->b = b;
  327. ctx->c = c;
  328. ctx->d = d;
  329. return ptr;
  330. }
  331. static void MD4_Init(MD4_CTX *ctx)
  332. {
  333. ctx->a = 0x67452301;
  334. ctx->b = 0xefcdab89;
  335. ctx->c = 0x98badcfe;
  336. ctx->d = 0x10325476;
  337. ctx->lo = 0;
  338. ctx->hi = 0;
  339. }
  340. static void MD4_Update(MD4_CTX *ctx, const void *data, unsigned long size)
  341. {
  342. MD4_u32plus saved_lo;
  343. unsigned long used;
  344. saved_lo = ctx->lo;
  345. ctx->lo = (saved_lo + size) & 0x1fffffff;
  346. if(ctx->lo < saved_lo)
  347. ctx->hi++;
  348. ctx->hi += (MD4_u32plus)size >> 29;
  349. used = saved_lo & 0x3f;
  350. if(used) {
  351. unsigned long available = 64 - used;
  352. if(size < available) {
  353. memcpy(&ctx->buffer[used], data, size);
  354. return;
  355. }
  356. memcpy(&ctx->buffer[used], data, available);
  357. data = (const unsigned char *)data + available;
  358. size -= available;
  359. body(ctx, ctx->buffer, 64);
  360. }
  361. if(size >= 64) {
  362. data = body(ctx, data, size & ~(unsigned long)0x3f);
  363. size &= 0x3f;
  364. }
  365. memcpy(ctx->buffer, data, size);
  366. }
  367. static void MD4_Final(unsigned char *result, MD4_CTX *ctx)
  368. {
  369. unsigned long used, available;
  370. used = ctx->lo & 0x3f;
  371. ctx->buffer[used++] = 0x80;
  372. available = 64 - used;
  373. if(available < 8) {
  374. memset(&ctx->buffer[used], 0, available);
  375. body(ctx, ctx->buffer, 64);
  376. used = 0;
  377. available = 64;
  378. }
  379. memset(&ctx->buffer[used], 0, available - 8);
  380. ctx->lo <<= 3;
  381. ctx->buffer[56] = curlx_ultouc((ctx->lo)&0xff);
  382. ctx->buffer[57] = curlx_ultouc((ctx->lo >> 8)&0xff);
  383. ctx->buffer[58] = curlx_ultouc((ctx->lo >> 16)&0xff);
  384. ctx->buffer[59] = curlx_ultouc((ctx->lo >> 24)&0xff);
  385. ctx->buffer[60] = curlx_ultouc((ctx->hi)&0xff);
  386. ctx->buffer[61] = curlx_ultouc((ctx->hi >> 8)&0xff);
  387. ctx->buffer[62] = curlx_ultouc((ctx->hi >> 16)&0xff);
  388. ctx->buffer[63] = curlx_ultouc(ctx->hi >> 24);
  389. body(ctx, ctx->buffer, 64);
  390. result[0] = curlx_ultouc((ctx->a)&0xff);
  391. result[1] = curlx_ultouc((ctx->a >> 8)&0xff);
  392. result[2] = curlx_ultouc((ctx->a >> 16)&0xff);
  393. result[3] = curlx_ultouc(ctx->a >> 24);
  394. result[4] = curlx_ultouc((ctx->b)&0xff);
  395. result[5] = curlx_ultouc((ctx->b >> 8)&0xff);
  396. result[6] = curlx_ultouc((ctx->b >> 16)&0xff);
  397. result[7] = curlx_ultouc(ctx->b >> 24);
  398. result[8] = curlx_ultouc((ctx->c)&0xff);
  399. result[9] = curlx_ultouc((ctx->c >> 8)&0xff);
  400. result[10] = curlx_ultouc((ctx->c >> 16)&0xff);
  401. result[11] = curlx_ultouc(ctx->c >> 24);
  402. result[12] = curlx_ultouc((ctx->d)&0xff);
  403. result[13] = curlx_ultouc((ctx->d >> 8)&0xff);
  404. result[14] = curlx_ultouc((ctx->d >> 16)&0xff);
  405. result[15] = curlx_ultouc(ctx->d >> 24);
  406. memset(ctx, 0, sizeof(*ctx));
  407. }
  408. #endif /* CRYPTO LIBS */
  409. void Curl_md4it(unsigned char *output, const unsigned char *input,
  410. const size_t len)
  411. {
  412. MD4_CTX ctx;
  413. MD4_Init(&ctx);
  414. MD4_Update(&ctx, input, curlx_uztoui(len));
  415. MD4_Final(output, &ctx);
  416. }
  417. #endif /* CURL_DISABLE_CRYPTO_AUTH */