Coverage Report

Created: 2026-02-14 07:20

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/openssl30/providers/implementations/digests/blake2b_prov.c
Line
Count
Source
1
/*
2
 * Copyright 2016-2024 The OpenSSL Project Authors. All Rights Reserved.
3
 *
4
 * Licensed under the Apache License 2.0 (the "License").  You may not use
5
 * this file except in compliance with the License.  You can obtain a copy
6
 * in the file LICENSE in the source distribution or at
7
 * https://www.openssl.org/source/license.html
8
 */
9
10
/*
11
 * Derived from the BLAKE2 reference implementation written by Samuel Neves.
12
 * Copyright 2012, Samuel Neves <sneves@dei.uc.pt>
13
 * More information about the BLAKE2 hash function and its implementations
14
 * can be found at https://blake2.net.
15
 */
16
17
#include <assert.h>
18
#include <string.h>
19
#include <openssl/crypto.h>
20
#include "blake2_impl.h"
21
#include "prov/blake2.h"
22
23
static const uint64_t blake2b_IV[8] = {
24
    0x6a09e667f3bcc908ULL, 0xbb67ae8584caa73bULL,
25
    0x3c6ef372fe94f82bULL, 0xa54ff53a5f1d36f1ULL,
26
    0x510e527fade682d1ULL, 0x9b05688c2b3e6c1fULL,
27
    0x1f83d9abfb41bd6bULL, 0x5be0cd19137e2179ULL
28
};
29
30
static const uint8_t blake2b_sigma[12][16] = {
31
    { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 },
32
    { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 },
33
    { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 },
34
    { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 },
35
    { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 },
36
    { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 },
37
    { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 },
38
    { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 },
39
    { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 },
40
    { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0 },
41
    { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 },
42
    { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 }
43
};
44
45
/* Set that it's the last block we'll compress */
46
static ossl_inline void blake2b_set_lastblock(BLAKE2B_CTX *S)
47
1.39M
{
48
1.39M
    S->f[0] = -1;
49
1.39M
}
50
51
/* Initialize the hashing state. */
52
static ossl_inline void blake2b_init0(BLAKE2B_CTX *S)
53
1.39M
{
54
1.39M
    int i;
55
56
1.39M
    memset(S, 0, sizeof(BLAKE2B_CTX));
57
12.5M
    for (i = 0; i < 8; ++i) {
58
11.1M
        S->h[i] = blake2b_IV[i];
59
11.1M
    }
60
1.39M
}
61
62
/* init xors IV with input parameter block and sets the output length */
63
static void blake2b_init_param(BLAKE2B_CTX *S, const BLAKE2B_PARAM *P)
64
1.39M
{
65
1.39M
    size_t i;
66
1.39M
    const uint8_t *p = (const uint8_t *)(P);
67
68
1.39M
    blake2b_init0(S);
69
1.39M
    S->outlen = P->digest_length;
70
71
    /* The param struct is carefully hand packed, and should be 64 bytes on
72
     * every platform. */
73
1.39M
    assert(sizeof(BLAKE2B_PARAM) == 64);
74
    /* IV XOR ParamBlock */
75
12.5M
    for (i = 0; i < 8; ++i) {
76
11.1M
        S->h[i] ^= load64(p + sizeof(S->h[i]) * i);
77
11.1M
    }
78
1.39M
}
79
80
/* Initialize the parameter block with default values */
81
void ossl_blake2b_param_init(BLAKE2B_PARAM *P)
82
1.39M
{
83
1.39M
    P->digest_length = BLAKE2B_DIGEST_LENGTH;
84
1.39M
    P->key_length = 0;
85
1.39M
    P->fanout = 1;
86
1.39M
    P->depth = 1;
87
1.39M
    store32(P->leaf_length, 0);
88
1.39M
    store64(P->node_offset, 0);
89
1.39M
    P->node_depth = 0;
90
1.39M
    P->inner_length = 0;
91
1.39M
    memset(P->reserved, 0, sizeof(P->reserved));
92
1.39M
    memset(P->salt, 0, sizeof(P->salt));
93
1.39M
    memset(P->personal, 0, sizeof(P->personal));
94
1.39M
}
95
96
void ossl_blake2b_param_set_digest_length(BLAKE2B_PARAM *P, uint8_t outlen)
97
158k
{
98
158k
    P->digest_length = outlen;
99
158k
}
100
101
void ossl_blake2b_param_set_key_length(BLAKE2B_PARAM *P, uint8_t keylen)
102
3.76k
{
103
3.76k
    P->key_length = keylen;
104
3.76k
}
105
106
void ossl_blake2b_param_set_personal(BLAKE2B_PARAM *P, const uint8_t *personal,
107
    size_t len)
108
187
{
109
187
    memcpy(P->personal, personal, len);
110
187
    memset(P->personal + len, 0, BLAKE2B_PERSONALBYTES - len);
111
187
}
112
113
void ossl_blake2b_param_set_salt(BLAKE2B_PARAM *P, const uint8_t *salt,
114
    size_t len)
115
170
{
116
170
    memcpy(P->salt, salt, len);
117
170
    memset(P->salt + len, 0, BLAKE2B_SALTBYTES - len);
118
170
}
119
120
/*
121
 * Initialize the hashing context with the given parameter block.
122
 * Always returns 1.
123
 */
124
int ossl_blake2b_init(BLAKE2B_CTX *c, const BLAKE2B_PARAM *P)
125
1.39M
{
126
1.39M
    blake2b_init_param(c, P);
127
1.39M
    return 1;
128
1.39M
}
129
130
/*
131
 * Initialize the hashing context with the given parameter block and key.
132
 * Always returns 1.
133
 */
134
int ossl_blake2b_init_key(BLAKE2B_CTX *c, const BLAKE2B_PARAM *P,
135
    const void *key)
136
3.55k
{
137
3.55k
    blake2b_init_param(c, P);
138
139
    /* Pad the key to form first data block */
140
3.55k
    {
141
3.55k
        uint8_t block[BLAKE2B_BLOCKBYTES] = { 0 };
142
143
3.55k
        memcpy(block, key, P->key_length);
144
3.55k
        ossl_blake2b_update(c, block, BLAKE2B_BLOCKBYTES);
145
3.55k
        OPENSSL_cleanse(block, BLAKE2B_BLOCKBYTES);
146
3.55k
    }
147
148
3.55k
    return 1;
149
3.55k
}
150
151
/* Permute the state while xoring in the block of data. */
152
static void blake2b_compress(BLAKE2B_CTX *S,
153
    const uint8_t *blocks,
154
    size_t len)
155
1.40M
{
156
1.40M
    uint64_t m[16];
157
1.40M
    uint64_t v[16];
158
1.40M
    int i;
159
1.40M
    size_t increment;
160
161
    /*
162
     * There are two distinct usage vectors for this function:
163
     *
164
     * a) BLAKE2b_Update uses it to process complete blocks,
165
     *    possibly more than one at a time;
166
     *
167
     * b) BLAK2b_Final uses it to process last block, always
168
     *    single but possibly incomplete, in which case caller
169
     *    pads input with zeros.
170
     */
171
1.40M
    assert(len < BLAKE2B_BLOCKBYTES || len % BLAKE2B_BLOCKBYTES == 0);
172
173
    /*
174
     * Since last block is always processed with separate call,
175
     * |len| not being multiple of complete blocks can be observed
176
     * only with |len| being less than BLAKE2B_BLOCKBYTES ("less"
177
     * including even zero), which is why following assignment doesn't
178
     * have to reside inside the main loop below.
179
     */
180
1.40M
    increment = len < BLAKE2B_BLOCKBYTES ? len : BLAKE2B_BLOCKBYTES;
181
182
12.6M
    for (i = 0; i < 8; ++i) {
183
11.2M
        v[i] = S->h[i];
184
11.2M
    }
185
186
1.64M
    do {
187
28.0M
        for (i = 0; i < 16; ++i) {
188
26.3M
            m[i] = load64(blocks + i * sizeof(m[i]));
189
26.3M
        }
190
191
        /* blake2b_increment_counter */
192
1.64M
        S->t[0] += increment;
193
1.64M
        S->t[1] += (S->t[0] < increment);
194
195
1.64M
        v[8] = blake2b_IV[0];
196
1.64M
        v[9] = blake2b_IV[1];
197
1.64M
        v[10] = blake2b_IV[2];
198
1.64M
        v[11] = blake2b_IV[3];
199
1.64M
        v[12] = S->t[0] ^ blake2b_IV[4];
200
1.64M
        v[13] = S->t[1] ^ blake2b_IV[5];
201
1.64M
        v[14] = S->f[0] ^ blake2b_IV[6];
202
1.64M
        v[15] = S->f[1] ^ blake2b_IV[7];
203
1.64M
#define G(r, i, a, b, c, d)                         \
204
158M
    do {                                            \
205
158M
        a = a + b + m[blake2b_sigma[r][2 * i + 0]]; \
206
158M
        d = rotr64(d ^ a, 32);                      \
207
158M
        c = c + d;                                  \
208
158M
        b = rotr64(b ^ c, 24);                      \
209
158M
        a = a + b + m[blake2b_sigma[r][2 * i + 1]]; \
210
158M
        d = rotr64(d ^ a, 16);                      \
211
158M
        c = c + d;                                  \
212
158M
        b = rotr64(b ^ c, 63);                      \
213
158M
    } while (0)
214
1.64M
#define ROUND(r)                           \
215
19.7M
    do {                                   \
216
19.7M
        G(r, 0, v[0], v[4], v[8], v[12]);  \
217
19.7M
        G(r, 1, v[1], v[5], v[9], v[13]);  \
218
19.7M
        G(r, 2, v[2], v[6], v[10], v[14]); \
219
19.7M
        G(r, 3, v[3], v[7], v[11], v[15]); \
220
19.7M
        G(r, 4, v[0], v[5], v[10], v[15]); \
221
19.7M
        G(r, 5, v[1], v[6], v[11], v[12]); \
222
19.7M
        G(r, 6, v[2], v[7], v[8], v[13]);  \
223
19.7M
        G(r, 7, v[3], v[4], v[9], v[14]);  \
224
19.7M
    } while (0)
225
#if defined(OPENSSL_SMALL_FOOTPRINT)
226
        /* 3x size reduction on x86_64, almost 7x on ARMv8, 9x on ARMv4 */
227
        for (i = 0; i < 12; i++) {
228
            ROUND(i);
229
        }
230
#else
231
1.64M
        ROUND(0);
232
1.64M
        ROUND(1);
233
1.64M
        ROUND(2);
234
1.64M
        ROUND(3);
235
1.64M
        ROUND(4);
236
1.64M
        ROUND(5);
237
1.64M
        ROUND(6);
238
1.64M
        ROUND(7);
239
1.64M
        ROUND(8);
240
1.64M
        ROUND(9);
241
1.64M
        ROUND(10);
242
1.64M
        ROUND(11);
243
1.64M
#endif
244
245
14.8M
        for (i = 0; i < 8; ++i) {
246
13.1M
            S->h[i] = v[i] ^= v[i + 8] ^ S->h[i];
247
13.1M
        }
248
1.64M
#undef G
249
1.64M
#undef ROUND
250
1.64M
        blocks += increment;
251
1.64M
        len -= increment;
252
1.64M
    } while (len);
253
1.40M
}
254
255
/* Absorb the input data into the hash state.  Always returns 1. */
256
int ossl_blake2b_update(BLAKE2B_CTX *c, const void *data, size_t datalen)
257
1.40M
{
258
1.40M
    const uint8_t *in = data;
259
1.40M
    size_t fill;
260
261
    /*
262
     * Intuitively one would expect intermediate buffer, c->buf, to
263
     * store incomplete blocks. But in this case we are interested to
264
     * temporarily stash even complete blocks, because last one in the
265
     * stream has to be treated in special way, and at this point we
266
     * don't know if last block in *this* call is last one "ever". This
267
     * is the reason for why |datalen| is compared as >, and not >=.
268
     */
269
1.40M
    fill = sizeof(c->buf) - c->buflen;
270
1.40M
    if (datalen > fill) {
271
6.09k
        if (c->buflen) {
272
6.03k
            memcpy(c->buf + c->buflen, in, fill); /* Fill buffer */
273
6.03k
            blake2b_compress(c, c->buf, BLAKE2B_BLOCKBYTES);
274
6.03k
            c->buflen = 0;
275
6.03k
            in += fill;
276
6.03k
            datalen -= fill;
277
6.03k
        }
278
6.09k
        if (datalen > BLAKE2B_BLOCKBYTES) {
279
741
            size_t stashlen = datalen % BLAKE2B_BLOCKBYTES;
280
            /*
281
             * If |datalen| is a multiple of the blocksize, stash
282
             * last complete block, it can be final one...
283
             */
284
741
            stashlen = stashlen ? stashlen : BLAKE2B_BLOCKBYTES;
285
741
            datalen -= stashlen;
286
741
            blake2b_compress(c, in, datalen);
287
741
            in += datalen;
288
741
            datalen = stashlen;
289
741
        }
290
6.09k
    }
291
292
1.40M
    assert(datalen <= BLAKE2B_BLOCKBYTES);
293
294
1.40M
    memcpy(c->buf + c->buflen, in, datalen);
295
1.40M
    c->buflen += datalen; /* Be lazy, do not compress */
296
297
1.40M
    return 1;
298
1.40M
}
299
300
/*
301
 * Calculate the final hash and save it in md.
302
 * Always returns 1.
303
 */
304
int ossl_blake2b_final(unsigned char *md, BLAKE2B_CTX *c)
305
1.39M
{
306
1.39M
    uint8_t outbuffer[BLAKE2B_OUTBYTES] = { 0 };
307
1.39M
    uint8_t *target = outbuffer;
308
1.39M
    int iter = (c->outlen + 7) / 8;
309
1.39M
    int i;
310
311
    /* Avoid writing to the temporary buffer if possible */
312
1.39M
    if ((c->outlen % sizeof(c->h[0])) == 0)
313
1.39M
        target = md;
314
315
1.39M
    blake2b_set_lastblock(c);
316
    /* Padding */
317
1.39M
    memset(c->buf + c->buflen, 0, sizeof(c->buf) - c->buflen);
318
1.39M
    blake2b_compress(c, c->buf, c->buflen);
319
320
    /* Output full hash to buffer */
321
12.5M
    for (i = 0; i < iter; ++i)
322
11.1M
        store64(target + sizeof(c->h[i]) * i, c->h[i]);
323
324
1.39M
    if (target != md) {
325
64
        memcpy(md, target, c->outlen);
326
64
        OPENSSL_cleanse(target, sizeof(outbuffer));
327
64
    }
328
329
1.39M
    OPENSSL_cleanse(c, sizeof(BLAKE2B_CTX));
330
1.39M
    return 1;
331
1.39M
}