2 BLAKE2 reference source code package - optimized C implementations
4 Written in 2012 by Samuel Neves <sneves@dei.uc.pt>
6 To the extent possible under law, the author(s) have dedicated all copyright
7 and related and neighboring rights to this software to the public domain
8 worldwide. This software is distributed without any warranty.
10 You should have received a copy of the CC0 Public Domain Dedication along with
11 this software. If not, see <http://creativecommons.org/publicdomain/zero/1.0/>.
24 #include "blake2-impl.h"
26 #define PARALLELISM_DEGREE 4
28 static int blake2bp_init_leaf( blake2b_state *S, uint8_t outlen, uint8_t keylen, uint64_t offset )
31 P->digest_length = outlen;
32 P->key_length = keylen;
33 P->fanout = PARALLELISM_DEGREE;
35 store32(&P->leaf_length, 0);
36 store64(&P->node_offset, offset);
38 P->inner_length = BLAKE2B_OUTBYTES;
39 memset( P->reserved, 0, sizeof( P->reserved ) );
40 memset( P->salt, 0, sizeof( P->salt ) );
41 memset( P->personal, 0, sizeof( P->personal ) );
42 blake2b_init_param( S, P );
43 S->outlen = P->inner_length;
47 static int blake2bp_init_root( blake2b_state *S, uint8_t outlen, uint8_t keylen )
50 P->digest_length = outlen;
51 P->key_length = keylen;
52 P->fanout = PARALLELISM_DEGREE;
54 store32(&P->leaf_length, 0);
55 store64(&P->node_offset, 0);
57 P->inner_length = BLAKE2B_OUTBYTES;
58 memset( P->reserved, 0, sizeof( P->reserved ) );
59 memset( P->salt, 0, sizeof( P->salt ) );
60 memset( P->personal, 0, sizeof( P->personal ) );
61 blake2b_init_param( S, P );
62 S->outlen = P->digest_length;
67 int blake2bp_init( blake2bp_state *S, size_t outlen )
69 if( !outlen || outlen > BLAKE2B_OUTBYTES ) return -1;
71 memset( S->buf, 0, sizeof( S->buf ) );
74 if( blake2bp_init_root( S->R, ( uint8_t ) outlen, 0 ) < 0 )
77 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
78 if( blake2bp_init_leaf( S->S[i], ( uint8_t ) outlen, 0, i ) < 0 ) return -1;
81 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
82 S->outlen = ( uint8_t ) outlen;
86 int blake2bp_init_key( blake2bp_state *S, size_t outlen, const void *key, size_t keylen )
88 if( !outlen || outlen > BLAKE2B_OUTBYTES ) return -1;
90 if( !key || !keylen || keylen > BLAKE2B_KEYBYTES ) return -1;
92 memset( S->buf, 0, sizeof( S->buf ) );
95 if( blake2bp_init_root( S->R, ( uint8_t ) outlen, ( uint8_t ) keylen ) < 0 )
98 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
99 if( blake2bp_init_leaf( S->S[i], ( uint8_t ) outlen, ( uint8_t ) keylen, i ) < 0 )
103 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
104 S->outlen = ( uint8_t ) outlen;
106 uint8_t block[BLAKE2B_BLOCKBYTES];
107 memset( block, 0, BLAKE2B_BLOCKBYTES );
108 memcpy( block, key, keylen );
110 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
111 blake2b_update( S->S[i], block, BLAKE2B_BLOCKBYTES );
113 secure_zero_memory( block, BLAKE2B_BLOCKBYTES ); /* Burn the key from stack */
119 int blake2bp_update( blake2bp_state *S, const uint8_t *in, size_t inlen )
121 size_t left = S->buflen;
122 size_t fill = sizeof( S->buf ) - left;
124 if( left && inlen >= fill )
126 memcpy( S->buf + left, in, fill );
128 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
129 blake2b_update( S->S[i], S->buf + i * BLAKE2B_BLOCKBYTES, BLAKE2B_BLOCKBYTES );
137 omp_set_num_threads(PARALLELISM_DEGREE);
138 #pragma omp parallel shared(S)
140 for( size_t id__ = 0; id__ < PARALLELISM_DEGREE; ++id__ )
144 size_t id__ = ( size_t ) omp_get_thread_num();
146 size_t inlen__ = inlen;
147 const uint8_t *in__ = ( const uint8_t * )in;
148 in__ += id__ * BLAKE2B_BLOCKBYTES;
150 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES )
152 blake2b_update( S->S[id__], in__, BLAKE2B_BLOCKBYTES );
153 in__ += PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
154 inlen__ -= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
158 in += inlen - inlen % ( PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES );
159 inlen %= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
162 memcpy( S->buf + left, in, inlen );
164 S->buflen = ( uint32_t ) left + ( uint32_t ) inlen;
170 int blake2bp_final( blake2bp_state *S, uint8_t *out, size_t outlen )
172 uint8_t hash[PARALLELISM_DEGREE][BLAKE2B_OUTBYTES];
174 if(S->outlen != outlen) return -1;
176 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
178 if( S->buflen > i * BLAKE2B_BLOCKBYTES )
180 size_t left = S->buflen - i * BLAKE2B_BLOCKBYTES;
182 if( left > BLAKE2B_BLOCKBYTES ) left = BLAKE2B_BLOCKBYTES;
184 blake2b_update( S->S[i], S->buf + i * BLAKE2B_BLOCKBYTES, left );
187 blake2b_final( S->S[i], hash[i], BLAKE2B_OUTBYTES );
190 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
191 blake2b_update( S->R, hash[i], BLAKE2B_OUTBYTES );
193 return blake2b_final( S->R, out, outlen );
196 int blake2bp( uint8_t *out, const void *in, const void *key, size_t outlen, size_t inlen, size_t keylen )
198 uint8_t hash[PARALLELISM_DEGREE][BLAKE2B_OUTBYTES];
199 blake2b_state S[PARALLELISM_DEGREE][1];
202 /* Verify parameters */
203 if ( NULL == in && inlen > 0 ) return -1;
205 if ( NULL == out ) return -1;
207 if ( NULL == key && keylen > 0) return -1;
209 if( !outlen || outlen > BLAKE2B_OUTBYTES ) return -1;
211 if( keylen > BLAKE2B_KEYBYTES ) return -1;
213 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
214 if( blake2bp_init_leaf( S[i], ( uint8_t ) outlen, ( uint8_t ) keylen, i ) < 0 )
217 S[PARALLELISM_DEGREE - 1]->last_node = 1; // mark last node
221 uint8_t block[BLAKE2B_BLOCKBYTES];
222 memset( block, 0, BLAKE2B_BLOCKBYTES );
223 memcpy( block, key, keylen );
225 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
226 blake2b_update( S[i], block, BLAKE2B_BLOCKBYTES );
228 secure_zero_memory( block, BLAKE2B_BLOCKBYTES ); /* Burn the key from stack */
232 omp_set_num_threads(PARALLELISM_DEGREE);
233 #pragma omp parallel shared(S,hash)
235 for( size_t id__ = 0; id__ < PARALLELISM_DEGREE; ++id__ )
239 size_t id__ = ( size_t ) omp_get_thread_num();
241 size_t inlen__ = inlen;
242 const uint8_t *in__ = ( const uint8_t * )in;
243 in__ += id__ * BLAKE2B_BLOCKBYTES;
245 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES )
247 blake2b_update( S[id__], in__, BLAKE2B_BLOCKBYTES );
248 in__ += PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
249 inlen__ -= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
252 if( inlen__ > id__ * BLAKE2B_BLOCKBYTES )
254 const size_t left = inlen__ - id__ * BLAKE2B_BLOCKBYTES;
255 const size_t len = left <= BLAKE2B_BLOCKBYTES ? left : BLAKE2B_BLOCKBYTES;
256 blake2b_update( S[id__], in__, len );
259 blake2b_final( S[id__], hash[id__], BLAKE2B_OUTBYTES );
262 if( blake2bp_init_root( FS, ( uint8_t ) outlen, ( uint8_t ) keylen ) < 0 )
265 FS->last_node = 1; // Mark as last node
267 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
268 blake2b_update( FS, hash[i], BLAKE2B_OUTBYTES );
270 return blake2b_final( FS, out, outlen );