658 lines
19 KiB
C
Raw Normal View History

/***************************************************************************
2015-04-27 22:25:09 +02:00
* _ _ ____ _
* Project ___| | | | _ \| |
* / __| | | | |_) | |
* | (__| |_| | _ <| |___
* \___|\___/|_| \_\_____|
*
2023-07-02 19:51:09 +02:00
* Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
*
* This software is licensed as described in the file COPYING, which
* you should have received as part of this distribution. The terms
2021-09-14 00:13:48 +02:00
* are also available at https://curl.se/docs/copyright.html.
2015-04-27 22:25:09 +02:00
*
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
* copies of the Software, and permit persons to whom the Software is
* furnished to do so, under the terms of the COPYING file.
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
* KIND, either express or implied.
*
2022-11-16 20:14:03 +01:00
* SPDX-License-Identifier: curl
*
***************************************************************************/
2015-04-27 22:25:09 +02:00
#include "curl_setup.h"
2023-12-07 09:12:54 +01:00
#if (defined(USE_CURL_NTLM_CORE) && !defined(USE_WINDOWS_SSPI)) \
|| !defined(CURL_DISABLE_DIGEST_AUTH)
2023-05-23 16:38:00 +02:00
#include <string.h>
2016-09-11 17:22:32 +02:00
#include <curl/curl.h>
2015-04-27 22:25:09 +02:00
#include "curl_md5.h"
#include "curl_hmac.h"
#include "warnless.h"
2020-08-30 11:54:41 +02:00
#ifdef USE_MBEDTLS
#include <mbedtls/version.h>
2021-11-20 13:41:27 +01:00
#if(MBEDTLS_VERSION_NUMBER >= 0x02070000) && \
(MBEDTLS_VERSION_NUMBER < 0x03000000)
2020-08-30 11:54:41 +02:00
#define HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS
#endif
#endif /* USE_MBEDTLS */
2022-11-16 20:14:03 +01:00
#ifdef USE_OPENSSL
2022-03-29 21:10:50 +02:00
#include <openssl/opensslconf.h>
#if !defined(OPENSSL_NO_MD5) && !defined(OPENSSL_NO_DEPRECATED_3_0)
#define USE_OPENSSL_MD5
#endif
#endif
#ifdef USE_WOLFSSL
#include <wolfssl/options.h>
#ifndef NO_MD5
#define USE_WOLFSSL_MD5
#endif
#endif
2021-09-14 00:13:48 +02:00
#if defined(USE_GNUTLS)
2015-04-27 22:25:09 +02:00
#include <nettle/md5.h>
2023-05-23 16:38:00 +02:00
#elif defined(USE_OPENSSL_MD5)
#include <openssl/md5.h>
#elif defined(USE_WOLFSSL_MD5)
#include <wolfssl/openssl/md5.h>
#elif defined(USE_MBEDTLS)
#include <mbedtls/md5.h>
#elif (defined(__MAC_OS_X_VERSION_MAX_ALLOWED) && \
(__MAC_OS_X_VERSION_MAX_ALLOWED >= 1040) && \
2023-07-02 19:51:09 +02:00
defined(__MAC_OS_X_VERSION_MIN_REQUIRED) && \
(__MAC_OS_X_VERSION_MIN_REQUIRED < 101500)) || \
2023-05-23 16:38:00 +02:00
(defined(__IPHONE_OS_VERSION_MAX_ALLOWED) && \
2023-07-02 19:51:09 +02:00
(__IPHONE_OS_VERSION_MAX_ALLOWED >= 20000) && \
defined(__IPHONE_OS_VERSION_MIN_REQUIRED) && \
(__IPHONE_OS_VERSION_MIN_REQUIRED < 130000))
2023-05-23 16:38:00 +02:00
#define AN_APPLE_OS
#include <CommonCrypto/CommonDigest.h>
#elif defined(USE_WIN32_CRYPTO)
#include <wincrypt.h>
#endif
/* The last 3 #include files should be in this order */
#include "curl_printf.h"
2015-11-17 17:22:37 +01:00
#include "curl_memory.h"
2015-04-27 22:25:09 +02:00
#include "memdebug.h"
2023-05-23 16:38:00 +02:00
#if defined(USE_GNUTLS)
2022-08-04 22:12:04 +02:00
typedef struct md5_ctx my_md5_ctx;
2015-04-27 22:25:09 +02:00
2022-08-04 22:12:04 +02:00
static CURLcode my_md5_init(my_md5_ctx *ctx)
2015-04-27 22:25:09 +02:00
{
md5_init(ctx);
2022-03-29 21:10:50 +02:00
return CURLE_OK;
2015-04-27 22:25:09 +02:00
}
2022-08-04 22:12:04 +02:00
static void my_md5_update(my_md5_ctx *ctx,
const unsigned char *input,
unsigned int inputLen)
2015-04-27 22:25:09 +02:00
{
md5_update(ctx, inputLen, input);
}
2022-08-04 22:12:04 +02:00
static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
2015-04-27 22:25:09 +02:00
{
md5_digest(ctx, 16, digest);
}
2022-03-29 21:10:50 +02:00
#elif defined(USE_OPENSSL_MD5) || defined(USE_WOLFSSL_MD5)
2022-08-04 22:12:04 +02:00
typedef MD5_CTX my_md5_ctx;
static CURLcode my_md5_init(my_md5_ctx *ctx)
{
if(!MD5_Init(ctx))
return CURLE_OUT_OF_MEMORY;
return CURLE_OK;
}
static void my_md5_update(my_md5_ctx *ctx,
const unsigned char *input,
unsigned int len)
{
(void)MD5_Update(ctx, input, len);
}
static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
{
(void)MD5_Final(digest, ctx);
}
2020-08-30 11:54:41 +02:00
#elif defined(USE_MBEDTLS)
2022-08-04 22:12:04 +02:00
typedef mbedtls_md5_context my_md5_ctx;
2020-08-30 11:54:41 +02:00
2022-08-04 22:12:04 +02:00
static CURLcode my_md5_init(my_md5_ctx *ctx)
2020-08-30 11:54:41 +02:00
{
2022-08-04 22:12:04 +02:00
#if (MBEDTLS_VERSION_NUMBER >= 0x03000000)
if(mbedtls_md5_starts(ctx))
return CURLE_OUT_OF_MEMORY;
#elif defined(HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS)
if(mbedtls_md5_starts_ret(ctx))
return CURLE_OUT_OF_MEMORY;
2020-08-30 11:54:41 +02:00
#else
2022-08-04 22:12:04 +02:00
(void)mbedtls_md5_starts(ctx);
2020-08-30 11:54:41 +02:00
#endif
2022-03-29 21:10:50 +02:00
return CURLE_OK;
2020-08-30 11:54:41 +02:00
}
2022-08-04 22:12:04 +02:00
static void my_md5_update(my_md5_ctx *ctx,
const unsigned char *data,
unsigned int length)
2020-08-30 11:54:41 +02:00
{
#if !defined(HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS)
2021-11-20 13:41:27 +01:00
(void) mbedtls_md5_update(ctx, data, length);
2020-08-30 11:54:41 +02:00
#else
(void) mbedtls_md5_update_ret(ctx, data, length);
#endif
}
2022-08-04 22:12:04 +02:00
static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
2020-08-30 11:54:41 +02:00
{
#if !defined(HAS_MBEDTLS_RESULT_CODE_BASED_FUNCTIONS)
2021-11-20 13:41:27 +01:00
(void) mbedtls_md5_finish(ctx, digest);
2020-08-30 11:54:41 +02:00
#else
(void) mbedtls_md5_finish_ret(ctx, digest);
#endif
}
2023-05-23 16:38:00 +02:00
#elif defined(AN_APPLE_OS)
2015-04-27 22:25:09 +02:00
/* For Apple operating systems: CommonCrypto has the functions we need.
These functions are available on Tiger and later, as well as iOS 2.0
2024-11-11 15:18:55 +01:00
and later. If you are building for an older cat, well, sorry.
2015-04-27 22:25:09 +02:00
Declaring the functions as static like this seems to be a bit more
reliable than defining COMMON_DIGEST_FOR_OPENSSL on older cats. */
2022-08-04 22:12:04 +02:00
# define my_md5_ctx CC_MD5_CTX
2015-04-27 22:25:09 +02:00
2022-08-04 22:12:04 +02:00
static CURLcode my_md5_init(my_md5_ctx *ctx)
2015-04-27 22:25:09 +02:00
{
2022-08-04 22:12:04 +02:00
if(!CC_MD5_Init(ctx))
return CURLE_OUT_OF_MEMORY;
2022-03-29 21:10:50 +02:00
return CURLE_OK;
2015-04-27 22:25:09 +02:00
}
2022-08-04 22:12:04 +02:00
static void my_md5_update(my_md5_ctx *ctx,
const unsigned char *input,
unsigned int inputLen)
2015-04-27 22:25:09 +02:00
{
CC_MD5_Update(ctx, input, inputLen);
}
2022-08-04 22:12:04 +02:00
static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
2015-04-27 22:25:09 +02:00
{
CC_MD5_Final(digest, ctx);
}
2020-08-30 11:54:41 +02:00
#elif defined(USE_WIN32_CRYPTO)
2015-04-27 22:25:09 +02:00
2020-08-30 11:54:41 +02:00
struct md5_ctx {
2015-04-27 22:25:09 +02:00
HCRYPTPROV hCryptProv;
HCRYPTHASH hHash;
2020-08-30 11:54:41 +02:00
};
2022-08-04 22:12:04 +02:00
typedef struct md5_ctx my_md5_ctx;
2015-04-27 22:25:09 +02:00
2022-08-04 22:12:04 +02:00
static CURLcode my_md5_init(my_md5_ctx *ctx)
2015-04-27 22:25:09 +02:00
{
2022-08-04 22:12:04 +02:00
if(!CryptAcquireContext(&ctx->hCryptProv, NULL, NULL, PROV_RSA_FULL,
CRYPT_VERIFYCONTEXT | CRYPT_SILENT))
return CURLE_OUT_OF_MEMORY;
if(!CryptCreateHash(ctx->hCryptProv, CALG_MD5, 0, 0, &ctx->hHash)) {
CryptReleaseContext(ctx->hCryptProv, 0);
2023-12-07 09:12:54 +01:00
ctx->hCryptProv = 0;
return CURLE_FAILED_INIT;
2015-04-27 22:25:09 +02:00
}
2022-08-04 22:12:04 +02:00
2022-03-29 21:10:50 +02:00
return CURLE_OK;
2015-04-27 22:25:09 +02:00
}
2022-08-04 22:12:04 +02:00
static void my_md5_update(my_md5_ctx *ctx,
const unsigned char *input,
unsigned int inputLen)
2015-04-27 22:25:09 +02:00
{
CryptHashData(ctx->hHash, (unsigned char *)input, inputLen, 0);
}
2022-08-04 22:12:04 +02:00
static void my_md5_final(unsigned char *digest, my_md5_ctx *ctx)
2015-04-27 22:25:09 +02:00
{
unsigned long length = 0;
CryptGetHashParam(ctx->hHash, HP_HASHVAL, NULL, &length, 0);
if(length == 16)
CryptGetHashParam(ctx->hHash, HP_HASHVAL, digest, &length, 0);
if(ctx->hHash)
CryptDestroyHash(ctx->hHash);
if(ctx->hCryptProv)
CryptReleaseContext(ctx->hCryptProv, 0);
}
#else
2020-08-30 11:54:41 +02:00
2015-04-27 22:25:09 +02:00
/* When no other crypto library is available we use this code segment */
2020-08-30 11:54:41 +02:00
2015-11-17 17:22:37 +01:00
/*
* This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.
* MD5 Message-Digest Algorithm (RFC 1321).
*
* Homepage:
2018-11-29 20:27:00 +01:00
https://openwall.info/wiki/people/solar/software/public-domain-source-code/md5
2015-11-17 17:22:37 +01:00
*
* Author:
* Alexander Peslyak, better known as Solar Designer <solar at openwall.com>
*
2024-11-11 15:18:55 +01:00
* This software was written by Alexander Peslyak in 2001. No copyright is
2015-11-17 17:22:37 +01:00
* claimed, and the software is hereby placed in the public domain.
* In case this attempt to disclaim copyright and place the software in the
* public domain is deemed null and void, then the software is
* Copyright (c) 2001 Alexander Peslyak and it is hereby released to the
* general public under the following terms:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted.
*
2024-11-11 15:18:55 +01:00
* There is ABSOLUTELY NO WARRANTY, express or implied.
2015-11-17 17:22:37 +01:00
*
* (This is a heavily cut-down "BSD license".)
*
* This differs from Colin Plumb's older public domain implementation in that
* no exactly 32-bit integer data type is required (any 32-bit or wider
2024-11-11 15:18:55 +01:00
* unsigned integer data type will do), there is no compile-time endianness
* configuration, and the function prototypes match OpenSSL's. No code from
2015-11-17 17:22:37 +01:00
* Colin Plumb's implementation has been reused; this comment merely compares
* the properties of the two independent implementations.
*
* The primary goals of this implementation are portability and ease of use.
2024-11-11 15:18:55 +01:00
* It is meant to be fast, but not as fast as possible. Some known
2015-11-17 17:22:37 +01:00
* optimizations are not included to reduce source code size and avoid
* compile-time configuration.
*/
2015-11-17 17:22:37 +01:00
/* Any 32-bit or wider unsigned integer data type will do */
typedef unsigned int MD5_u32plus;
2020-08-30 11:54:41 +02:00
struct md5_ctx {
2015-11-17 17:22:37 +01:00
MD5_u32plus lo, hi;
MD5_u32plus a, b, c, d;
unsigned char buffer[64];
MD5_u32plus block[16];
2020-08-30 11:54:41 +02:00
};
2022-08-04 22:12:04 +02:00
typedef struct md5_ctx my_md5_ctx;
2022-08-04 22:12:04 +02:00
static CURLcode my_md5_init(my_md5_ctx *ctx);
static void my_md5_update(my_md5_ctx *ctx, const void *data,
unsigned long size);
static void my_md5_final(unsigned char *result, my_md5_ctx *ctx);
2015-11-17 17:22:37 +01:00
/*
* The basic MD5 functions.
*
* F and G are optimized compared to their RFC 1321 definitions for
* architectures that lack an AND-NOT instruction, just like in Colin Plumb's
* implementation.
*/
2024-11-11 15:18:55 +01:00
#define MD5_F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
#define MD5_G(x, y, z) ((y) ^ ((z) & ((x) ^ (y))))
#define MD5_H(x, y, z) (((x) ^ (y)) ^ (z))
#define MD5_H2(x, y, z) ((x) ^ ((y) ^ (z)))
#define MD5_I(x, y, z) ((y) ^ ((x) | ~(z)))
2015-11-17 17:22:37 +01:00
/*
* The MD5 transformation for all four rounds.
*/
2024-11-11 15:18:55 +01:00
#define MD5_STEP(f, a, b, c, d, x, t, s) \
2015-11-17 17:22:37 +01:00
(a) += f((b), (c), (d)) + (x) + (t); \
(a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \
(a) += (b);
/*
* SET reads 4 input bytes in little-endian byte order and stores them
* in a properly aligned word in host byte order.
*
* The check for little-endian architectures that tolerate unaligned
2024-11-11 15:18:55 +01:00
* memory accesses is just an optimization. Nothing will break if it
* does not work.
*/
2015-11-17 17:22:37 +01:00
#if defined(__i386__) || defined(__x86_64__) || defined(__vax__)
2024-11-11 15:18:55 +01:00
#define MD5_SET(n) \
2017-07-20 19:35:53 +02:00
(*(MD5_u32plus *)(void *)&ptr[(n) * 4])
2024-11-11 15:18:55 +01:00
#define MD5_GET(n) \
MD5_SET(n)
2015-11-17 17:22:37 +01:00
#else
2024-11-11 15:18:55 +01:00
#define MD5_SET(n) \
2015-11-17 17:22:37 +01:00
(ctx->block[(n)] = \
(MD5_u32plus)ptr[(n) * 4] | \
((MD5_u32plus)ptr[(n) * 4 + 1] << 8) | \
((MD5_u32plus)ptr[(n) * 4 + 2] << 16) | \
((MD5_u32plus)ptr[(n) * 4 + 3] << 24))
2024-11-11 15:18:55 +01:00
#define MD5_GET(n) \
2015-11-17 17:22:37 +01:00
(ctx->block[(n)])
#endif
/*
* This processes one or more 64-byte data blocks, but does NOT update
2024-11-11 15:18:55 +01:00
* the bit counters. There are no alignment requirements.
*/
2024-11-11 15:18:55 +01:00
static const void *my_md5_body(my_md5_ctx *ctx,
const void *data, unsigned long size)
{
2015-11-17 17:22:37 +01:00
const unsigned char *ptr;
MD5_u32plus a, b, c, d;
ptr = (const unsigned char *)data;
a = ctx->a;
b = ctx->b;
c = ctx->c;
d = ctx->d;
do {
2019-11-11 23:01:05 +01:00
MD5_u32plus saved_a, saved_b, saved_c, saved_d;
2015-11-17 17:22:37 +01:00
saved_a = a;
saved_b = b;
saved_c = c;
saved_d = d;
/* Round 1 */
2024-11-11 15:18:55 +01:00
MD5_STEP(MD5_F, a, b, c, d, MD5_SET(0), 0xd76aa478, 7)
MD5_STEP(MD5_F, d, a, b, c, MD5_SET(1), 0xe8c7b756, 12)
MD5_STEP(MD5_F, c, d, a, b, MD5_SET(2), 0x242070db, 17)
MD5_STEP(MD5_F, b, c, d, a, MD5_SET(3), 0xc1bdceee, 22)
MD5_STEP(MD5_F, a, b, c, d, MD5_SET(4), 0xf57c0faf, 7)
MD5_STEP(MD5_F, d, a, b, c, MD5_SET(5), 0x4787c62a, 12)
MD5_STEP(MD5_F, c, d, a, b, MD5_SET(6), 0xa8304613, 17)
MD5_STEP(MD5_F, b, c, d, a, MD5_SET(7), 0xfd469501, 22)
MD5_STEP(MD5_F, a, b, c, d, MD5_SET(8), 0x698098d8, 7)
MD5_STEP(MD5_F, d, a, b, c, MD5_SET(9), 0x8b44f7af, 12)
MD5_STEP(MD5_F, c, d, a, b, MD5_SET(10), 0xffff5bb1, 17)
MD5_STEP(MD5_F, b, c, d, a, MD5_SET(11), 0x895cd7be, 22)
MD5_STEP(MD5_F, a, b, c, d, MD5_SET(12), 0x6b901122, 7)
MD5_STEP(MD5_F, d, a, b, c, MD5_SET(13), 0xfd987193, 12)
MD5_STEP(MD5_F, c, d, a, b, MD5_SET(14), 0xa679438e, 17)
MD5_STEP(MD5_F, b, c, d, a, MD5_SET(15), 0x49b40821, 22)
2015-11-17 17:22:37 +01:00
/* Round 2 */
2024-11-11 15:18:55 +01:00
MD5_STEP(MD5_G, a, b, c, d, MD5_GET(1), 0xf61e2562, 5)
MD5_STEP(MD5_G, d, a, b, c, MD5_GET(6), 0xc040b340, 9)
MD5_STEP(MD5_G, c, d, a, b, MD5_GET(11), 0x265e5a51, 14)
MD5_STEP(MD5_G, b, c, d, a, MD5_GET(0), 0xe9b6c7aa, 20)
MD5_STEP(MD5_G, a, b, c, d, MD5_GET(5), 0xd62f105d, 5)
MD5_STEP(MD5_G, d, a, b, c, MD5_GET(10), 0x02441453, 9)
MD5_STEP(MD5_G, c, d, a, b, MD5_GET(15), 0xd8a1e681, 14)
MD5_STEP(MD5_G, b, c, d, a, MD5_GET(4), 0xe7d3fbc8, 20)
MD5_STEP(MD5_G, a, b, c, d, MD5_GET(9), 0x21e1cde6, 5)
MD5_STEP(MD5_G, d, a, b, c, MD5_GET(14), 0xc33707d6, 9)
MD5_STEP(MD5_G, c, d, a, b, MD5_GET(3), 0xf4d50d87, 14)
MD5_STEP(MD5_G, b, c, d, a, MD5_GET(8), 0x455a14ed, 20)
MD5_STEP(MD5_G, a, b, c, d, MD5_GET(13), 0xa9e3e905, 5)
MD5_STEP(MD5_G, d, a, b, c, MD5_GET(2), 0xfcefa3f8, 9)
MD5_STEP(MD5_G, c, d, a, b, MD5_GET(7), 0x676f02d9, 14)
MD5_STEP(MD5_G, b, c, d, a, MD5_GET(12), 0x8d2a4c8a, 20)
2015-11-17 17:22:37 +01:00
/* Round 3 */
2024-11-11 15:18:55 +01:00
MD5_STEP(MD5_H, a, b, c, d, MD5_GET(5), 0xfffa3942, 4)
MD5_STEP(MD5_H2, d, a, b, c, MD5_GET(8), 0x8771f681, 11)
MD5_STEP(MD5_H, c, d, a, b, MD5_GET(11), 0x6d9d6122, 16)
MD5_STEP(MD5_H2, b, c, d, a, MD5_GET(14), 0xfde5380c, 23)
MD5_STEP(MD5_H, a, b, c, d, MD5_GET(1), 0xa4beea44, 4)
MD5_STEP(MD5_H2, d, a, b, c, MD5_GET(4), 0x4bdecfa9, 11)
MD5_STEP(MD5_H, c, d, a, b, MD5_GET(7), 0xf6bb4b60, 16)
MD5_STEP(MD5_H2, b, c, d, a, MD5_GET(10), 0xbebfbc70, 23)
MD5_STEP(MD5_H, a, b, c, d, MD5_GET(13), 0x289b7ec6, 4)
MD5_STEP(MD5_H2, d, a, b, c, MD5_GET(0), 0xeaa127fa, 11)
MD5_STEP(MD5_H, c, d, a, b, MD5_GET(3), 0xd4ef3085, 16)
MD5_STEP(MD5_H2, b, c, d, a, MD5_GET(6), 0x04881d05, 23)
MD5_STEP(MD5_H, a, b, c, d, MD5_GET(9), 0xd9d4d039, 4)
MD5_STEP(MD5_H2, d, a, b, c, MD5_GET(12), 0xe6db99e5, 11)
MD5_STEP(MD5_H, c, d, a, b, MD5_GET(15), 0x1fa27cf8, 16)
MD5_STEP(MD5_H2, b, c, d, a, MD5_GET(2), 0xc4ac5665, 23)
2015-11-17 17:22:37 +01:00
/* Round 4 */
2024-11-11 15:18:55 +01:00
MD5_STEP(MD5_I, a, b, c, d, MD5_GET(0), 0xf4292244, 6)
MD5_STEP(MD5_I, d, a, b, c, MD5_GET(7), 0x432aff97, 10)
MD5_STEP(MD5_I, c, d, a, b, MD5_GET(14), 0xab9423a7, 15)
MD5_STEP(MD5_I, b, c, d, a, MD5_GET(5), 0xfc93a039, 21)
MD5_STEP(MD5_I, a, b, c, d, MD5_GET(12), 0x655b59c3, 6)
MD5_STEP(MD5_I, d, a, b, c, MD5_GET(3), 0x8f0ccc92, 10)
MD5_STEP(MD5_I, c, d, a, b, MD5_GET(10), 0xffeff47d, 15)
MD5_STEP(MD5_I, b, c, d, a, MD5_GET(1), 0x85845dd1, 21)
MD5_STEP(MD5_I, a, b, c, d, MD5_GET(8), 0x6fa87e4f, 6)
MD5_STEP(MD5_I, d, a, b, c, MD5_GET(15), 0xfe2ce6e0, 10)
MD5_STEP(MD5_I, c, d, a, b, MD5_GET(6), 0xa3014314, 15)
MD5_STEP(MD5_I, b, c, d, a, MD5_GET(13), 0x4e0811a1, 21)
MD5_STEP(MD5_I, a, b, c, d, MD5_GET(4), 0xf7537e82, 6)
MD5_STEP(MD5_I, d, a, b, c, MD5_GET(11), 0xbd3af235, 10)
MD5_STEP(MD5_I, c, d, a, b, MD5_GET(2), 0x2ad7d2bb, 15)
MD5_STEP(MD5_I, b, c, d, a, MD5_GET(9), 0xeb86d391, 21)
2019-11-11 23:01:05 +01:00
a += saved_a;
2015-11-17 17:22:37 +01:00
b += saved_b;
c += saved_c;
d += saved_d;
ptr += 64;
} while(size -= 64);
ctx->a = a;
ctx->b = b;
ctx->c = c;
ctx->d = d;
return ptr;
}
2022-08-04 22:12:04 +02:00
static CURLcode my_md5_init(my_md5_ctx *ctx)
2015-11-17 17:22:37 +01:00
{
ctx->a = 0x67452301;
ctx->b = 0xefcdab89;
ctx->c = 0x98badcfe;
ctx->d = 0x10325476;
ctx->lo = 0;
ctx->hi = 0;
2022-03-29 21:10:50 +02:00
return CURLE_OK;
2015-11-17 17:22:37 +01:00
}
2022-08-04 22:12:04 +02:00
static void my_md5_update(my_md5_ctx *ctx, const void *data,
unsigned long size)
{
2015-11-17 17:22:37 +01:00
MD5_u32plus saved_lo;
2019-11-11 23:01:05 +01:00
unsigned long used;
2015-11-17 17:22:37 +01:00
saved_lo = ctx->lo;
2017-07-20 19:35:53 +02:00
ctx->lo = (saved_lo + size) & 0x1fffffff;
if(ctx->lo < saved_lo)
2015-11-17 17:22:37 +01:00
ctx->hi++;
ctx->hi += (MD5_u32plus)size >> 29;
2015-11-17 17:22:37 +01:00
used = saved_lo & 0x3f;
2015-04-27 22:25:09 +02:00
2015-11-17 17:22:37 +01:00
if(used) {
2019-11-11 23:01:05 +01:00
unsigned long available = 64 - used;
2015-11-17 17:22:37 +01:00
if(size < available) {
memcpy(&ctx->buffer[used], data, size);
return;
}
2015-04-27 22:25:09 +02:00
2015-11-17 17:22:37 +01:00
memcpy(&ctx->buffer[used], data, available);
data = (const unsigned char *)data + available;
size -= available;
2024-11-11 15:18:55 +01:00
my_md5_body(ctx, ctx->buffer, 64);
2015-11-17 17:22:37 +01:00
}
2015-04-27 22:25:09 +02:00
2015-11-17 17:22:37 +01:00
if(size >= 64) {
2024-11-11 15:18:55 +01:00
data = my_md5_body(ctx, data, size & ~(unsigned long)0x3f);
2015-11-17 17:22:37 +01:00
size &= 0x3f;
}
2015-11-17 17:22:37 +01:00
memcpy(ctx->buffer, data, size);
}
2022-08-04 22:12:04 +02:00
static void my_md5_final(unsigned char *result, my_md5_ctx *ctx)
{
2015-11-17 17:22:37 +01:00
unsigned long used, available;
2015-11-17 17:22:37 +01:00
used = ctx->lo & 0x3f;
2015-11-17 17:22:37 +01:00
ctx->buffer[used++] = 0x80;
2015-11-17 17:22:37 +01:00
available = 64 - used;
2015-11-17 17:22:37 +01:00
if(available < 8) {
memset(&ctx->buffer[used], 0, available);
2024-11-11 15:18:55 +01:00
my_md5_body(ctx, ctx->buffer, 64);
2015-11-17 17:22:37 +01:00
used = 0;
available = 64;
}
2015-11-17 17:22:37 +01:00
memset(&ctx->buffer[used], 0, available - 8);
ctx->lo <<= 3;
ctx->buffer[56] = curlx_ultouc((ctx->lo)&0xff);
ctx->buffer[57] = curlx_ultouc((ctx->lo >> 8)&0xff);
ctx->buffer[58] = curlx_ultouc((ctx->lo >> 16)&0xff);
ctx->buffer[59] = curlx_ultouc(ctx->lo >> 24);
ctx->buffer[60] = curlx_ultouc((ctx->hi)&0xff);
ctx->buffer[61] = curlx_ultouc((ctx->hi >> 8)&0xff);
ctx->buffer[62] = curlx_ultouc((ctx->hi >> 16)&0xff);
ctx->buffer[63] = curlx_ultouc(ctx->hi >> 24);
2024-11-11 15:18:55 +01:00
my_md5_body(ctx, ctx->buffer, 64);
2015-11-17 17:22:37 +01:00
result[0] = curlx_ultouc((ctx->a)&0xff);
result[1] = curlx_ultouc((ctx->a >> 8)&0xff);
result[2] = curlx_ultouc((ctx->a >> 16)&0xff);
result[3] = curlx_ultouc(ctx->a >> 24);
result[4] = curlx_ultouc((ctx->b)&0xff);
result[5] = curlx_ultouc((ctx->b >> 8)&0xff);
result[6] = curlx_ultouc((ctx->b >> 16)&0xff);
result[7] = curlx_ultouc(ctx->b >> 24);
result[8] = curlx_ultouc((ctx->c)&0xff);
result[9] = curlx_ultouc((ctx->c >> 8)&0xff);
result[10] = curlx_ultouc((ctx->c >> 16)&0xff);
result[11] = curlx_ultouc(ctx->c >> 24);
result[12] = curlx_ultouc((ctx->d)&0xff);
result[13] = curlx_ultouc((ctx->d >> 8)&0xff);
result[14] = curlx_ultouc((ctx->d >> 16)&0xff);
result[15] = curlx_ultouc(ctx->d >> 24);
memset(ctx, 0, sizeof(*ctx));
}
2015-04-27 22:25:09 +02:00
#endif /* CRYPTO LIBS */
2020-08-30 11:54:41 +02:00
const struct HMAC_params Curl_HMAC_MD5[] = {
2015-04-27 22:25:09 +02:00
{
2018-10-28 12:09:07 +01:00
/* Hash initialization function. */
2022-08-04 22:12:04 +02:00
CURLX_FUNCTION_CAST(HMAC_hinit_func, my_md5_init),
2018-10-28 12:09:07 +01:00
/* Hash update function. */
2022-08-04 22:12:04 +02:00
CURLX_FUNCTION_CAST(HMAC_hupdate_func, my_md5_update),
2018-10-28 12:09:07 +01:00
/* Hash computation end function. */
2022-08-04 22:12:04 +02:00
CURLX_FUNCTION_CAST(HMAC_hfinal_func, my_md5_final),
2018-10-28 12:09:07 +01:00
/* Size of hash context structure. */
2022-08-04 22:12:04 +02:00
sizeof(my_md5_ctx),
2018-10-28 12:09:07 +01:00
/* Maximum key length. */
64,
/* Result size. */
16
2015-04-27 22:25:09 +02:00
}
};
2020-08-30 11:54:41 +02:00
const struct MD5_params Curl_DIGEST_MD5[] = {
2015-04-27 22:25:09 +02:00
{
2018-10-28 12:09:07 +01:00
/* Digest initialization function */
2022-08-04 22:12:04 +02:00
CURLX_FUNCTION_CAST(Curl_MD5_init_func, my_md5_init),
2018-10-28 12:09:07 +01:00
/* Digest update function */
2022-08-04 22:12:04 +02:00
CURLX_FUNCTION_CAST(Curl_MD5_update_func, my_md5_update),
2018-10-28 12:09:07 +01:00
/* Digest computation end function */
2022-08-04 22:12:04 +02:00
CURLX_FUNCTION_CAST(Curl_MD5_final_func, my_md5_final),
2018-10-28 12:09:07 +01:00
/* Size of digest context struct */
2022-08-04 22:12:04 +02:00
sizeof(my_md5_ctx),
2018-10-28 12:09:07 +01:00
/* Result size */
16
2015-04-27 22:25:09 +02:00
}
};
2015-11-17 17:22:37 +01:00
/*
* @unittest: 1601
2022-03-29 21:10:50 +02:00
* Returns CURLE_OK on success.
2015-11-17 17:22:37 +01:00
*/
2022-03-29 21:10:50 +02:00
CURLcode Curl_md5it(unsigned char *outbuffer, const unsigned char *input,
2022-08-04 22:12:04 +02:00
const size_t len)
{
2022-08-04 22:12:04 +02:00
CURLcode result;
my_md5_ctx ctx;
2020-08-30 11:54:41 +02:00
2022-08-04 22:12:04 +02:00
result = my_md5_init(&ctx);
if(!result) {
my_md5_update(&ctx, input, curlx_uztoui(len));
my_md5_final(outbuffer, &ctx);
}
return result;
}
2020-08-30 11:54:41 +02:00
struct MD5_context *Curl_MD5_init(const struct MD5_params *md5params)
2015-04-27 22:25:09 +02:00
{
2020-08-30 11:54:41 +02:00
struct MD5_context *ctxt;
2015-04-27 22:25:09 +02:00
/* Create MD5 context */
2018-10-28 12:09:07 +01:00
ctxt = malloc(sizeof(*ctxt));
2015-04-27 22:25:09 +02:00
if(!ctxt)
return ctxt;
ctxt->md5_hashctx = malloc(md5params->md5_ctxtsize);
if(!ctxt->md5_hashctx) {
free(ctxt);
return NULL;
}
ctxt->md5_hash = md5params;
2022-08-04 22:12:04 +02:00
if((*md5params->md5_init_func)(ctxt->md5_hashctx)) {
free(ctxt->md5_hashctx);
free(ctxt);
return NULL;
}
2015-04-27 22:25:09 +02:00
return ctxt;
}
2020-08-30 11:54:41 +02:00
CURLcode Curl_MD5_update(struct MD5_context *context,
2019-11-11 23:01:05 +01:00
const unsigned char *data,
unsigned int len)
2015-04-27 22:25:09 +02:00
{
(*context->md5_hash->md5_update_func)(context->md5_hashctx, data, len);
2019-11-11 23:01:05 +01:00
return CURLE_OK;
2015-04-27 22:25:09 +02:00
}
2020-08-30 11:54:41 +02:00
CURLcode Curl_MD5_final(struct MD5_context *context, unsigned char *result)
2015-04-27 22:25:09 +02:00
{
(*context->md5_hash->md5_final_func)(result, context->md5_hashctx);
free(context->md5_hashctx);
free(context);
2019-11-11 23:01:05 +01:00
return CURLE_OK;
2015-04-27 22:25:09 +02:00
}
2023-12-07 09:12:54 +01:00
#endif /* Using NTLM (without SSPI) || Digest */