Coverage Report

Created: 2024-11-21 07:03

/src/mbedtls/library/sha1.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 *  FIPS-180-1 compliant SHA-1 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 SHA-1 standard was published by NIST in 1993.
9
 *
10
 *  http://www.itl.nist.gov/fipspubs/fip180-1.htm
11
 */
12
13
#include "common.h"
14
15
#if defined(MBEDTLS_SHA1_C)
16
17
#include "mbedtls/sha1.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_SHA1_ALT)
26
27
void mbedtls_sha1_init(mbedtls_sha1_context *ctx)
28
627
{
29
627
    memset(ctx, 0, sizeof(mbedtls_sha1_context));
30
627
}
31
32
void mbedtls_sha1_free(mbedtls_sha1_context *ctx)
33
18.8k
{
34
18.8k
    if (ctx == NULL) {
35
0
        return;
36
0
    }
37
38
18.8k
    mbedtls_platform_zeroize(ctx, sizeof(mbedtls_sha1_context));
39
18.8k
}
40
41
void mbedtls_sha1_clone(mbedtls_sha1_context *dst,
42
                        const mbedtls_sha1_context *src)
43
0
{
44
0
    *dst = *src;
45
0
}
46
47
/*
48
 * SHA-1 context setup
49
 */
50
int mbedtls_sha1_starts(mbedtls_sha1_context *ctx)
51
18.4k
{
52
18.4k
    ctx->total[0] = 0;
53
18.4k
    ctx->total[1] = 0;
54
55
18.4k
    ctx->state[0] = 0x67452301;
56
18.4k
    ctx->state[1] = 0xEFCDAB89;
57
18.4k
    ctx->state[2] = 0x98BADCFE;
58
18.4k
    ctx->state[3] = 0x10325476;
59
18.4k
    ctx->state[4] = 0xC3D2E1F0;
60
61
18.4k
    return 0;
62
18.4k
}
63
64
#if !defined(MBEDTLS_SHA1_PROCESS_ALT)
65
int mbedtls_internal_sha1_process(mbedtls_sha1_context *ctx,
66
                                  const unsigned char data[64])
67
837k
{
68
837k
    struct {
69
837k
        uint32_t temp, W[16], A, B, C, D, E;
70
837k
    } local;
71
72
837k
    local.W[0] = MBEDTLS_GET_UINT32_BE(data,  0);
73
837k
    local.W[1] = MBEDTLS_GET_UINT32_BE(data,  4);
74
837k
    local.W[2] = MBEDTLS_GET_UINT32_BE(data,  8);
75
837k
    local.W[3] = MBEDTLS_GET_UINT32_BE(data, 12);
76
837k
    local.W[4] = MBEDTLS_GET_UINT32_BE(data, 16);
77
837k
    local.W[5] = MBEDTLS_GET_UINT32_BE(data, 20);
78
837k
    local.W[6] = MBEDTLS_GET_UINT32_BE(data, 24);
79
837k
    local.W[7] = MBEDTLS_GET_UINT32_BE(data, 28);
80
837k
    local.W[8] = MBEDTLS_GET_UINT32_BE(data, 32);
81
837k
    local.W[9] = MBEDTLS_GET_UINT32_BE(data, 36);
82
837k
    local.W[10] = MBEDTLS_GET_UINT32_BE(data, 40);
83
837k
    local.W[11] = MBEDTLS_GET_UINT32_BE(data, 44);
84
837k
    local.W[12] = MBEDTLS_GET_UINT32_BE(data, 48);
85
837k
    local.W[13] = MBEDTLS_GET_UINT32_BE(data, 52);
86
837k
    local.W[14] = MBEDTLS_GET_UINT32_BE(data, 56);
87
837k
    local.W[15] = MBEDTLS_GET_UINT32_BE(data, 60);
88
89
133M
#define S(x, n) (((x) << (n)) | (((x) & 0xFFFFFFFF) >> (32 - (n))))
90
91
837k
#define R(t)                                                    \
92
837k
    (                                                           \
93
837k
        local.temp = local.W[((t) -  3) & 0x0F] ^             \
94
837k
                     local.W[((t) -  8) & 0x0F] ^             \
95
837k
                     local.W[((t) - 14) & 0x0F] ^             \
96
837k
                     local.W[(t)        & 0x0F],              \
97
837k
        (local.W[(t) & 0x0F] = S(local.temp, 1))               \
98
837k
    )
99
100
837k
#define P(a, b, c, d, e, x)                                          \
101
66.9M
    do                                                          \
102
66.9M
    {                                                           \
103
66.9M
        (e) += S((a), 5) + F((b), (c), (d)) + K + (x);             \
104
66.9M
        (b) = S((b), 30);                                        \
105
66.9M
    } while (0)
106
107
837k
    local.A = ctx->state[0];
108
837k
    local.B = ctx->state[1];
109
837k
    local.C = ctx->state[2];
110
837k
    local.D = ctx->state[3];
111
837k
    local.E = ctx->state[4];
112
113
16.7M
#define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
114
16.7M
#define K 0x5A827999
115
116
837k
    P(local.A, local.B, local.C, local.D, local.E, local.W[0]);
117
837k
    P(local.E, local.A, local.B, local.C, local.D, local.W[1]);
118
837k
    P(local.D, local.E, local.A, local.B, local.C, local.W[2]);
119
837k
    P(local.C, local.D, local.E, local.A, local.B, local.W[3]);
120
837k
    P(local.B, local.C, local.D, local.E, local.A, local.W[4]);
121
837k
    P(local.A, local.B, local.C, local.D, local.E, local.W[5]);
122
837k
    P(local.E, local.A, local.B, local.C, local.D, local.W[6]);
123
837k
    P(local.D, local.E, local.A, local.B, local.C, local.W[7]);
124
837k
    P(local.C, local.D, local.E, local.A, local.B, local.W[8]);
125
837k
    P(local.B, local.C, local.D, local.E, local.A, local.W[9]);
126
837k
    P(local.A, local.B, local.C, local.D, local.E, local.W[10]);
127
837k
    P(local.E, local.A, local.B, local.C, local.D, local.W[11]);
128
837k
    P(local.D, local.E, local.A, local.B, local.C, local.W[12]);
129
837k
    P(local.C, local.D, local.E, local.A, local.B, local.W[13]);
130
837k
    P(local.B, local.C, local.D, local.E, local.A, local.W[14]);
131
837k
    P(local.A, local.B, local.C, local.D, local.E, local.W[15]);
132
837k
    P(local.E, local.A, local.B, local.C, local.D, R(16));
133
837k
    P(local.D, local.E, local.A, local.B, local.C, R(17));
134
837k
    P(local.C, local.D, local.E, local.A, local.B, R(18));
135
837k
    P(local.B, local.C, local.D, local.E, local.A, R(19));
136
137
837k
#undef K
138
837k
#undef F
139
140
16.7M
#define F(x, y, z) ((x) ^ (y) ^ (z))
141
16.7M
#define K 0x6ED9EBA1
142
143
837k
    P(local.A, local.B, local.C, local.D, local.E, R(20));
144
837k
    P(local.E, local.A, local.B, local.C, local.D, R(21));
145
837k
    P(local.D, local.E, local.A, local.B, local.C, R(22));
146
837k
    P(local.C, local.D, local.E, local.A, local.B, R(23));
147
837k
    P(local.B, local.C, local.D, local.E, local.A, R(24));
148
837k
    P(local.A, local.B, local.C, local.D, local.E, R(25));
149
837k
    P(local.E, local.A, local.B, local.C, local.D, R(26));
150
837k
    P(local.D, local.E, local.A, local.B, local.C, R(27));
151
837k
    P(local.C, local.D, local.E, local.A, local.B, R(28));
152
837k
    P(local.B, local.C, local.D, local.E, local.A, R(29));
153
837k
    P(local.A, local.B, local.C, local.D, local.E, R(30));
154
837k
    P(local.E, local.A, local.B, local.C, local.D, R(31));
155
837k
    P(local.D, local.E, local.A, local.B, local.C, R(32));
156
837k
    P(local.C, local.D, local.E, local.A, local.B, R(33));
157
837k
    P(local.B, local.C, local.D, local.E, local.A, R(34));
158
837k
    P(local.A, local.B, local.C, local.D, local.E, R(35));
159
837k
    P(local.E, local.A, local.B, local.C, local.D, R(36));
160
837k
    P(local.D, local.E, local.A, local.B, local.C, R(37));
161
837k
    P(local.C, local.D, local.E, local.A, local.B, R(38));
162
837k
    P(local.B, local.C, local.D, local.E, local.A, R(39));
163
164
837k
#undef K
165
837k
#undef F
166
167
16.7M
#define F(x, y, z) (((x) & (y)) | ((z) & ((x) | (y))))
168
16.7M
#define K 0x8F1BBCDC
169
170
837k
    P(local.A, local.B, local.C, local.D, local.E, R(40));
171
837k
    P(local.E, local.A, local.B, local.C, local.D, R(41));
172
837k
    P(local.D, local.E, local.A, local.B, local.C, R(42));
173
837k
    P(local.C, local.D, local.E, local.A, local.B, R(43));
174
837k
    P(local.B, local.C, local.D, local.E, local.A, R(44));
175
837k
    P(local.A, local.B, local.C, local.D, local.E, R(45));
176
837k
    P(local.E, local.A, local.B, local.C, local.D, R(46));
177
837k
    P(local.D, local.E, local.A, local.B, local.C, R(47));
178
837k
    P(local.C, local.D, local.E, local.A, local.B, R(48));
179
837k
    P(local.B, local.C, local.D, local.E, local.A, R(49));
180
837k
    P(local.A, local.B, local.C, local.D, local.E, R(50));
181
837k
    P(local.E, local.A, local.B, local.C, local.D, R(51));
182
837k
    P(local.D, local.E, local.A, local.B, local.C, R(52));
183
837k
    P(local.C, local.D, local.E, local.A, local.B, R(53));
184
837k
    P(local.B, local.C, local.D, local.E, local.A, R(54));
185
837k
    P(local.A, local.B, local.C, local.D, local.E, R(55));
186
837k
    P(local.E, local.A, local.B, local.C, local.D, R(56));
187
837k
    P(local.D, local.E, local.A, local.B, local.C, R(57));
188
837k
    P(local.C, local.D, local.E, local.A, local.B, R(58));
189
837k
    P(local.B, local.C, local.D, local.E, local.A, R(59));
190
191
837k
#undef K
192
837k
#undef F
193
194
16.7M
#define F(x, y, z) ((x) ^ (y) ^ (z))
195
16.7M
#define K 0xCA62C1D6
196
197
837k
    P(local.A, local.B, local.C, local.D, local.E, R(60));
198
837k
    P(local.E, local.A, local.B, local.C, local.D, R(61));
199
837k
    P(local.D, local.E, local.A, local.B, local.C, R(62));
200
837k
    P(local.C, local.D, local.E, local.A, local.B, R(63));
201
837k
    P(local.B, local.C, local.D, local.E, local.A, R(64));
202
837k
    P(local.A, local.B, local.C, local.D, local.E, R(65));
203
837k
    P(local.E, local.A, local.B, local.C, local.D, R(66));
204
837k
    P(local.D, local.E, local.A, local.B, local.C, R(67));
205
837k
    P(local.C, local.D, local.E, local.A, local.B, R(68));
206
837k
    P(local.B, local.C, local.D, local.E, local.A, R(69));
207
837k
    P(local.A, local.B, local.C, local.D, local.E, R(70));
208
837k
    P(local.E, local.A, local.B, local.C, local.D, R(71));
209
837k
    P(local.D, local.E, local.A, local.B, local.C, R(72));
210
837k
    P(local.C, local.D, local.E, local.A, local.B, R(73));
211
837k
    P(local.B, local.C, local.D, local.E, local.A, R(74));
212
837k
    P(local.A, local.B, local.C, local.D, local.E, R(75));
213
837k
    P(local.E, local.A, local.B, local.C, local.D, R(76));
214
837k
    P(local.D, local.E, local.A, local.B, local.C, R(77));
215
837k
    P(local.C, local.D, local.E, local.A, local.B, R(78));
216
837k
    P(local.B, local.C, local.D, local.E, local.A, R(79));
217
218
837k
#undef K
219
837k
#undef F
220
221
837k
    ctx->state[0] += local.A;
222
837k
    ctx->state[1] += local.B;
223
837k
    ctx->state[2] += local.C;
224
837k
    ctx->state[3] += local.D;
225
837k
    ctx->state[4] += local.E;
226
227
    /* Zeroise buffers and variables to clear sensitive data from memory. */
228
837k
    mbedtls_platform_zeroize(&local, sizeof(local));
229
230
837k
    return 0;
231
837k
}
232
233
#endif /* !MBEDTLS_SHA1_PROCESS_ALT */
234
235
/*
236
 * SHA-1 process buffer
237
 */
238
int mbedtls_sha1_update(mbedtls_sha1_context *ctx,
239
                        const unsigned char *input,
240
                        size_t ilen)
241
90.5k
{
242
90.5k
    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
243
90.5k
    size_t fill;
244
90.5k
    uint32_t left;
245
246
90.5k
    if (ilen == 0) {
247
43.0k
        return 0;
248
43.0k
    }
249
250
47.5k
    left = ctx->total[0] & 0x3F;
251
47.5k
    fill = 64 - left;
252
253
47.5k
    ctx->total[0] += (uint32_t) ilen;
254
47.5k
    ctx->total[0] &= 0xFFFFFFFF;
255
256
47.5k
    if (ctx->total[0] < (uint32_t) ilen) {
257
0
        ctx->total[1]++;
258
0
    }
259
260
47.5k
    if (left && ilen >= fill) {
261
4.94k
        memcpy((void *) (ctx->buffer + left), input, fill);
262
263
4.94k
        if ((ret = mbedtls_internal_sha1_process(ctx, ctx->buffer)) != 0) {
264
0
            return ret;
265
0
        }
266
267
4.94k
        input += fill;
268
4.94k
        ilen  -= fill;
269
4.94k
        left = 0;
270
4.94k
    }
271
272
861k
    while (ilen >= 64) {
273
813k
        if ((ret = mbedtls_internal_sha1_process(ctx, input)) != 0) {
274
0
            return ret;
275
0
        }
276
277
813k
        input += 64;
278
813k
        ilen  -= 64;
279
813k
    }
280
281
47.5k
    if (ilen > 0) {
282
29.2k
        memcpy((void *) (ctx->buffer + left), input, ilen);
283
29.2k
    }
284
285
47.5k
    return 0;
286
47.5k
}
287
288
/*
289
 * SHA-1 final digest
290
 */
291
int mbedtls_sha1_finish(mbedtls_sha1_context *ctx,
292
                        unsigned char output[20])
293
18.2k
{
294
18.2k
    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
295
18.2k
    uint32_t used;
296
18.2k
    uint32_t high, low;
297
298
    /*
299
     * Add padding: 0x80 then 0x00 until 8 bytes remain for the length
300
     */
301
18.2k
    used = ctx->total[0] & 0x3F;
302
303
18.2k
    ctx->buffer[used++] = 0x80;
304
305
18.2k
    if (used <= 56) {
306
        /* Enough room for padding + length in current block */
307
17.6k
        memset(ctx->buffer + used, 0, 56 - used);
308
17.6k
    } else {
309
        /* We'll need an extra block */
310
649
        memset(ctx->buffer + used, 0, 64 - used);
311
312
649
        if ((ret = mbedtls_internal_sha1_process(ctx, ctx->buffer)) != 0) {
313
0
            goto exit;
314
0
        }
315
316
649
        memset(ctx->buffer, 0, 56);
317
649
    }
318
319
    /*
320
     * Add message length
321
     */
322
18.2k
    high = (ctx->total[0] >> 29)
323
18.2k
           | (ctx->total[1] <<  3);
324
18.2k
    low  = (ctx->total[0] <<  3);
325
326
18.2k
    MBEDTLS_PUT_UINT32_BE(high, ctx->buffer, 56);
327
18.2k
    MBEDTLS_PUT_UINT32_BE(low,  ctx->buffer, 60);
328
329
18.2k
    if ((ret = mbedtls_internal_sha1_process(ctx, ctx->buffer)) != 0) {
330
0
        goto exit;
331
0
    }
332
333
    /*
334
     * Output final state
335
     */
336
18.2k
    MBEDTLS_PUT_UINT32_BE(ctx->state[0], output,  0);
337
18.2k
    MBEDTLS_PUT_UINT32_BE(ctx->state[1], output,  4);
338
18.2k
    MBEDTLS_PUT_UINT32_BE(ctx->state[2], output,  8);
339
18.2k
    MBEDTLS_PUT_UINT32_BE(ctx->state[3], output, 12);
340
18.2k
    MBEDTLS_PUT_UINT32_BE(ctx->state[4], output, 16);
341
342
18.2k
    ret = 0;
343
344
18.2k
exit:
345
18.2k
    mbedtls_sha1_free(ctx);
346
18.2k
    return ret;
347
18.2k
}
348
349
#endif /* !MBEDTLS_SHA1_ALT */
350
351
/*
352
 * output = SHA-1( input buffer )
353
 */
354
int mbedtls_sha1(const unsigned char *input,
355
                 size_t ilen,
356
                 unsigned char output[20])
357
0
{
358
0
    int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
359
0
    mbedtls_sha1_context ctx;
360
361
0
    mbedtls_sha1_init(&ctx);
362
363
0
    if ((ret = mbedtls_sha1_starts(&ctx)) != 0) {
364
0
        goto exit;
365
0
    }
366
367
0
    if ((ret = mbedtls_sha1_update(&ctx, input, ilen)) != 0) {
368
0
        goto exit;
369
0
    }
370
371
0
    if ((ret = mbedtls_sha1_finish(&ctx, output)) != 0) {
372
0
        goto exit;
373
0
    }
374
375
0
exit:
376
0
    mbedtls_sha1_free(&ctx);
377
0
    return ret;
378
0
}
379
380
#if defined(MBEDTLS_SELF_TEST)
381
/*
382
 * FIPS-180-1 test vectors
383
 */
384
static const unsigned char sha1_test_buf[3][57] =
385
{
386
    { "abc" },
387
    { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },
388
    { "" }
389
};
390
391
static const size_t sha1_test_buflen[3] =
392
{
393
    3, 56, 1000
394
};
395
396
static const unsigned char sha1_test_sum[3][20] =
397
{
398
    { 0xA9, 0x99, 0x3E, 0x36, 0x47, 0x06, 0x81, 0x6A, 0xBA, 0x3E,
399
      0x25, 0x71, 0x78, 0x50, 0xC2, 0x6C, 0x9C, 0xD0, 0xD8, 0x9D },
400
    { 0x84, 0x98, 0x3E, 0x44, 0x1C, 0x3B, 0xD2, 0x6E, 0xBA, 0xAE,
401
      0x4A, 0xA1, 0xF9, 0x51, 0x29, 0xE5, 0xE5, 0x46, 0x70, 0xF1 },
402
    { 0x34, 0xAA, 0x97, 0x3C, 0xD4, 0xC4, 0xDA, 0xA4, 0xF6, 0x1E,
403
      0xEB, 0x2B, 0xDB, 0xAD, 0x27, 0x31, 0x65, 0x34, 0x01, 0x6F }
404
};
405
406
/*
407
 * Checkup routine
408
 */
409
int mbedtls_sha1_self_test(int verbose)
410
0
{
411
0
    int i, j, buflen, ret = 0;
412
0
    unsigned char buf[1024];
413
0
    unsigned char sha1sum[20];
414
0
    mbedtls_sha1_context ctx;
415
416
0
    mbedtls_sha1_init(&ctx);
417
418
    /*
419
     * SHA-1
420
     */
421
0
    for (i = 0; i < 3; i++) {
422
0
        if (verbose != 0) {
423
0
            mbedtls_printf("  SHA-1 test #%d: ", i + 1);
424
0
        }
425
426
0
        if ((ret = mbedtls_sha1_starts(&ctx)) != 0) {
427
0
            goto fail;
428
0
        }
429
430
0
        if (i == 2) {
431
0
            memset(buf, 'a', buflen = 1000);
432
433
0
            for (j = 0; j < 1000; j++) {
434
0
                ret = mbedtls_sha1_update(&ctx, buf, buflen);
435
0
                if (ret != 0) {
436
0
                    goto fail;
437
0
                }
438
0
            }
439
0
        } else {
440
0
            ret = mbedtls_sha1_update(&ctx, sha1_test_buf[i],
441
0
                                      sha1_test_buflen[i]);
442
0
            if (ret != 0) {
443
0
                goto fail;
444
0
            }
445
0
        }
446
447
0
        if ((ret = mbedtls_sha1_finish(&ctx, sha1sum)) != 0) {
448
0
            goto fail;
449
0
        }
450
451
0
        if (memcmp(sha1sum, sha1_test_sum[i], 20) != 0) {
452
0
            ret = 1;
453
0
            goto fail;
454
0
        }
455
456
0
        if (verbose != 0) {
457
0
            mbedtls_printf("passed\n");
458
0
        }
459
0
    }
460
461
0
    if (verbose != 0) {
462
0
        mbedtls_printf("\n");
463
0
    }
464
465
0
    goto exit;
466
467
0
fail:
468
0
    if (verbose != 0) {
469
0
        mbedtls_printf("failed\n");
470
0
    }
471
472
0
exit:
473
0
    mbedtls_sha1_free(&ctx);
474
475
0
    return ret;
476
0
}
477
478
#endif /* MBEDTLS_SELF_TEST */
479
480
#endif /* MBEDTLS_SHA1_C */