md5.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654
  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. #ifndef CURL_DISABLE_CRYPTO_AUTH
  26. #include <string.h>
  27. #include <curl/curl.h>
  28. #include "curl_md5.h"
  29. #include "curl_hmac.h"
  30. #include "warnless.h"
  31. #ifdef USE_MBEDTLS
  32. #include <mbedtls/version.h>
  33. #if(MBEDTLS_VERSION_NUMBER >= 0x02070000) && \
  34. (MBEDTLS_VERSION_NUMBER < 0x03000000)
  35. #define HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS
  36. #endif
  37. #endif /* USE_MBEDTLS */
  38. #ifdef USE_OPENSSL
  39. #include <openssl/opensslconf.h>
  40. #if !defined(OPENSSL_NO_MD5) && !defined(OPENSSL_NO_DEPRECATED_3_0)
  41. #define USE_OPENSSL_MD5
  42. #endif
  43. #endif
  44. #ifdef USE_WOLFSSL
  45. #include <wolfssl/options.h>
  46. #ifndef NO_MD5
  47. #define USE_WOLFSSL_MD5
  48. #endif
  49. #endif
  50. #if defined(USE_GNUTLS)
  51. #include <nettle/md5.h>
  52. #elif defined(USE_OPENSSL_MD5)
  53. #include <openssl/md5.h>
  54. #elif defined(USE_WOLFSSL_MD5)
  55. #include <wolfssl/openssl/md5.h>
  56. #elif defined(USE_MBEDTLS)
  57. #include <mbedtls/md5.h>
  58. #elif (defined(__MAC_OS_X_VERSION_MAX_ALLOWED) && \
  59. (__MAC_OS_X_VERSION_MAX_ALLOWED >= 1040) && \
  60. defined(__MAC_OS_X_VERSION_MIN_REQUIRED) && \
  61. (__MAC_OS_X_VERSION_MIN_REQUIRED < 101500)) || \
  62. (defined(__IPHONE_OS_VERSION_MAX_ALLOWED) && \
  63. (__IPHONE_OS_VERSION_MAX_ALLOWED >= 20000) && \
  64. defined(__IPHONE_OS_VERSION_MIN_REQUIRED) && \
  65. (__IPHONE_OS_VERSION_MIN_REQUIRED < 130000))
  66. #define AN_APPLE_OS
  67. #include <CommonCrypto/CommonDigest.h>
  68. #elif defined(USE_WIN32_CRYPTO)
  69. #include <wincrypt.h>
  70. #endif
  71. /* The last 3 #include files should be in this order */
  72. #include "curl_printf.h"
  73. #include "curl_memory.h"
  74. #include "memdebug.h"
  75. #if defined(USE_GNUTLS)
  76. typedef struct md5_ctx my_md5_ctx;
  77. static CURLcode my_md5_init(my_md5_ctx *ctx)
  78. {
  79. md5_init(ctx);
  80. return CURLE_OK;
  81. }
  82. static void my_md5_update(my_md5_ctx *ctx,
  83. const unsigned char *input,
  84. unsigned int inputLen)
  85. {
  86. md5_update(ctx, inputLen, input);
  87. }
  88. static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
  89. {
  90. md5_digest(ctx, 16, digest);
  91. }
  92. #elif defined(USE_OPENSSL_MD5) || defined(USE_WOLFSSL_MD5)
  93. typedef MD5_CTX my_md5_ctx;
  94. static CURLcode my_md5_init(my_md5_ctx *ctx)
  95. {
  96. if(!MD5_Init(ctx))
  97. return CURLE_OUT_OF_MEMORY;
  98. return CURLE_OK;
  99. }
  100. static void my_md5_update(my_md5_ctx *ctx,
  101. const unsigned char *input,
  102. unsigned int len)
  103. {
  104. (void)MD5_Update(ctx, input, len);
  105. }
  106. static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
  107. {
  108. (void)MD5_Final(digest, ctx);
  109. }
  110. #elif defined(USE_MBEDTLS)
  111. typedef mbedtls_md5_context my_md5_ctx;
  112. static CURLcode my_md5_init(my_md5_ctx *ctx)
  113. {
  114. #if (MBEDTLS_VERSION_NUMBER >= 0x03000000)
  115. if(mbedtls_md5_starts(ctx))
  116. return CURLE_OUT_OF_MEMORY;
  117. #elif defined(HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS)
  118. if(mbedtls_md5_starts_ret(ctx))
  119. return CURLE_OUT_OF_MEMORY;
  120. #else
  121. (void)mbedtls_md5_starts(ctx);
  122. #endif
  123. return CURLE_OK;
  124. }
  125. static void my_md5_update(my_md5_ctx *ctx,
  126. const unsigned char *data,
  127. unsigned int length)
  128. {
  129. #if !defined(HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS)
  130. (void) mbedtls_md5_update(ctx, data, length);
  131. #else
  132. (void) mbedtls_md5_update_ret(ctx, data, length);
  133. #endif
  134. }
  135. static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
  136. {
  137. #if !defined(HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS)
  138. (void) mbedtls_md5_finish(ctx, digest);
  139. #else
  140. (void) mbedtls_md5_finish_ret(ctx, digest);
  141. #endif
  142. }
  143. #elif defined(AN_APPLE_OS)
  144. /* For Apple operating systems: CommonCrypto has the functions we need.
  145. These functions are available on Tiger and later, as well as iOS 2.0
  146. and later. If you're building for an older cat, well, sorry.
  147. Declaring the functions as static like this seems to be a bit more
  148. reliable than defining COMMON_DIGEST_FOR_OPENSSL on older cats. */
  149. # define my_md5_ctx CC_MD5_CTX
  150. static CURLcode my_md5_init(my_md5_ctx *ctx)
  151. {
  152. if(!CC_MD5_Init(ctx))
  153. return CURLE_OUT_OF_MEMORY;
  154. return CURLE_OK;
  155. }
  156. static void my_md5_update(my_md5_ctx *ctx,
  157. const unsigned char *input,
  158. unsigned int inputLen)
  159. {
  160. CC_MD5_Update(ctx, input, inputLen);
  161. }
  162. static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
  163. {
  164. CC_MD5_Final(digest, ctx);
  165. }
  166. #elif defined(USE_WIN32_CRYPTO)
  167. struct md5_ctx {
  168. HCRYPTPROV hCryptProv;
  169. HCRYPTHASH hHash;
  170. };
  171. typedef struct md5_ctx my_md5_ctx;
  172. static CURLcode my_md5_init(my_md5_ctx *ctx)
  173. {
  174. if(!CryptAcquireContext(&ctx->hCryptProv, NULL, NULL, PROV_RSA_FULL,
  175. CRYPT_VERIFYCONTEXT | CRYPT_SILENT))
  176. return CURLE_OUT_OF_MEMORY;
  177. if(!CryptCreateHash(ctx->hCryptProv, CALG_MD5, 0, 0, &ctx->hHash)) {
  178. CryptReleaseContext(ctx->hCryptProv, 0);
  179. return CURLE_OUT_OF_MEMORY;
  180. }
  181. return CURLE_OK;
  182. }
  183. static void my_md5_update(my_md5_ctx *ctx,
  184. const unsigned char *input,
  185. unsigned int inputLen)
  186. {
  187. CryptHashData(ctx->hHash, (unsigned char *)input, inputLen, 0);
  188. }
  189. static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
  190. {
  191. unsigned long length = 0;
  192. CryptGetHashParam(ctx->hHash, HP_HASHVAL, NULL, &length, 0);
  193. if(length == 16)
  194. CryptGetHashParam(ctx->hHash, HP_HASHVAL, digest, &length, 0);
  195. if(ctx->hHash)
  196. CryptDestroyHash(ctx->hHash);
  197. if(ctx->hCryptProv)
  198. CryptReleaseContext(ctx->hCryptProv, 0);
  199. }
  200. #else
  201. /* When no other crypto library is available we use this code segment */
  202. /*
  203. * This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.
  204. * MD5 Message-Digest Algorithm (RFC 1321).
  205. *
  206. * Homepage:
  207. https://openwall.info/wiki/people/solar/software/public-domain-source-code/md5
  208. *
  209. * Author:
  210. * Alexander Peslyak, better known as Solar Designer <solar at openwall.com>
  211. *
  212. * This software was written by Alexander Peslyak in 2001. No copyright is
  213. * claimed, and the software is hereby placed in the public domain.
  214. * In case this attempt to disclaim copyright and place the software in the
  215. * public domain is deemed null and void, then the software is
  216. * Copyright (c) 2001 Alexander Peslyak and it is hereby released to the
  217. * general public under the following terms:
  218. *
  219. * Redistribution and use in source and binary forms, with or without
  220. * modification, are permitted.
  221. *
  222. * There's ABSOLUTELY NO WARRANTY, express or implied.
  223. *
  224. * (This is a heavily cut-down "BSD license".)
  225. *
  226. * This differs from Colin Plumb's older public domain implementation in that
  227. * no exactly 32-bit integer data type is required (any 32-bit or wider
  228. * unsigned integer data type will do), there's no compile-time endianness
  229. * configuration, and the function prototypes match OpenSSL's. No code from
  230. * Colin Plumb's implementation has been reused; this comment merely compares
  231. * the properties of the two independent implementations.
  232. *
  233. * The primary goals of this implementation are portability and ease of use.
  234. * It is meant to be fast, but not as fast as possible. Some known
  235. * optimizations are not included to reduce source code size and avoid
  236. * compile-time configuration.
  237. */
  238. /* Any 32-bit or wider unsigned integer data type will do */
  239. typedef unsigned int MD5_u32plus;
  240. struct md5_ctx {
  241. MD5_u32plus lo, hi;
  242. MD5_u32plus a, b, c, d;
  243. unsigned char buffer[64];
  244. MD5_u32plus block[16];
  245. };
  246. typedef struct md5_ctx my_md5_ctx;
  247. static CURLcode my_md5_init(my_md5_ctx *ctx);
  248. static void my_md5_update(my_md5_ctx *ctx, const void *data,
  249. unsigned long size);
  250. static void my_md5_final(unsigned char *result, my_md5_ctx *ctx);
  251. /*
  252. * The basic MD5 functions.
  253. *
  254. * F and G are optimized compared to their RFC 1321 definitions for
  255. * architectures that lack an AND-NOT instruction, just like in Colin Plumb's
  256. * implementation.
  257. */
  258. #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
  259. #define G(x, y, z) ((y) ^ ((z) & ((x) ^ (y))))
  260. #define H(x, y, z) (((x) ^ (y)) ^ (z))
  261. #define H2(x, y, z) ((x) ^ ((y) ^ (z)))
  262. #define I(x, y, z) ((y) ^ ((x) | ~(z)))
  263. /*
  264. * The MD5 transformation for all four rounds.
  265. */
  266. #define STEP(f, a, b, c, d, x, t, s) \
  267. (a) += f((b), (c), (d)) + (x) + (t); \
  268. (a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \
  269. (a) += (b);
  270. /*
  271. * SET reads 4 input bytes in little-endian byte order and stores them
  272. * in a properly aligned word in host byte order.
  273. *
  274. * The check for little-endian architectures that tolerate unaligned
  275. * memory accesses is just an optimization. Nothing will break if it
  276. * doesn't work.
  277. */
  278. #if defined(__i386__) || defined(__x86_64__) || defined(__vax__)
  279. #define SET(n) \
  280. (*(MD5_u32plus *)(void *)&ptr[(n) * 4])
  281. #define GET(n) \
  282. SET(n)
  283. #else
  284. #define SET(n) \
  285. (ctx->block[(n)] = \
  286. (MD5_u32plus)ptr[(n) * 4] | \
  287. ((MD5_u32plus)ptr[(n) * 4 + 1] << 8) | \
  288. ((MD5_u32plus)ptr[(n) * 4 + 2] << 16) | \
  289. ((MD5_u32plus)ptr[(n) * 4 + 3] << 24))
  290. #define GET(n) \
  291. (ctx->block[(n)])
  292. #endif
  293. /*
  294. * This processes one or more 64-byte data blocks, but does NOT update
  295. * the bit counters. There are no alignment requirements.
  296. */
  297. static const void *body(my_md5_ctx *ctx, const void *data, unsigned long size)
  298. {
  299. const unsigned char *ptr;
  300. MD5_u32plus a, b, c, d;
  301. ptr = (const unsigned char *)data;
  302. a = ctx->a;
  303. b = ctx->b;
  304. c = ctx->c;
  305. d = ctx->d;
  306. do {
  307. MD5_u32plus saved_a, saved_b, saved_c, saved_d;
  308. saved_a = a;
  309. saved_b = b;
  310. saved_c = c;
  311. saved_d = d;
  312. /* Round 1 */
  313. STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7)
  314. STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12)
  315. STEP(F, c, d, a, b, SET(2), 0x242070db, 17)
  316. STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22)
  317. STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7)
  318. STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12)
  319. STEP(F, c, d, a, b, SET(6), 0xa8304613, 17)
  320. STEP(F, b, c, d, a, SET(7), 0xfd469501, 22)
  321. STEP(F, a, b, c, d, SET(8), 0x698098d8, 7)
  322. STEP(F, d, a, b, c, SET(9), 0x8b44f7af, 12)
  323. STEP(F, c, d, a, b, SET(10), 0xffff5bb1, 17)
  324. STEP(F, b, c, d, a, SET(11), 0x895cd7be, 22)
  325. STEP(F, a, b, c, d, SET(12), 0x6b901122, 7)
  326. STEP(F, d, a, b, c, SET(13), 0xfd987193, 12)
  327. STEP(F, c, d, a, b, SET(14), 0xa679438e, 17)
  328. STEP(F, b, c, d, a, SET(15), 0x49b40821, 22)
  329. /* Round 2 */
  330. STEP(G, a, b, c, d, GET(1), 0xf61e2562, 5)
  331. STEP(G, d, a, b, c, GET(6), 0xc040b340, 9)
  332. STEP(G, c, d, a, b, GET(11), 0x265e5a51, 14)
  333. STEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20)
  334. STEP(G, a, b, c, d, GET(5), 0xd62f105d, 5)
  335. STEP(G, d, a, b, c, GET(10), 0x02441453, 9)
  336. STEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14)
  337. STEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20)
  338. STEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5)
  339. STEP(G, d, a, b, c, GET(14), 0xc33707d6, 9)
  340. STEP(G, c, d, a, b, GET(3), 0xf4d50d87, 14)
  341. STEP(G, b, c, d, a, GET(8), 0x455a14ed, 20)
  342. STEP(G, a, b, c, d, GET(13), 0xa9e3e905, 5)
  343. STEP(G, d, a, b, c, GET(2), 0xfcefa3f8, 9)
  344. STEP(G, c, d, a, b, GET(7), 0x676f02d9, 14)
  345. STEP(G, b, c, d, a, GET(12), 0x8d2a4c8a, 20)
  346. /* Round 3 */
  347. STEP(H, a, b, c, d, GET(5), 0xfffa3942, 4)
  348. STEP(H2, d, a, b, c, GET(8), 0x8771f681, 11)
  349. STEP(H, c, d, a, b, GET(11), 0x6d9d6122, 16)
  350. STEP(H2, b, c, d, a, GET(14), 0xfde5380c, 23)
  351. STEP(H, a, b, c, d, GET(1), 0xa4beea44, 4)
  352. STEP(H2, d, a, b, c, GET(4), 0x4bdecfa9, 11)
  353. STEP(H, c, d, a, b, GET(7), 0xf6bb4b60, 16)
  354. STEP(H2, b, c, d, a, GET(10), 0xbebfbc70, 23)
  355. STEP(H, a, b, c, d, GET(13), 0x289b7ec6, 4)
  356. STEP(H2, d, a, b, c, GET(0), 0xeaa127fa, 11)
  357. STEP(H, c, d, a, b, GET(3), 0xd4ef3085, 16)
  358. STEP(H2, b, c, d, a, GET(6), 0x04881d05, 23)
  359. STEP(H, a, b, c, d, GET(9), 0xd9d4d039, 4)
  360. STEP(H2, d, a, b, c, GET(12), 0xe6db99e5, 11)
  361. STEP(H, c, d, a, b, GET(15), 0x1fa27cf8, 16)
  362. STEP(H2, b, c, d, a, GET(2), 0xc4ac5665, 23)
  363. /* Round 4 */
  364. STEP(I, a, b, c, d, GET(0), 0xf4292244, 6)
  365. STEP(I, d, a, b, c, GET(7), 0x432aff97, 10)
  366. STEP(I, c, d, a, b, GET(14), 0xab9423a7, 15)
  367. STEP(I, b, c, d, a, GET(5), 0xfc93a039, 21)
  368. STEP(I, a, b, c, d, GET(12), 0x655b59c3, 6)
  369. STEP(I, d, a, b, c, GET(3), 0x8f0ccc92, 10)
  370. STEP(I, c, d, a, b, GET(10), 0xffeff47d, 15)
  371. STEP(I, b, c, d, a, GET(1), 0x85845dd1, 21)
  372. STEP(I, a, b, c, d, GET(8), 0x6fa87e4f, 6)
  373. STEP(I, d, a, b, c, GET(15), 0xfe2ce6e0, 10)
  374. STEP(I, c, d, a, b, GET(6), 0xa3014314, 15)
  375. STEP(I, b, c, d, a, GET(13), 0x4e0811a1, 21)
  376. STEP(I, a, b, c, d, GET(4), 0xf7537e82, 6)
  377. STEP(I, d, a, b, c, GET(11), 0xbd3af235, 10)
  378. STEP(I, c, d, a, b, GET(2), 0x2ad7d2bb, 15)
  379. STEP(I, b, c, d, a, GET(9), 0xeb86d391, 21)
  380. a += saved_a;
  381. b += saved_b;
  382. c += saved_c;
  383. d += saved_d;
  384. ptr += 64;
  385. } while(size -= 64);
  386. ctx->a = a;
  387. ctx->b = b;
  388. ctx->c = c;
  389. ctx->d = d;
  390. return ptr;
  391. }
  392. static CURLcode my_md5_init(my_md5_ctx *ctx)
  393. {
  394. ctx->a = 0x67452301;
  395. ctx->b = 0xefcdab89;
  396. ctx->c = 0x98badcfe;
  397. ctx->d = 0x10325476;
  398. ctx->lo = 0;
  399. ctx->hi = 0;
  400. return CURLE_OK;
  401. }
  402. static void my_md5_update(my_md5_ctx *ctx, const void *data,
  403. unsigned long size)
  404. {
  405. MD5_u32plus saved_lo;
  406. unsigned long used;
  407. saved_lo = ctx->lo;
  408. ctx->lo = (saved_lo + size) & 0x1fffffff;
  409. if(ctx->lo < saved_lo)
  410. ctx->hi++;
  411. ctx->hi += (MD5_u32plus)size >> 29;
  412. used = saved_lo & 0x3f;
  413. if(used) {
  414. unsigned long available = 64 - used;
  415. if(size < available) {
  416. memcpy(&ctx->buffer[used], data, size);
  417. return;
  418. }
  419. memcpy(&ctx->buffer[used], data, available);
  420. data = (const unsigned char *)data + available;
  421. size -= available;
  422. body(ctx, ctx->buffer, 64);
  423. }
  424. if(size >= 64) {
  425. data = body(ctx, data, size & ~(unsigned long)0x3f);
  426. size &= 0x3f;
  427. }
  428. memcpy(ctx->buffer, data, size);
  429. }
  430. static void my_md5_final(unsigned char *result, my_md5_ctx *ctx)
  431. {
  432. unsigned long used, available;
  433. used = ctx->lo & 0x3f;
  434. ctx->buffer[used++] = 0x80;
  435. available = 64 - used;
  436. if(available < 8) {
  437. memset(&ctx->buffer[used], 0, available);
  438. body(ctx, ctx->buffer, 64);
  439. used = 0;
  440. available = 64;
  441. }
  442. memset(&ctx->buffer[used], 0, available - 8);
  443. ctx->lo <<= 3;
  444. ctx->buffer[56] = curlx_ultouc((ctx->lo)&0xff);
  445. ctx->buffer[57] = curlx_ultouc((ctx->lo >> 8)&0xff);
  446. ctx->buffer[58] = curlx_ultouc((ctx->lo >> 16)&0xff);
  447. ctx->buffer[59] = curlx_ultouc(ctx->lo >> 24);
  448. ctx->buffer[60] = curlx_ultouc((ctx->hi)&0xff);
  449. ctx->buffer[61] = curlx_ultouc((ctx->hi >> 8)&0xff);
  450. ctx->buffer[62] = curlx_ultouc((ctx->hi >> 16)&0xff);
  451. ctx->buffer[63] = curlx_ultouc(ctx->hi >> 24);
  452. body(ctx, ctx->buffer, 64);
  453. result[0] = curlx_ultouc((ctx->a)&0xff);
  454. result[1] = curlx_ultouc((ctx->a >> 8)&0xff);
  455. result[2] = curlx_ultouc((ctx->a >> 16)&0xff);
  456. result[3] = curlx_ultouc(ctx->a >> 24);
  457. result[4] = curlx_ultouc((ctx->b)&0xff);
  458. result[5] = curlx_ultouc((ctx->b >> 8)&0xff);
  459. result[6] = curlx_ultouc((ctx->b >> 16)&0xff);
  460. result[7] = curlx_ultouc(ctx->b >> 24);
  461. result[8] = curlx_ultouc((ctx->c)&0xff);
  462. result[9] = curlx_ultouc((ctx->c >> 8)&0xff);
  463. result[10] = curlx_ultouc((ctx->c >> 16)&0xff);
  464. result[11] = curlx_ultouc(ctx->c >> 24);
  465. result[12] = curlx_ultouc((ctx->d)&0xff);
  466. result[13] = curlx_ultouc((ctx->d >> 8)&0xff);
  467. result[14] = curlx_ultouc((ctx->d >> 16)&0xff);
  468. result[15] = curlx_ultouc(ctx->d >> 24);
  469. memset(ctx, 0, sizeof(*ctx));
  470. }
  471. #endif /* CRYPTO LIBS */
  472. const struct HMAC_params Curl_HMAC_MD5[] = {
  473. {
  474. /* Hash initialization function. */
  475. CURLX_FUNCTION_CAST(HMAC_hinit_func, my_md5_init),
  476. /* Hash update function. */
  477. CURLX_FUNCTION_CAST(HMAC_hupdate_func, my_md5_update),
  478. /* Hash computation end function. */
  479. CURLX_FUNCTION_CAST(HMAC_hfinal_func, my_md5_final),
  480. /* Size of hash context structure. */
  481. sizeof(my_md5_ctx),
  482. /* Maximum key length. */
  483. 64,
  484. /* Result size. */
  485. 16
  486. }
  487. };
  488. const struct MD5_params Curl_DIGEST_MD5[] = {
  489. {
  490. /* Digest initialization function */
  491. CURLX_FUNCTION_CAST(Curl_MD5_init_func, my_md5_init),
  492. /* Digest update function */
  493. CURLX_FUNCTION_CAST(Curl_MD5_update_func, my_md5_update),
  494. /* Digest computation end function */
  495. CURLX_FUNCTION_CAST(Curl_MD5_final_func, my_md5_final),
  496. /* Size of digest context struct */
  497. sizeof(my_md5_ctx),
  498. /* Result size */
  499. 16
  500. }
  501. };
  502. /*
  503. * @unittest: 1601
  504. * Returns CURLE_OK on success.
  505. */
  506. CURLcode Curl_md5it(unsigned char *outbuffer, const unsigned char *input,
  507. const size_t len)
  508. {
  509. CURLcode result;
  510. my_md5_ctx ctx;
  511. result = my_md5_init(&ctx);
  512. if(!result) {
  513. my_md5_update(&ctx, input, curlx_uztoui(len));
  514. my_md5_final(outbuffer, &ctx);
  515. }
  516. return result;
  517. }
  518. struct MD5_context *Curl_MD5_init(const struct MD5_params *md5params)
  519. {
  520. struct MD5_context *ctxt;
  521. /* Create MD5 context */
  522. ctxt = malloc(sizeof(*ctxt));
  523. if(!ctxt)
  524. return ctxt;
  525. ctxt->md5_hashctx = malloc(md5params->md5_ctxtsize);
  526. if(!ctxt->md5_hashctx) {
  527. free(ctxt);
  528. return NULL;
  529. }
  530. ctxt->md5_hash = md5params;
  531. if((*md5params->md5_init_func)(ctxt->md5_hashctx)) {
  532. free(ctxt->md5_hashctx);
  533. free(ctxt);
  534. return NULL;
  535. }
  536. return ctxt;
  537. }
  538. CURLcode Curl_MD5_update(struct MD5_context *context,
  539. const unsigned char *data,
  540. unsigned int len)
  541. {
  542. (*context->md5_hash->md5_update_func)(context->md5_hashctx, data, len);
  543. return CURLE_OK;
  544. }
  545. CURLcode Curl_MD5_final(struct MD5_context *context, unsigned char *result)
  546. {
  547. (*context->md5_hash->md5_final_func)(result, context->md5_hashctx);
  548. free(context->md5_hashctx);
  549. free(context);
  550. return CURLE_OK;
  551. }
  552. #endif /* CURL_DISABLE_CRYPTO_AUTH */