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