Coverage Report

Created: 2025-06-22 06:56

/src/openssl/providers/implementations/digests/blake2s_prov.c
Line
Count
Source (jump to first uncovered line)
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 uint32_t blake2s_IV[8] = {
24
    0x6A09E667U, 0xBB67AE85U, 0x3C6EF372U, 0xA54FF53AU,
25
    0x510E527FU, 0x9B05688CU, 0x1F83D9ABU, 0x5BE0CD19U
26
};
27
28
static const uint8_t blake2s_sigma[10][16] = {
29
    {  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15 } ,
30
    { 14, 10,  4,  8,  9, 15, 13,  6,  1, 12,  0,  2, 11,  7,  5,  3 } ,
31
    { 11,  8, 12,  0,  5,  2, 15, 13, 10, 14,  3,  6,  7,  1,  9,  4 } ,
32
    {  7,  9,  3,  1, 13, 12, 11, 14,  2,  6,  5, 10,  4,  0, 15,  8 } ,
33
    {  9,  0,  5,  7,  2,  4, 10, 15, 14,  1, 11, 12,  6,  8,  3, 13 } ,
34
    {  2, 12,  6, 10,  0, 11,  8,  3,  4, 13,  7,  5, 15, 14,  1,  9 } ,
35
    { 12,  5,  1, 15, 14, 13,  4, 10,  0,  7,  6,  3,  9,  2,  8, 11 } ,
36
    { 13, 11,  7, 14, 12,  1,  3,  9,  5,  0, 15,  4,  8,  6,  2, 10 } ,
37
    {  6, 15, 14,  9, 11,  3,  0,  8, 12,  2, 13,  7,  1,  4, 10,  5 } ,
38
    { 10,  2,  8,  4,  7,  6,  1,  5, 15, 11,  9, 14,  3, 12, 13 , 0 } ,
39
};
40
41
/* Set that it's the last block we'll compress */
42
static ossl_inline void blake2s_set_lastblock(BLAKE2S_CTX *S)
43
77
{
44
77
    S->f[0] = -1;
45
77
}
46
47
/* Initialize the hashing state. */
48
static ossl_inline void blake2s_init0(BLAKE2S_CTX *S)
49
154
{
50
154
    int i;
51
52
154
    memset(S, 0, sizeof(BLAKE2S_CTX));
53
1.38k
    for (i = 0; i < 8; ++i) {
54
1.23k
        S->h[i] = blake2s_IV[i];
55
1.23k
    }
56
154
}
57
58
/* init xors IV with input parameter block and sets the output length */
59
static void blake2s_init_param(BLAKE2S_CTX *S, const BLAKE2S_PARAM *P)
60
154
{
61
154
    size_t i;
62
154
    const uint8_t *p = (const uint8_t *)(P);
63
64
154
    blake2s_init0(S);
65
154
    S->outlen = P->digest_length;
66
67
    /* The param struct is carefully hand packed, and should be 32 bytes on
68
     * every platform. */
69
154
    assert(sizeof(BLAKE2S_PARAM) == 32);
70
    /* IV XOR ParamBlock */
71
1.38k
    for (i = 0; i < 8; ++i) {
72
1.23k
        S->h[i] ^= load32(&p[i*4]);
73
1.23k
    }
74
154
}
75
76
void ossl_blake2s_param_init(BLAKE2S_PARAM *P)
77
154
{
78
154
    P->digest_length = BLAKE2S_DIGEST_LENGTH;
79
154
    P->key_length    = 0;
80
154
    P->fanout        = 1;
81
154
    P->depth         = 1;
82
154
    store32(P->leaf_length, 0);
83
154
    store48(P->node_offset, 0);
84
154
    P->node_depth    = 0;
85
154
    P->inner_length  = 0;
86
154
    memset(P->salt,     0, sizeof(P->salt));
87
154
    memset(P->personal, 0, sizeof(P->personal));
88
154
}
89
90
void ossl_blake2s_param_set_digest_length(BLAKE2S_PARAM *P, uint8_t outlen)
91
0
{
92
0
    P->digest_length = outlen;
93
0
}
94
95
void ossl_blake2s_param_set_key_length(BLAKE2S_PARAM *P, uint8_t keylen)
96
0
{
97
0
    P->key_length = keylen;
98
0
}
99
100
void ossl_blake2s_param_set_personal(BLAKE2S_PARAM *P, const uint8_t *personal,
101
                                     size_t len)
102
0
{
103
0
    memcpy(P->personal, personal, len);
104
0
    memset(P->personal + len, 0, BLAKE2S_PERSONALBYTES - len);
105
0
}
106
107
void ossl_blake2s_param_set_salt(BLAKE2S_PARAM *P, const uint8_t *salt,
108
                                 size_t len)
109
0
{
110
0
    memcpy(P->salt, salt, len);
111
0
    memset(P->salt + len, 0, BLAKE2S_SALTBYTES - len);}
112
113
/*
114
 * Initialize the hashing context with the given parameter block.
115
 * Always returns 1.
116
 */
117
int ossl_blake2s_init(BLAKE2S_CTX *c, const BLAKE2S_PARAM *P)
118
154
{
119
154
    blake2s_init_param(c, P);
120
154
    return 1;
121
154
}
122
123
/*
124
 * Initialize the hashing context with the given parameter block and key.
125
 * Always returns 1.
126
 */
127
int ossl_blake2s_init_key(BLAKE2S_CTX *c, const BLAKE2S_PARAM *P,
128
                          const void *key)
129
0
{
130
0
    blake2s_init_param(c, P);
131
132
    /* Pad the key to form first data block */
133
0
    {
134
0
        uint8_t block[BLAKE2S_BLOCKBYTES] = {0};
135
136
0
        memcpy(block, key, P->key_length);
137
0
        ossl_blake2s_update(c, block, BLAKE2S_BLOCKBYTES);
138
0
        OPENSSL_cleanse(block, BLAKE2S_BLOCKBYTES);
139
0
    }
140
141
0
    return 1;
142
0
}
143
144
/* Permute the state while xoring in the block of data. */
145
static void blake2s_compress(BLAKE2S_CTX *S,
146
                            const uint8_t *blocks,
147
                            size_t len)
148
308
{
149
308
    uint32_t m[16];
150
308
    uint32_t v[16];
151
308
    size_t i;
152
308
    size_t increment;
153
154
    /*
155
     * There are two distinct usage vectors for this function:
156
     *
157
     * a) BLAKE2s_Update uses it to process complete blocks,
158
     *    possibly more than one at a time;
159
     *
160
     * b) BLAK2s_Final uses it to process last block, always
161
     *    single but possibly incomplete, in which case caller
162
     *    pads input with zeros.
163
     */
164
308
    assert(len < BLAKE2S_BLOCKBYTES || len % BLAKE2S_BLOCKBYTES == 0);
165
166
    /*
167
     * Since last block is always processed with separate call,
168
     * |len| not being multiple of complete blocks can be observed
169
     * only with |len| being less than BLAKE2S_BLOCKBYTES ("less"
170
     * including even zero), which is why following assignment doesn't
171
     * have to reside inside the main loop below.
172
     */
173
308
    increment = len < BLAKE2S_BLOCKBYTES ? len : BLAKE2S_BLOCKBYTES;
174
175
2.77k
    for (i = 0; i < 8; ++i) {
176
2.46k
        v[i] = S->h[i];
177
2.46k
    }
178
179
1.50M
    do {
180
25.6M
        for (i = 0; i < 16; ++i) {
181
24.1M
            m[i] = load32(blocks + i * sizeof(m[i]));
182
24.1M
        }
183
184
        /* blake2s_increment_counter */
185
1.50M
        S->t[0] += increment;
186
1.50M
        S->t[1] += (S->t[0] < increment);
187
188
1.50M
        v[ 8] = blake2s_IV[0];
189
1.50M
        v[ 9] = blake2s_IV[1];
190
1.50M
        v[10] = blake2s_IV[2];
191
1.50M
        v[11] = blake2s_IV[3];
192
1.50M
        v[12] = S->t[0] ^ blake2s_IV[4];
193
1.50M
        v[13] = S->t[1] ^ blake2s_IV[5];
194
1.50M
        v[14] = S->f[0] ^ blake2s_IV[6];
195
1.50M
        v[15] = S->f[1] ^ blake2s_IV[7];
196
1.50M
#define G(r,i,a,b,c,d) \
197
120M
        do { \
198
120M
            a = a + b + m[blake2s_sigma[r][2*i+0]]; \
199
120M
            d = rotr32(d ^ a, 16); \
200
120M
            c = c + d; \
201
120M
            b = rotr32(b ^ c, 12); \
202
120M
            a = a + b + m[blake2s_sigma[r][2*i+1]]; \
203
120M
            d = rotr32(d ^ a, 8); \
204
120M
            c = c + d; \
205
120M
            b = rotr32(b ^ c, 7); \
206
120M
        } while (0)
207
1.50M
#define ROUND(r)  \
208
15.0M
        do { \
209
15.0M
            G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \
210
15.0M
            G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \
211
15.0M
            G(r,2,v[ 2],v[ 6],v[10],v[14]); \
212
15.0M
            G(r,3,v[ 3],v[ 7],v[11],v[15]); \
213
15.0M
            G(r,4,v[ 0],v[ 5],v[10],v[15]); \
214
15.0M
            G(r,5,v[ 1],v[ 6],v[11],v[12]); \
215
15.0M
            G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \
216
15.0M
            G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \
217
15.0M
        } while (0)
218
#if defined(OPENSSL_SMALL_FOOTPRINT)
219
        /* almost 3x reduction on x86_64, 4.5x on ARMv8, 4x on ARMv4 */
220
        for (i = 0; i < 10; i++) {
221
            ROUND(i);
222
        }
223
#else
224
1.50M
        ROUND(0);
225
1.50M
        ROUND(1);
226
1.50M
        ROUND(2);
227
1.50M
        ROUND(3);
228
1.50M
        ROUND(4);
229
1.50M
        ROUND(5);
230
1.50M
        ROUND(6);
231
1.50M
        ROUND(7);
232
1.50M
        ROUND(8);
233
1.50M
        ROUND(9);
234
1.50M
#endif
235
236
13.5M
        for (i = 0; i < 8; ++i) {
237
12.0M
            S->h[i] = v[i] ^= v[i + 8] ^ S->h[i];
238
12.0M
        }
239
1.50M
#undef G
240
1.50M
#undef ROUND
241
1.50M
        blocks += increment;
242
1.50M
        len -= increment;
243
1.50M
    } while (len);
244
308
}
245
246
/* Absorb the input data into the hash state.  Always returns 1. */
247
int ossl_blake2s_update(BLAKE2S_CTX *c, const void *data, size_t datalen)
248
154
{
249
154
    const uint8_t *in = data;
250
154
    size_t fill;
251
252
    /*
253
     * Intuitively one would expect intermediate buffer, c->buf, to
254
     * store incomplete blocks. But in this case we are interested to
255
     * temporarily stash even complete blocks, because last one in the
256
     * stream has to be treated in special way, and at this point we
257
     * don't know if last block in *this* call is last one "ever". This
258
     * is the reason for why |datalen| is compared as >, and not >=.
259
     */
260
154
    fill = sizeof(c->buf) - c->buflen;
261
154
    if (datalen > fill) {
262
154
        if (c->buflen) {
263
77
            memcpy(c->buf + c->buflen, in, fill); /* Fill buffer */
264
77
            blake2s_compress(c, c->buf, BLAKE2S_BLOCKBYTES);
265
77
            c->buflen = 0;
266
77
            in += fill;
267
77
            datalen -= fill;
268
77
        }
269
154
        if (datalen > BLAKE2S_BLOCKBYTES) {
270
154
            size_t stashlen = datalen % BLAKE2S_BLOCKBYTES;
271
            /*
272
             * If |datalen| is a multiple of the blocksize, stash
273
             * last complete block, it can be final one...
274
             */
275
154
            stashlen = stashlen ? stashlen : BLAKE2S_BLOCKBYTES;
276
154
            datalen -= stashlen;
277
154
            blake2s_compress(c, in, datalen);
278
154
            in += datalen;
279
154
            datalen = stashlen;
280
154
        }
281
154
    }
282
283
154
    assert(datalen <= BLAKE2S_BLOCKBYTES);
284
285
154
    memcpy(c->buf + c->buflen, in, datalen);
286
154
    c->buflen += datalen; /* Be lazy, do not compress */
287
288
154
    return 1;
289
154
}
290
291
/*
292
 * Calculate the final hash and save it in md.
293
 * Always returns 1.
294
 */
295
int ossl_blake2s_final(unsigned char *md, BLAKE2S_CTX *c)
296
77
{
297
77
    uint8_t outbuffer[BLAKE2S_OUTBYTES] = {0};
298
77
    uint8_t *target = outbuffer;
299
77
    int iter = (c->outlen + 3) / 4;
300
77
    int i;
301
302
    /* Avoid writing to the temporary buffer if possible */
303
77
    if ((c->outlen % sizeof(c->h[0])) == 0)
304
77
        target = md;
305
306
77
    blake2s_set_lastblock(c);
307
    /* Padding */
308
77
    memset(c->buf + c->buflen, 0, sizeof(c->buf) - c->buflen);
309
77
    blake2s_compress(c, c->buf, c->buflen);
310
311
    /* Output full hash to buffer */
312
693
    for (i = 0; i < iter; ++i)
313
616
        store32(target + sizeof(c->h[i]) * i, c->h[i]);
314
315
77
    if (target != md) {
316
0
        memcpy(md, target, c->outlen);
317
0
        OPENSSL_cleanse(target, sizeof(outbuffer));
318
0
    }
319
320
77
    OPENSSL_cleanse(c, sizeof(BLAKE2S_CTX));
321
77
    return 1;
322
77
}