1 /*
2 BLAKE2 reference source code package - reference C implementations
3
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:
7
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
11
12 More information about the BLAKE2 hash function can be found at
13 https://blake2.net.
14 */
15
16 #include "archive_platform.h"
17
18 #include <stdlib.h>
19 #include <string.h>
20 #include <stdio.h>
21
22 #if defined(_OPENMP)
23 #include <omp.h>
24 #endif
25
26 #include "archive_blake2.h"
27 #include "archive_blake2_impl.h"
28
29 #define PARALLELISM_DEGREE 8
30
31 /*
32 blake2sp_init_param defaults to setting the expecting output length
33 from the digest_length parameter block field.
34
35 In some cases, however, we do not want this, as the output length
36 of these instances is given by inner_length instead.
37 */
blake2sp_init_leaf_param(blake2s_state * S,const blake2s_param * P)38 static int blake2sp_init_leaf_param( blake2s_state *S, const blake2s_param *P )
39 {
40 int err = blake2s_init_param(S, P);
41 S->outlen = P->inner_length;
42 return err;
43 }
44
blake2sp_init_leaf(blake2s_state * S,size_t outlen,size_t keylen,uint32_t offset)45 static int blake2sp_init_leaf( blake2s_state *S, size_t outlen, size_t keylen, uint32_t offset )
46 {
47 blake2s_param P[1];
48 P->digest_length = (uint8_t)outlen;
49 P->key_length = (uint8_t)keylen;
50 P->fanout = PARALLELISM_DEGREE;
51 P->depth = 2;
52 store32( &P->leaf_length, 0 );
53 store32( &P->node_offset, offset );
54 store16( &P->xof_length, 0 );
55 P->node_depth = 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 );
60 }
61
blake2sp_init_root(blake2s_state * S,size_t outlen,size_t keylen)62 static int blake2sp_init_root( blake2s_state *S, size_t outlen, size_t keylen )
63 {
64 blake2s_param P[1];
65 P->digest_length = (uint8_t)outlen;
66 P->key_length = (uint8_t)keylen;
67 P->fanout = PARALLELISM_DEGREE;
68 P->depth = 2;
69 store32( &P->leaf_length, 0 );
70 store32( &P->node_offset, 0 );
71 store16( &P->xof_length, 0 );
72 P->node_depth = 1;
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 );
77 }
78
79
blake2sp_init(blake2sp_state * S,size_t outlen)80 int blake2sp_init( blake2sp_state *S, size_t outlen )
81 {
82 size_t i;
83
84 if( !outlen || outlen > BLAKE2S_OUTBYTES ) return -1;
85
86 memset( S->buf, 0, sizeof( S->buf ) );
87 S->buflen = 0;
88 S->outlen = outlen;
89
90 if( blake2sp_init_root( S->R, outlen, 0 ) < 0 )
91 return -1;
92
93 for( i = 0; i < PARALLELISM_DEGREE; ++i )
94 if( blake2sp_init_leaf( S->S[i], outlen, 0, (uint32_t)i ) < 0 ) return -1;
95
96 S->R->last_node = 1;
97 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
98 return 0;
99 }
100
blake2sp_init_key(blake2sp_state * S,size_t outlen,const void * key,size_t keylen)101 int blake2sp_init_key( blake2sp_state *S, size_t outlen, const void *key, size_t keylen )
102 {
103 size_t i;
104
105 if( !outlen || outlen > BLAKE2S_OUTBYTES ) return -1;
106
107 if( !key || !keylen || keylen > BLAKE2S_KEYBYTES ) return -1;
108
109 memset( S->buf, 0, sizeof( S->buf ) );
110 S->buflen = 0;
111 S->outlen = outlen;
112
113 if( blake2sp_init_root( S->R, outlen, keylen ) < 0 )
114 return -1;
115
116 for( i = 0; i < PARALLELISM_DEGREE; ++i )
117 if( blake2sp_init_leaf( S->S[i], outlen, keylen, (uint32_t)i ) < 0 ) return -1;
118
119 S->R->last_node = 1;
120 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
121 {
122 uint8_t block[BLAKE2S_BLOCKBYTES];
123 memset( block, 0, BLAKE2S_BLOCKBYTES );
124 memcpy( block, key, keylen );
125
126 for( i = 0; i < PARALLELISM_DEGREE; ++i )
127 blake2s_update( S->S[i], block, BLAKE2S_BLOCKBYTES );
128
129 secure_zero_memory( block, BLAKE2S_BLOCKBYTES ); /* Burn the key from stack */
130 }
131 return 0;
132 }
133
134
blake2sp_update(blake2sp_state * S,const void * pin,size_t inlen)135 int blake2sp_update( blake2sp_state *S, const void *pin, size_t inlen )
136 {
137 const unsigned char * in = (const unsigned char *)pin;
138 size_t left = S->buflen;
139 size_t fill = sizeof( S->buf ) - left;
140 size_t i;
141
142 if( left && inlen >= fill )
143 {
144 memcpy( S->buf + left, in, fill );
145
146 for( i = 0; i < PARALLELISM_DEGREE; ++i )
147 blake2s_update( S->S[i], S->buf + i * BLAKE2S_BLOCKBYTES, BLAKE2S_BLOCKBYTES );
148
149 in += fill;
150 inlen -= fill;
151 left = 0;
152 }
153
154 #if defined(_OPENMP)
155 #pragma omp parallel shared(S), num_threads(PARALLELISM_DEGREE)
156 #else
157 for( i = 0; i < PARALLELISM_DEGREE; ++i )
158 #endif
159 {
160 #if defined(_OPENMP)
161 size_t i = omp_get_thread_num();
162 #endif
163 size_t inlen__ = inlen;
164 const unsigned char *in__ = ( const unsigned char * )in;
165 in__ += i * BLAKE2S_BLOCKBYTES;
166
167 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES )
168 {
169 blake2s_update( S->S[i], in__, BLAKE2S_BLOCKBYTES );
170 in__ += PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
171 inlen__ -= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
172 }
173 }
174
175 in += inlen - inlen % ( PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES );
176 inlen %= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
177
178 if( inlen > 0 )
179 memcpy( S->buf + left, in, inlen );
180
181 S->buflen = left + inlen;
182 return 0;
183 }
184
185
blake2sp_final(blake2sp_state * S,void * out,size_t outlen)186 int blake2sp_final( blake2sp_state *S, void *out, size_t outlen )
187 {
188 uint8_t hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES];
189 size_t i;
190
191 if(out == NULL || outlen < S->outlen) {
192 return -1;
193 }
194
195 for( i = 0; i < PARALLELISM_DEGREE; ++i )
196 {
197 if( S->buflen > i * BLAKE2S_BLOCKBYTES )
198 {
199 size_t left = S->buflen - i * BLAKE2S_BLOCKBYTES;
200
201 if( left > BLAKE2S_BLOCKBYTES ) left = BLAKE2S_BLOCKBYTES;
202
203 blake2s_update( S->S[i], S->buf + i * BLAKE2S_BLOCKBYTES, left );
204 }
205
206 blake2s_final( S->S[i], hash[i], BLAKE2S_OUTBYTES );
207 }
208
209 for( i = 0; i < PARALLELISM_DEGREE; ++i )
210 blake2s_update( S->R, hash[i], BLAKE2S_OUTBYTES );
211
212 return blake2s_final( S->R, out, S->outlen );
213 }
214
215
blake2sp(void * out,size_t outlen,const void * in,size_t inlen,const void * key,size_t keylen)216 int blake2sp( void *out, size_t outlen, const void *in, size_t inlen, const void *key, size_t keylen )
217 {
218 uint8_t hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES];
219 blake2s_state S[PARALLELISM_DEGREE][1];
220 blake2s_state FS[1];
221 size_t i;
222
223 /* Verify parameters */
224 if ( NULL == in && inlen > 0 ) return -1;
225
226 if ( NULL == out ) return -1;
227
228 if ( NULL == key && keylen > 0) return -1;
229
230 if( !outlen || outlen > BLAKE2S_OUTBYTES ) return -1;
231
232 if( keylen > BLAKE2S_KEYBYTES ) return -1;
233
234 for( i = 0; i < PARALLELISM_DEGREE; ++i )
235 if( blake2sp_init_leaf( S[i], outlen, keylen, (uint32_t)i ) < 0 ) return -1;
236
237 S[PARALLELISM_DEGREE - 1]->last_node = 1; /* mark last node */
238
239 if( keylen > 0 )
240 {
241 uint8_t block[BLAKE2S_BLOCKBYTES];
242 memset( block, 0, BLAKE2S_BLOCKBYTES );
243 memcpy( block, key, keylen );
244
245 for( i = 0; i < PARALLELISM_DEGREE; ++i )
246 blake2s_update( S[i], block, BLAKE2S_BLOCKBYTES );
247
248 secure_zero_memory( block, BLAKE2S_BLOCKBYTES ); /* Burn the key from stack */
249 }
250
251 #if defined(_OPENMP)
252 #pragma omp parallel shared(S,hash), num_threads(PARALLELISM_DEGREE)
253 #else
254
255 for( i = 0; i < PARALLELISM_DEGREE; ++i )
256 #endif
257 {
258 #if defined(_OPENMP)
259 size_t i = omp_get_thread_num();
260 #endif
261 size_t inlen__ = inlen;
262 const unsigned char *in__ = ( const unsigned char * )in;
263 in__ += i * BLAKE2S_BLOCKBYTES;
264
265 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES )
266 {
267 blake2s_update( S[i], in__, BLAKE2S_BLOCKBYTES );
268 in__ += PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
269 inlen__ -= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
270 }
271
272 if( inlen__ > i * BLAKE2S_BLOCKBYTES )
273 {
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 );
277 }
278
279 blake2s_final( S[i], hash[i], BLAKE2S_OUTBYTES );
280 }
281
282 if( blake2sp_init_root( FS, outlen, keylen ) < 0 )
283 return -1;
284
285 FS->last_node = 1;
286
287 for( i = 0; i < PARALLELISM_DEGREE; ++i )
288 blake2s_update( FS, hash[i], BLAKE2S_OUTBYTES );
289
290 return blake2s_final( FS, out, outlen );
291 }
292
293
294
295 #if defined(BLAKE2SP_SELFTEST)
296 #include <string.h>
297 #include "blake2-kat.h"
main(void)298 int main( void )
299 {
300 uint8_t key[BLAKE2S_KEYBYTES];
301 uint8_t buf[BLAKE2_KAT_LENGTH];
302 size_t i, step;
303
304 for( i = 0; i < BLAKE2S_KEYBYTES; ++i )
305 key[i] = ( uint8_t )i;
306
307 for( i = 0; i < BLAKE2_KAT_LENGTH; ++i )
308 buf[i] = ( uint8_t )i;
309
310 /* Test simple API */
311 for( i = 0; i < BLAKE2_KAT_LENGTH; ++i )
312 {
313 uint8_t hash[BLAKE2S_OUTBYTES];
314 blake2sp( hash, BLAKE2S_OUTBYTES, buf, i, key, BLAKE2S_KEYBYTES );
315
316 if( 0 != memcmp( hash, blake2sp_keyed_kat[i], BLAKE2S_OUTBYTES ) )
317 {
318 goto fail;
319 }
320 }
321
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];
326 blake2sp_state S;
327 uint8_t * p = buf;
328 size_t mlen = i;
329 int err = 0;
330
331 if( (err = blake2sp_init_key(&S, BLAKE2S_OUTBYTES, key, BLAKE2S_KEYBYTES)) < 0 ) {
332 goto fail;
333 }
334
335 while (mlen >= step) {
336 if ( (err = blake2sp_update(&S, p, step)) < 0 ) {
337 goto fail;
338 }
339 mlen -= step;
340 p += step;
341 }
342 if ( (err = blake2sp_update(&S, p, mlen)) < 0) {
343 goto fail;
344 }
345 if ( (err = blake2sp_final(&S, hash, BLAKE2S_OUTBYTES)) < 0) {
346 goto fail;
347 }
348
349 if (0 != memcmp(hash, blake2sp_keyed_kat[i], BLAKE2S_OUTBYTES)) {
350 goto fail;
351 }
352 }
353 }
354
355 puts( "ok" );
356 return 0;
357 fail:
358 puts("error");
359 return -1;
360 }
361 #endif
362