2
0

md4.c 14 KB

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