/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 | 156k | { |
48 | 156k | S->f[0] = -1; |
49 | 156k | } |
50 | | |
51 | | /* Initialize the hashing state. */ |
52 | | static ossl_inline void blake2b_init0(BLAKE2B_CTX *S) |
53 | 157k | { |
54 | 157k | int i; |
55 | | |
56 | 157k | memset(S, 0, sizeof(BLAKE2B_CTX)); |
57 | 1.41M | for (i = 0; i < 8; ++i) { |
58 | 1.25M | S->h[i] = blake2b_IV[i]; |
59 | 1.25M | } |
60 | 157k | } |
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 | 157k | { |
65 | 157k | size_t i; |
66 | 157k | const uint8_t *p = (const uint8_t *)(P); |
67 | | |
68 | 157k | blake2b_init0(S); |
69 | 157k | S->outlen = P->digest_length; |
70 | | |
71 | | /* The param struct is carefully hand packed, and should be 64 bytes on |
72 | | * every platform. */ |
73 | 157k | assert(sizeof(BLAKE2B_PARAM) == 64); |
74 | | /* IV XOR ParamBlock */ |
75 | 1.41M | for (i = 0; i < 8; ++i) { |
76 | 1.25M | S->h[i] ^= load64(p + sizeof(S->h[i]) * i); |
77 | 1.25M | } |
78 | 157k | } |
79 | | |
80 | | /* Initialize the parameter block with default values */ |
81 | | void ossl_blake2b_param_init(BLAKE2B_PARAM *P) |
82 | 153k | { |
83 | 153k | P->digest_length = BLAKE2B_DIGEST_LENGTH; |
84 | 153k | P->key_length = 0; |
85 | 153k | P->fanout = 1; |
86 | 153k | P->depth = 1; |
87 | 153k | store32(P->leaf_length, 0); |
88 | 153k | store64(P->node_offset, 0); |
89 | 153k | P->node_depth = 0; |
90 | 153k | P->inner_length = 0; |
91 | 153k | memset(P->reserved, 0, sizeof(P->reserved)); |
92 | 153k | memset(P->salt, 0, sizeof(P->salt)); |
93 | 153k | memset(P->personal, 0, sizeof(P->personal)); |
94 | 153k | } |
95 | | |
96 | | void ossl_blake2b_param_set_digest_length(BLAKE2B_PARAM *P, uint8_t outlen) |
97 | 152k | { |
98 | 152k | P->digest_length = outlen; |
99 | 152k | } |
100 | | |
101 | | void ossl_blake2b_param_set_key_length(BLAKE2B_PARAM *P, uint8_t keylen) |
102 | 3.61k | { |
103 | 3.61k | P->key_length = keylen; |
104 | 3.61k | } |
105 | | |
106 | | void ossl_blake2b_param_set_personal(BLAKE2B_PARAM *P, const uint8_t *personal, |
107 | | size_t len) |
108 | 205 | { |
109 | 205 | memcpy(P->personal, personal, len); |
110 | 205 | memset(P->personal + len, 0, BLAKE2B_PERSONALBYTES - len); |
111 | 205 | } |
112 | | |
113 | | void ossl_blake2b_param_set_salt(BLAKE2B_PARAM *P, const uint8_t *salt, |
114 | | size_t len) |
115 | 190 | { |
116 | 190 | memcpy(P->salt, salt, len); |
117 | 190 | memset(P->salt + len, 0, BLAKE2B_SALTBYTES - len); |
118 | 190 | } |
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 | 153k | { |
126 | 153k | blake2b_init_param(c, P); |
127 | 153k | return 1; |
128 | 153k | } |
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.37k | { |
137 | 3.37k | blake2b_init_param(c, P); |
138 | | |
139 | | /* Pad the key to form first data block */ |
140 | 3.37k | { |
141 | 3.37k | uint8_t block[BLAKE2B_BLOCKBYTES] = { 0 }; |
142 | | |
143 | 3.37k | memcpy(block, key, P->key_length); |
144 | 3.37k | ossl_blake2b_update(c, block, BLAKE2B_BLOCKBYTES); |
145 | 3.37k | OPENSSL_cleanse(block, BLAKE2B_BLOCKBYTES); |
146 | 3.37k | } |
147 | | |
148 | 3.37k | return 1; |
149 | 3.37k | } |
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 | 238k | { |
156 | 238k | uint64_t m[16]; |
157 | 238k | uint64_t v[16]; |
158 | 238k | int i; |
159 | 238k | 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 | 238k | 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 | 238k | increment = len < BLAKE2B_BLOCKBYTES ? len : BLAKE2B_BLOCKBYTES; |
181 | | |
182 | 2.14M | for (i = 0; i < 8; ++i) { |
183 | 1.90M | v[i] = S->h[i]; |
184 | 1.90M | } |
185 | | |
186 | 615k | do { |
187 | 10.4M | for (i = 0; i < 16; ++i) { |
188 | 9.84M | m[i] = load64(blocks + i * sizeof(m[i])); |
189 | 9.84M | } |
190 | | |
191 | | /* blake2b_increment_counter */ |
192 | 615k | S->t[0] += increment; |
193 | 615k | S->t[1] += (S->t[0] < increment); |
194 | | |
195 | 615k | v[8] = blake2b_IV[0]; |
196 | 615k | v[9] = blake2b_IV[1]; |
197 | 615k | v[10] = blake2b_IV[2]; |
198 | 615k | v[11] = blake2b_IV[3]; |
199 | 615k | v[12] = S->t[0] ^ blake2b_IV[4]; |
200 | 615k | v[13] = S->t[1] ^ blake2b_IV[5]; |
201 | 615k | v[14] = S->f[0] ^ blake2b_IV[6]; |
202 | 615k | v[15] = S->f[1] ^ blake2b_IV[7]; |
203 | 615k | #define G(r, i, a, b, c, d) \ |
204 | 59.0M | do { \ |
205 | 59.0M | a = a + b + m[blake2b_sigma[r][2 * i + 0]]; \ |
206 | 59.0M | d = rotr64(d ^ a, 32); \ |
207 | 59.0M | c = c + d; \ |
208 | 59.0M | b = rotr64(b ^ c, 24); \ |
209 | 59.0M | a = a + b + m[blake2b_sigma[r][2 * i + 1]]; \ |
210 | 59.0M | d = rotr64(d ^ a, 16); \ |
211 | 59.0M | c = c + d; \ |
212 | 59.0M | b = rotr64(b ^ c, 63); \ |
213 | 59.0M | } while (0) |
214 | 615k | #define ROUND(r) \ |
215 | 7.38M | do { \ |
216 | 7.38M | G(r, 0, v[0], v[4], v[8], v[12]); \ |
217 | 7.38M | G(r, 1, v[1], v[5], v[9], v[13]); \ |
218 | 7.38M | G(r, 2, v[2], v[6], v[10], v[14]); \ |
219 | 7.38M | G(r, 3, v[3], v[7], v[11], v[15]); \ |
220 | 7.38M | G(r, 4, v[0], v[5], v[10], v[15]); \ |
221 | 7.38M | G(r, 5, v[1], v[6], v[11], v[12]); \ |
222 | 7.38M | G(r, 6, v[2], v[7], v[8], v[13]); \ |
223 | 7.38M | G(r, 7, v[3], v[4], v[9], v[14]); \ |
224 | 7.38M | } 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 | 615k | ROUND(0); |
232 | 615k | ROUND(1); |
233 | 615k | ROUND(2); |
234 | 615k | ROUND(3); |
235 | 615k | ROUND(4); |
236 | 615k | ROUND(5); |
237 | 615k | ROUND(6); |
238 | 615k | ROUND(7); |
239 | 615k | ROUND(8); |
240 | 615k | ROUND(9); |
241 | 615k | ROUND(10); |
242 | 615k | ROUND(11); |
243 | 615k | #endif |
244 | | |
245 | 5.53M | for (i = 0; i < 8; ++i) { |
246 | 4.92M | S->h[i] = v[i] ^= v[i + 8] ^ S->h[i]; |
247 | 4.92M | } |
248 | 615k | #undef G |
249 | 615k | #undef ROUND |
250 | 615k | blocks += increment; |
251 | 615k | len -= increment; |
252 | 615k | } while (len); |
253 | 238k | } |
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 | 291k | { |
258 | 291k | const uint8_t *in = data; |
259 | 291k | 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 | 291k | fill = sizeof(c->buf) - c->buflen; |
270 | 291k | if (datalen > fill) { |
271 | 56.4k | if (c->buflen) { |
272 | 56.3k | memcpy(c->buf + c->buflen, in, fill); /* Fill buffer */ |
273 | 56.3k | blake2b_compress(c, c->buf, BLAKE2B_BLOCKBYTES); |
274 | 56.3k | c->buflen = 0; |
275 | 56.3k | in += fill; |
276 | 56.3k | datalen -= fill; |
277 | 56.3k | } |
278 | 56.4k | if (datalen > BLAKE2B_BLOCKBYTES) { |
279 | 25.1k | 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 | 25.1k | stashlen = stashlen ? stashlen : BLAKE2B_BLOCKBYTES; |
285 | 25.1k | datalen -= stashlen; |
286 | 25.1k | blake2b_compress(c, in, datalen); |
287 | 25.1k | in += datalen; |
288 | 25.1k | datalen = stashlen; |
289 | 25.1k | } |
290 | 56.4k | } |
291 | | |
292 | 291k | assert(datalen <= BLAKE2B_BLOCKBYTES); |
293 | | |
294 | 291k | memcpy(c->buf + c->buflen, in, datalen); |
295 | 291k | c->buflen += datalen; /* Be lazy, do not compress */ |
296 | | |
297 | 291k | return 1; |
298 | 291k | } |
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 | 156k | { |
306 | 156k | uint8_t outbuffer[BLAKE2B_OUTBYTES] = { 0 }; |
307 | 156k | uint8_t *target = outbuffer; |
308 | 156k | int iter = (c->outlen + 7) / 8; |
309 | 156k | int i; |
310 | | |
311 | | /* Avoid writing to the temporary buffer if possible */ |
312 | 156k | if ((c->outlen % sizeof(c->h[0])) == 0) |
313 | 156k | target = md; |
314 | | |
315 | 156k | blake2b_set_lastblock(c); |
316 | | /* Padding */ |
317 | 156k | memset(c->buf + c->buflen, 0, sizeof(c->buf) - c->buflen); |
318 | 156k | blake2b_compress(c, c->buf, c->buflen); |
319 | | |
320 | | /* Output full hash to buffer */ |
321 | 1.41M | for (i = 0; i < iter; ++i) |
322 | 1.25M | store64(target + sizeof(c->h[i]) * i, c->h[i]); |
323 | | |
324 | 156k | if (target != md) { |
325 | 77 | memcpy(md, target, c->outlen); |
326 | 77 | OPENSSL_cleanse(target, sizeof(outbuffer)); |
327 | 77 | } |
328 | | |
329 | 156k | OPENSSL_cleanse(c, sizeof(BLAKE2B_CTX)); |
330 | 156k | return 1; |
331 | 156k | } |