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