Coverage Report

Created: 2024-11-21 07:03

/src/mbedtls/library/md5.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 *  RFC 1321 compliant MD5 implementation
3
 *
4
 *  Copyright The Mbed TLS Contributors
5
 *  SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later
6
 */
7
/*
8
 *  The MD5 algorithm was designed by Ron Rivest in 1991.
9
 *
10
 *  http://www.ietf.org/rfc/rfc1321.txt
11
 */
12
13
#include "common.h"
14
15
#if defined(MBEDTLS_MD5_C)
16
17
#include "mbedtls/md5.h"
18
#include "mbedtls/platform_util.h"
19
#include "mbedtls/error.h"
20
21
#include <string.h>
22
23
#include "mbedtls/platform.h"
24
25
#if !defined(MBEDTLS_MD5_ALT)
26
27
void mbedtls_md5_init(mbedtls_md5_context *ctx)
28
514
{
29
514
    memset(ctx, 0, sizeof(mbedtls_md5_context));
30
514
}
31
32
void mbedtls_md5_free(mbedtls_md5_context *ctx)
33
11.4k
{
34
11.4k
    if (ctx == NULL) {
35
0
        return;
36
0
    }
37
38
11.4k
    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_md5_context));
39
11.4k
}
40
41
void mbedtls_md5_clone(mbedtls_md5_context *dst,
42
                       const mbedtls_md5_context *src)
43
0
{
44
0
    *dst = *src;
45
0
}
46
47
/*
48
 * MD5 context setup
49
 */
50
int mbedtls_md5_starts(mbedtls_md5_context *ctx)
51
11.0k
{
52
11.0k
    ctx->total[0] = 0;
53
11.0k
    ctx->total[1] = 0;
54
55
11.0k
    ctx->state[0] = 0x67452301;
56
11.0k
    ctx->state[1] = 0xEFCDAB89;
57
11.0k
    ctx->state[2] = 0x98BADCFE;
58
11.0k
    ctx->state[3] = 0x10325476;
59
60
11.0k
    return 0;
61
11.0k
}
62
63
#if !defined(MBEDTLS_MD5_PROCESS_ALT)
64
int mbedtls_internal_md5_process(mbedtls_md5_context *ctx,
65
                                 const unsigned char data[64])
66
411k
{
67
411k
    struct {
68
411k
        uint32_t X[16], A, B, C, D;
69
411k
    } local;
70
71
411k
    local.X[0] = MBEDTLS_GET_UINT32_LE(data,  0);
72
411k
    local.X[1] = MBEDTLS_GET_UINT32_LE(data,  4);
73
411k
    local.X[2] = MBEDTLS_GET_UINT32_LE(data,  8);
74
411k
    local.X[3] = MBEDTLS_GET_UINT32_LE(data, 12);
75
411k
    local.X[4] = MBEDTLS_GET_UINT32_LE(data, 16);
76
411k
    local.X[5] = MBEDTLS_GET_UINT32_LE(data, 20);
77
411k
    local.X[6] = MBEDTLS_GET_UINT32_LE(data, 24);
78
411k
    local.X[7] = MBEDTLS_GET_UINT32_LE(data, 28);
79
411k
    local.X[8] = MBEDTLS_GET_UINT32_LE(data, 32);
80
411k
    local.X[9] = MBEDTLS_GET_UINT32_LE(data, 36);
81
411k
    local.X[10] = MBEDTLS_GET_UINT32_LE(data, 40);
82
411k
    local.X[11] = MBEDTLS_GET_UINT32_LE(data, 44);
83
411k
    local.X[12] = MBEDTLS_GET_UINT32_LE(data, 48);
84
411k
    local.X[13] = MBEDTLS_GET_UINT32_LE(data, 52);
85
411k
    local.X[14] = MBEDTLS_GET_UINT32_LE(data, 56);
86
411k
    local.X[15] = MBEDTLS_GET_UINT32_LE(data, 60);
87
88
411k
#define S(x, n)                                                          \
89
26.3M
    (((x) << (n)) | (((x) & 0xFFFFFFFF) >> (32 - (n))))
90
91
411k
#define P(a, b, c, d, k, s, t)                                                \
92
26.3M
    do                                                                  \
93
26.3M
    {                                                                   \
94
26.3M
        (a) += F((b), (c), (d)) + local.X[(k)] + (t);                     \
95
26.3M
        (a) = S((a), (s)) + (b);                                         \
96
26.3M
    } while (0)
97
98
411k
    local.A = ctx->state[0];
99
411k
    local.B = ctx->state[1];
100
411k
    local.C = ctx->state[2];
101
411k
    local.D = ctx->state[3];
102
103
6.57M
#define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
104
105
411k
    P(local.A, local.B, local.C, local.D,  0,  7, 0xD76AA478);
106
411k
    P(local.D, local.A, local.B, local.C,  1, 12, 0xE8C7B756);
107
411k
    P(local.C, local.D, local.A, local.B,  2, 17, 0x242070DB);
108
411k
    P(local.B, local.C, local.D, local.A,  3, 22, 0xC1BDCEEE);
109
411k
    P(local.A, local.B, local.C, local.D,  4,  7, 0xF57C0FAF);
110
411k
    P(local.D, local.A, local.B, local.C,  5, 12, 0x4787C62A);
111
411k
    P(local.C, local.D, local.A, local.B,  6, 17, 0xA8304613);
112
411k
    P(local.B, local.C, local.D, local.A,  7, 22, 0xFD469501);
113
411k
    P(local.A, local.B, local.C, local.D,  8,  7, 0x698098D8);
114
411k
    P(local.D, local.A, local.B, local.C,  9, 12, 0x8B44F7AF);
115
411k
    P(local.C, local.D, local.A, local.B, 10, 17, 0xFFFF5BB1);
116
411k
    P(local.B, local.C, local.D, local.A, 11, 22, 0x895CD7BE);
117
411k
    P(local.A, local.B, local.C, local.D, 12,  7, 0x6B901122);
118
411k
    P(local.D, local.A, local.B, local.C, 13, 12, 0xFD987193);
119
411k
    P(local.C, local.D, local.A, local.B, 14, 17, 0xA679438E);
120
411k
    P(local.B, local.C, local.D, local.A, 15, 22, 0x49B40821);
121
122
411k
#undef F
123
124
6.57M
#define F(x, y, z) ((y) ^ ((z) & ((x) ^ (y))))
125
126
411k
    P(local.A, local.B, local.C, local.D,  1,  5, 0xF61E2562);
127
411k
    P(local.D, local.A, local.B, local.C,  6,  9, 0xC040B340);
128
411k
    P(local.C, local.D, local.A, local.B, 11, 14, 0x265E5A51);
129
411k
    P(local.B, local.C, local.D, local.A,  0, 20, 0xE9B6C7AA);
130
411k
    P(local.A, local.B, local.C, local.D,  5,  5, 0xD62F105D);
131
411k
    P(local.D, local.A, local.B, local.C, 10,  9, 0x02441453);
132
411k
    P(local.C, local.D, local.A, local.B, 15, 14, 0xD8A1E681);
133
411k
    P(local.B, local.C, local.D, local.A,  4, 20, 0xE7D3FBC8);
134
411k
    P(local.A, local.B, local.C, local.D,  9,  5, 0x21E1CDE6);
135
411k
    P(local.D, local.A, local.B, local.C, 14,  9, 0xC33707D6);
136
411k
    P(local.C, local.D, local.A, local.B,  3, 14, 0xF4D50D87);
137
411k
    P(local.B, local.C, local.D, local.A,  8, 20, 0x455A14ED);
138
411k
    P(local.A, local.B, local.C, local.D, 13,  5, 0xA9E3E905);
139
411k
    P(local.D, local.A, local.B, local.C,  2,  9, 0xFCEFA3F8);
140
411k
    P(local.C, local.D, local.A, local.B,  7, 14, 0x676F02D9);
141
411k
    P(local.B, local.C, local.D, local.A, 12, 20, 0x8D2A4C8A);
142
143
411k
#undef F
144
145
6.57M
#define F(x, y, z) ((x) ^ (y) ^ (z))
146
147
411k
    P(local.A, local.B, local.C, local.D,  5,  4, 0xFFFA3942);
148
411k
    P(local.D, local.A, local.B, local.C,  8, 11, 0x8771F681);
149
411k
    P(local.C, local.D, local.A, local.B, 11, 16, 0x6D9D6122);
150
411k
    P(local.B, local.C, local.D, local.A, 14, 23, 0xFDE5380C);
151
411k
    P(local.A, local.B, local.C, local.D,  1,  4, 0xA4BEEA44);
152
411k
    P(local.D, local.A, local.B, local.C,  4, 11, 0x4BDECFA9);
153
411k
    P(local.C, local.D, local.A, local.B,  7, 16, 0xF6BB4B60);
154
411k
    P(local.B, local.C, local.D, local.A, 10, 23, 0xBEBFBC70);
155
411k
    P(local.A, local.B, local.C, local.D, 13,  4, 0x289B7EC6);
156
411k
    P(local.D, local.A, local.B, local.C,  0, 11, 0xEAA127FA);
157
411k
    P(local.C, local.D, local.A, local.B,  3, 16, 0xD4EF3085);
158
411k
    P(local.B, local.C, local.D, local.A,  6, 23, 0x04881D05);
159
411k
    P(local.A, local.B, local.C, local.D,  9,  4, 0xD9D4D039);
160
411k
    P(local.D, local.A, local.B, local.C, 12, 11, 0xE6DB99E5);
161
411k
    P(local.C, local.D, local.A, local.B, 15, 16, 0x1FA27CF8);
162
411k
    P(local.B, local.C, local.D, local.A,  2, 23, 0xC4AC5665);
163
164
411k
#undef F
165
166
6.57M
#define F(x, y, z) ((y) ^ ((x) | ~(z)))
167
168
411k
    P(local.A, local.B, local.C, local.D,  0,  6, 0xF4292244);
169
411k
    P(local.D, local.A, local.B, local.C,  7, 10, 0x432AFF97);
170
411k
    P(local.C, local.D, local.A, local.B, 14, 15, 0xAB9423A7);
171
411k
    P(local.B, local.C, local.D, local.A,  5, 21, 0xFC93A039);
172
411k
    P(local.A, local.B, local.C, local.D, 12,  6, 0x655B59C3);
173
411k
    P(local.D, local.A, local.B, local.C,  3, 10, 0x8F0CCC92);
174
411k
    P(local.C, local.D, local.A, local.B, 10, 15, 0xFFEFF47D);
175
411k
    P(local.B, local.C, local.D, local.A,  1, 21, 0x85845DD1);
176
411k
    P(local.A, local.B, local.C, local.D,  8,  6, 0x6FA87E4F);
177
411k
    P(local.D, local.A, local.B, local.C, 15, 10, 0xFE2CE6E0);
178
411k
    P(local.C, local.D, local.A, local.B,  6, 15, 0xA3014314);
179
411k
    P(local.B, local.C, local.D, local.A, 13, 21, 0x4E0811A1);
180
411k
    P(local.A, local.B, local.C, local.D,  4,  6, 0xF7537E82);
181
411k
    P(local.D, local.A, local.B, local.C, 11, 10, 0xBD3AF235);
182
411k
    P(local.C, local.D, local.A, local.B,  2, 15, 0x2AD7D2BB);
183
411k
    P(local.B, local.C, local.D, local.A,  9, 21, 0xEB86D391);
184
185
411k
#undef F
186
187
411k
    ctx->state[0] += local.A;
188
411k
    ctx->state[1] += local.B;
189
411k
    ctx->state[2] += local.C;
190
411k
    ctx->state[3] += local.D;
191
192
    /* Zeroise variables to clear sensitive data from memory. */
193
411k
    mbedtls_platform_zeroize(&local, sizeof(local));
194
195
411k
    return 0;
196
411k
}
197
198
#endif /* !MBEDTLS_MD5_PROCESS_ALT */
199
200
/*
201
 * MD5 process buffer
202
 */
203
int mbedtls_md5_update(mbedtls_md5_context *ctx,
204
                       const unsigned char *input,
205
                       size_t ilen)
206
48.2k
{
207
48.2k
    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
208
48.2k
    size_t fill;
209
48.2k
    uint32_t left;
210
211
48.2k
    if (ilen == 0) {
212
20.5k
        return 0;
213
20.5k
    }
214
215
27.6k
    left = ctx->total[0] & 0x3F;
216
27.6k
    fill = 64 - left;
217
218
27.6k
    ctx->total[0] += (uint32_t) ilen;
219
27.6k
    ctx->total[0] &= 0xFFFFFFFF;
220
221
27.6k
    if (ctx->total[0] < (uint32_t) ilen) {
222
0
        ctx->total[1]++;
223
0
    }
224
225
27.6k
    if (left && ilen >= fill) {
226
1.99k
        memcpy((void *) (ctx->buffer + left), input, fill);
227
1.99k
        if ((ret = mbedtls_internal_md5_process(ctx, ctx->buffer)) != 0) {
228
0
            return ret;
229
0
        }
230
231
1.99k
        input += fill;
232
1.99k
        ilen  -= fill;
233
1.99k
        left = 0;
234
1.99k
    }
235
236
425k
    while (ilen >= 64) {
237
397k
        if ((ret = mbedtls_internal_md5_process(ctx, input)) != 0) {
238
0
            return ret;
239
0
        }
240
241
397k
        input += 64;
242
397k
        ilen  -= 64;
243
397k
    }
244
245
27.6k
    if (ilen > 0) {
246
16.9k
        memcpy((void *) (ctx->buffer + left), input, ilen);
247
16.9k
    }
248
249
27.6k
    return 0;
250
27.6k
}
251
252
/*
253
 * MD5 final digest
254
 */
255
int mbedtls_md5_finish(mbedtls_md5_context *ctx,
256
                       unsigned char output[16])
257
10.9k
{
258
10.9k
    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
259
10.9k
    uint32_t used;
260
10.9k
    uint32_t high, low;
261
262
    /*
263
     * Add padding: 0x80 then 0x00 until 8 bytes remain for the length
264
     */
265
10.9k
    used = ctx->total[0] & 0x3F;
266
267
10.9k
    ctx->buffer[used++] = 0x80;
268
269
10.9k
    if (used <= 56) {
270
        /* Enough room for padding + length in current block */
271
10.5k
        memset(ctx->buffer + used, 0, 56 - used);
272
10.5k
    } else {
273
        /* We'll need an extra block */
274
390
        memset(ctx->buffer + used, 0, 64 - used);
275
276
390
        if ((ret = mbedtls_internal_md5_process(ctx, ctx->buffer)) != 0) {
277
0
            goto exit;
278
0
        }
279
280
390
        memset(ctx->buffer, 0, 56);
281
390
    }
282
283
    /*
284
     * Add message length
285
     */
286
10.9k
    high = (ctx->total[0] >> 29)
287
10.9k
           | (ctx->total[1] <<  3);
288
10.9k
    low  = (ctx->total[0] <<  3);
289
290
10.9k
    MBEDTLS_PUT_UINT32_LE(low,  ctx->buffer, 56);
291
10.9k
    MBEDTLS_PUT_UINT32_LE(high, ctx->buffer, 60);
292
293
10.9k
    if ((ret = mbedtls_internal_md5_process(ctx, ctx->buffer)) != 0) {
294
0
        goto exit;
295
0
    }
296
297
    /*
298
     * Output final state
299
     */
300
10.9k
    MBEDTLS_PUT_UINT32_LE(ctx->state[0], output,  0);
301
10.9k
    MBEDTLS_PUT_UINT32_LE(ctx->state[1], output,  4);
302
10.9k
    MBEDTLS_PUT_UINT32_LE(ctx->state[2], output,  8);
303
10.9k
    MBEDTLS_PUT_UINT32_LE(ctx->state[3], output, 12);
304
305
10.9k
    ret = 0;
306
307
10.9k
exit:
308
10.9k
    mbedtls_md5_free(ctx);
309
10.9k
    return ret;
310
10.9k
}
311
312
#endif /* !MBEDTLS_MD5_ALT */
313
314
/*
315
 * output = MD5( input buffer )
316
 */
317
int mbedtls_md5(const unsigned char *input,
318
                size_t ilen,
319
                unsigned char output[16])
320
0
{
321
0
    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
322
0
    mbedtls_md5_context ctx;
323
324
0
    mbedtls_md5_init(&ctx);
325
326
0
    if ((ret = mbedtls_md5_starts(&ctx)) != 0) {
327
0
        goto exit;
328
0
    }
329
330
0
    if ((ret = mbedtls_md5_update(&ctx, input, ilen)) != 0) {
331
0
        goto exit;
332
0
    }
333
334
0
    if ((ret = mbedtls_md5_finish(&ctx, output)) != 0) {
335
0
        goto exit;
336
0
    }
337
338
0
exit:
339
0
    mbedtls_md5_free(&ctx);
340
341
0
    return ret;
342
0
}
343
344
#if defined(MBEDTLS_SELF_TEST)
345
/*
346
 * RFC 1321 test vectors
347
 */
348
static const unsigned char md5_test_buf[7][81] =
349
{
350
    { "" },
351
    { "a" },
352
    { "abc" },
353
    { "message digest" },
354
    { "abcdefghijklmnopqrstuvwxyz" },
355
    { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" },
356
    { "12345678901234567890123456789012345678901234567890123456789012345678901234567890" }
357
};
358
359
static const size_t md5_test_buflen[7] =
360
{
361
    0, 1, 3, 14, 26, 62, 80
362
};
363
364
static const unsigned char md5_test_sum[7][16] =
365
{
366
    { 0xD4, 0x1D, 0x8C, 0xD9, 0x8F, 0x00, 0xB2, 0x04,
367
      0xE9, 0x80, 0x09, 0x98, 0xEC, 0xF8, 0x42, 0x7E },
368
    { 0x0C, 0xC1, 0x75, 0xB9, 0xC0, 0xF1, 0xB6, 0xA8,
369
      0x31, 0xC3, 0x99, 0xE2, 0x69, 0x77, 0x26, 0x61 },
370
    { 0x90, 0x01, 0x50, 0x98, 0x3C, 0xD2, 0x4F, 0xB0,
371
      0xD6, 0x96, 0x3F, 0x7D, 0x28, 0xE1, 0x7F, 0x72 },
372
    { 0xF9, 0x6B, 0x69, 0x7D, 0x7C, 0xB7, 0x93, 0x8D,
373
      0x52, 0x5A, 0x2F, 0x31, 0xAA, 0xF1, 0x61, 0xD0 },
374
    { 0xC3, 0xFC, 0xD3, 0xD7, 0x61, 0x92, 0xE4, 0x00,
375
      0x7D, 0xFB, 0x49, 0x6C, 0xCA, 0x67, 0xE1, 0x3B },
376
    { 0xD1, 0x74, 0xAB, 0x98, 0xD2, 0x77, 0xD9, 0xF5,
377
      0xA5, 0x61, 0x1C, 0x2C, 0x9F, 0x41, 0x9D, 0x9F },
378
    { 0x57, 0xED, 0xF4, 0xA2, 0x2B, 0xE3, 0xC9, 0x55,
379
      0xAC, 0x49, 0xDA, 0x2E, 0x21, 0x07, 0xB6, 0x7A }
380
};
381
382
/*
383
 * Checkup routine
384
 */
385
int mbedtls_md5_self_test(int verbose)
386
0
{
387
0
    int i, ret = 0;
388
0
    unsigned char md5sum[16];
389
390
0
    for (i = 0; i < 7; i++) {
391
0
        if (verbose != 0) {
392
0
            mbedtls_printf("  MD5 test #%d: ", i + 1);
393
0
        }
394
395
0
        ret = mbedtls_md5(md5_test_buf[i], md5_test_buflen[i], md5sum);
396
0
        if (ret != 0) {
397
0
            goto fail;
398
0
        }
399
400
0
        if (memcmp(md5sum, md5_test_sum[i], 16) != 0) {
401
0
            ret = 1;
402
0
            goto fail;
403
0
        }
404
405
0
        if (verbose != 0) {
406
0
            mbedtls_printf("passed\n");
407
0
        }
408
0
    }
409
410
0
    if (verbose != 0) {
411
0
        mbedtls_printf("\n");
412
0
    }
413
414
0
    return 0;
415
416
0
fail:
417
0
    if (verbose != 0) {
418
0
        mbedtls_printf("failed\n");
419
0
    }
420
421
0
    return ret;
422
0
}
423
424
#endif /* MBEDTLS_SELF_TEST */
425
426
#endif /* MBEDTLS_MD5_C */