md4.c 14 KB

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