2 BLAKE2 reference source code package - reference C implementations
4 Copyright 2012, Samuel Neves <sneves@dei.uc.pt>. You may use this under the
5 terms of the CC0, the OpenSSL Licence, or the Apache Public License 2.0, at
6 your option. The terms of these licenses can be found at:
8 - CC0 1.0 Universal : http://creativecommons.org/publicdomain/zero/1.0
9 - OpenSSL license : https://www.openssl.org/source/license.html
10 - Apache 2.0 : http://www.apache.org/licenses/LICENSE-2.0
12 More information about the BLAKE2 hash function can be found at
16 #include "archive_platform.h"
26 #include "archive_blake2.h"
27 #include "archive_blake2_impl.h"
29 #define PARALLELISM_DEGREE 8
32 blake2sp_init_param defaults to setting the expecting output length
33 from the digest_length parameter block field.
35 In some cases, however, we do not want this, as the output length
36 of these instances is given by inner_length instead.
38 static int blake2sp_init_leaf_param( blake2s_state *S, const blake2s_param *P )
40 int err = blake2s_init_param(S, P);
41 S->outlen = P->inner_length;
45 static int blake2sp_init_leaf( blake2s_state *S, size_t outlen, size_t keylen, uint32_t offset )
48 P->digest_length = (uint8_t)outlen;
49 P->key_length = (uint8_t)keylen;
50 P->fanout = PARALLELISM_DEGREE;
52 store32( &P->leaf_length, 0 );
53 store32( &P->node_offset, offset );
54 store16( &P->xof_length, 0 );
56 P->inner_length = BLAKE2S_OUTBYTES;
57 memset( P->salt, 0, sizeof( P->salt ) );
58 memset( P->personal, 0, sizeof( P->personal ) );
59 return blake2sp_init_leaf_param( S, P );
62 static int blake2sp_init_root( blake2s_state *S, size_t outlen, size_t keylen )
65 P->digest_length = (uint8_t)outlen;
66 P->key_length = (uint8_t)keylen;
67 P->fanout = PARALLELISM_DEGREE;
69 store32( &P->leaf_length, 0 );
70 store32( &P->node_offset, 0 );
71 store16( &P->xof_length, 0 );
73 P->inner_length = BLAKE2S_OUTBYTES;
74 memset( P->salt, 0, sizeof( P->salt ) );
75 memset( P->personal, 0, sizeof( P->personal ) );
76 return blake2s_init_param( S, P );
80 int blake2sp_init( blake2sp_state *S, size_t outlen )
84 if( !outlen || outlen > BLAKE2S_OUTBYTES ) return -1;
86 memset( S->buf, 0, sizeof( S->buf ) );
90 if( blake2sp_init_root( S->R, outlen, 0 ) < 0 )
93 for( i = 0; i < PARALLELISM_DEGREE; ++i )
94 if( blake2sp_init_leaf( S->S[i], outlen, 0, (uint32_t)i ) < 0 ) return -1;
97 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
101 int blake2sp_init_key( blake2sp_state *S, size_t outlen, const void *key, size_t keylen )
105 if( !outlen || outlen > BLAKE2S_OUTBYTES ) return -1;
107 if( !key || !keylen || keylen > BLAKE2S_KEYBYTES ) return -1;
109 memset( S->buf, 0, sizeof( S->buf ) );
113 if( blake2sp_init_root( S->R, outlen, keylen ) < 0 )
116 for( i = 0; i < PARALLELISM_DEGREE; ++i )
117 if( blake2sp_init_leaf( S->S[i], outlen, keylen, (uint32_t)i ) < 0 ) return -1;
120 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
122 uint8_t block[BLAKE2S_BLOCKBYTES];
123 memset( block, 0, BLAKE2S_BLOCKBYTES );
124 memcpy( block, key, keylen );
126 for( i = 0; i < PARALLELISM_DEGREE; ++i )
127 blake2s_update( S->S[i], block, BLAKE2S_BLOCKBYTES );
129 secure_zero_memory( block, BLAKE2S_BLOCKBYTES ); /* Burn the key from stack */
135 int blake2sp_update( blake2sp_state *S, const void *pin, size_t inlen )
137 const unsigned char * in = (const unsigned char *)pin;
138 size_t left = S->buflen;
139 size_t fill = sizeof( S->buf ) - left;
142 if( left && inlen >= fill )
144 memcpy( S->buf + left, in, fill );
146 for( i = 0; i < PARALLELISM_DEGREE; ++i )
147 blake2s_update( S->S[i], S->buf + i * BLAKE2S_BLOCKBYTES, BLAKE2S_BLOCKBYTES );
155 #pragma omp parallel shared(S), num_threads(PARALLELISM_DEGREE)
157 for( i = 0; i < PARALLELISM_DEGREE; ++i )
161 size_t i = omp_get_thread_num();
163 size_t inlen__ = inlen;
164 const unsigned char *in__ = ( const unsigned char * )in;
165 in__ += i * BLAKE2S_BLOCKBYTES;
167 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES )
169 blake2s_update( S->S[i], in__, BLAKE2S_BLOCKBYTES );
170 in__ += PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
171 inlen__ -= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
175 in += inlen - inlen % ( PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES );
176 inlen %= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
179 memcpy( S->buf + left, in, inlen );
181 S->buflen = left + inlen;
186 int blake2sp_final( blake2sp_state *S, void *out, size_t outlen )
188 uint8_t hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES];
191 if(out == NULL || outlen < S->outlen) {
195 for( i = 0; i < PARALLELISM_DEGREE; ++i )
197 if( S->buflen > i * BLAKE2S_BLOCKBYTES )
199 size_t left = S->buflen - i * BLAKE2S_BLOCKBYTES;
201 if( left > BLAKE2S_BLOCKBYTES ) left = BLAKE2S_BLOCKBYTES;
203 blake2s_update( S->S[i], S->buf + i * BLAKE2S_BLOCKBYTES, left );
206 blake2s_final( S->S[i], hash[i], BLAKE2S_OUTBYTES );
209 for( i = 0; i < PARALLELISM_DEGREE; ++i )
210 blake2s_update( S->R, hash[i], BLAKE2S_OUTBYTES );
212 return blake2s_final( S->R, out, S->outlen );
216 int blake2sp( void *out, size_t outlen, const void *in, size_t inlen, const void *key, size_t keylen )
218 uint8_t hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES];
219 blake2s_state S[PARALLELISM_DEGREE][1];
223 /* Verify parameters */
224 if ( NULL == in && inlen > 0 ) return -1;
226 if ( NULL == out ) return -1;
228 if ( NULL == key && keylen > 0) return -1;
230 if( !outlen || outlen > BLAKE2S_OUTBYTES ) return -1;
232 if( keylen > BLAKE2S_KEYBYTES ) return -1;
234 for( i = 0; i < PARALLELISM_DEGREE; ++i )
235 if( blake2sp_init_leaf( S[i], outlen, keylen, (uint32_t)i ) < 0 ) return -1;
237 S[PARALLELISM_DEGREE - 1]->last_node = 1; /* mark last node */
241 uint8_t block[BLAKE2S_BLOCKBYTES];
242 memset( block, 0, BLAKE2S_BLOCKBYTES );
243 memcpy( block, key, keylen );
245 for( i = 0; i < PARALLELISM_DEGREE; ++i )
246 blake2s_update( S[i], block, BLAKE2S_BLOCKBYTES );
248 secure_zero_memory( block, BLAKE2S_BLOCKBYTES ); /* Burn the key from stack */
252 #pragma omp parallel shared(S,hash), num_threads(PARALLELISM_DEGREE)
255 for( i = 0; i < PARALLELISM_DEGREE; ++i )
259 size_t i = omp_get_thread_num();
261 size_t inlen__ = inlen;
262 const unsigned char *in__ = ( const unsigned char * )in;
263 in__ += i * BLAKE2S_BLOCKBYTES;
265 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES )
267 blake2s_update( S[i], in__, BLAKE2S_BLOCKBYTES );
268 in__ += PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
269 inlen__ -= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
272 if( inlen__ > i * BLAKE2S_BLOCKBYTES )
274 const size_t left = inlen__ - i * BLAKE2S_BLOCKBYTES;
275 const size_t len = left <= BLAKE2S_BLOCKBYTES ? left : BLAKE2S_BLOCKBYTES;
276 blake2s_update( S[i], in__, len );
279 blake2s_final( S[i], hash[i], BLAKE2S_OUTBYTES );
282 if( blake2sp_init_root( FS, outlen, keylen ) < 0 )
287 for( i = 0; i < PARALLELISM_DEGREE; ++i )
288 blake2s_update( FS, hash[i], BLAKE2S_OUTBYTES );
290 return blake2s_final( FS, out, outlen );
295 #if defined(BLAKE2SP_SELFTEST)
297 #include "blake2-kat.h"
300 uint8_t key[BLAKE2S_KEYBYTES];
301 uint8_t buf[BLAKE2_KAT_LENGTH];
304 for( i = 0; i < BLAKE2S_KEYBYTES; ++i )
305 key[i] = ( uint8_t )i;
307 for( i = 0; i < BLAKE2_KAT_LENGTH; ++i )
308 buf[i] = ( uint8_t )i;
310 /* Test simple API */
311 for( i = 0; i < BLAKE2_KAT_LENGTH; ++i )
313 uint8_t hash[BLAKE2S_OUTBYTES];
314 blake2sp( hash, BLAKE2S_OUTBYTES, buf, i, key, BLAKE2S_KEYBYTES );
316 if( 0 != memcmp( hash, blake2sp_keyed_kat[i], BLAKE2S_OUTBYTES ) )
322 /* Test streaming API */
323 for(step = 1; step < BLAKE2S_BLOCKBYTES; ++step) {
324 for (i = 0; i < BLAKE2_KAT_LENGTH; ++i) {
325 uint8_t hash[BLAKE2S_OUTBYTES];
331 if( (err = blake2sp_init_key(&S, BLAKE2S_OUTBYTES, key, BLAKE2S_KEYBYTES)) < 0 ) {
335 while (mlen >= step) {
336 if ( (err = blake2sp_update(&S, p, step)) < 0 ) {
342 if ( (err = blake2sp_update(&S, p, mlen)) < 0) {
345 if ( (err = blake2sp_final(&S, hash, BLAKE2S_OUTBYTES)) < 0) {
349 if (0 != memcmp(hash, blake2sp_keyed_kat[i], BLAKE2S_OUTBYTES)) {