md4.c 14 KB

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