Lines Matching +full:- +full:10 +full:v
2 BLAKE2 reference source code package - reference C implementations
19 #include "blake2-impl.h"
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 }
48 S->f[1] = ~0ULL; in blake2b_set_lastnode()
54 S->f[1] = 0ULL; in blake2b_clear_lastnode()
61 if( S->last_node ) blake2b_set_lastnode( S ); in blake2b_set_lastblock()
63 S->f[0] = ~0ULL; in blake2b_set_lastblock()
69 if( S->last_node ) blake2b_clear_lastnode( S ); in blake2b_clear_lastblock()
71 S->f[0] = 0ULL; in blake2b_clear_lastblock()
77 S->t[0] += inc; in blake2b_increment_counter()
78 S->t[1] += ( S->t[0] < inc ); in blake2b_increment_counter()
84 // Parameter-related functions
87 P->digest_length = digest_length; in blake2b_param_set_digest_length()
93 P->fanout = fanout; in blake2b_param_set_fanout()
99 P->depth = depth; in blake2b_param_set_max_depth()
105 store32( &P->leaf_length, leaf_length ); in blake2b_param_set_leaf_length()
111 store64( &P->node_offset, node_offset ); in blake2b_param_set_node_offset()
117 P->node_depth = node_depth; in blake2b_param_set_node_depth()
123 P->inner_length = inner_length; in blake2b_param_set_inner_length()
129 memcpy( P->salt, salt, BLAKE2B_SALTBYTES ); in blake2b_param_set_salt()
135 memcpy( P->personal, personal, BLAKE2B_PERSONALBYTES ); in blake2b_param_set_personal()
143 for( int i = 0; i < 8; ++i ) S->h[i] = blake2b_IV[i]; in blake2b_init0()
176 S->h[i] ^= load64( p + sizeof( S->h[i] ) * i ); in blake2b_init_param()
178 S->outlen = P->digest_length; in blake2b_init_param()
188 if ( ( !outlen ) || ( outlen > BLAKE2B_OUTBYTES ) ) return -1; in blake2b_init()
190 P->digest_length = ( uint8_t ) outlen; in blake2b_init()
191 P->key_length = 0; in blake2b_init()
192 P->fanout = 1; in blake2b_init()
193 P->depth = 1; in blake2b_init()
194 store32( &P->leaf_length, 0 ); in blake2b_init()
195 store64( &P->node_offset, 0 ); in blake2b_init()
196 P->node_depth = 0; in blake2b_init()
197 P->inner_length = 0; in blake2b_init()
198 memset( P->reserved, 0, sizeof( P->reserved ) ); in blake2b_init()
199 memset( P->salt, 0, sizeof( P->salt ) ); in blake2b_init()
200 memset( P->personal, 0, sizeof( P->personal ) ); in blake2b_init()
209 if ( ( !outlen ) || ( outlen > BLAKE2B_OUTBYTES ) ) return -1; in blake2b_init_key()
211 if ( !key || !keylen || keylen > BLAKE2B_KEYBYTES ) return -1; in blake2b_init_key()
213 P->digest_length = ( uint8_t ) outlen; in blake2b_init_key()
214 P->key_length = ( uint8_t ) keylen; in blake2b_init_key()
215 P->fanout = 1; in blake2b_init_key()
216 P->depth = 1; in blake2b_init_key()
217 store32( &P->leaf_length, 0 ); in blake2b_init_key()
218 store64( &P->node_offset, 0 ); in blake2b_init_key()
219 P->node_depth = 0; in blake2b_init_key()
220 P->inner_length = 0; in blake2b_init_key()
221 memset( P->reserved, 0, sizeof( P->reserved ) ); in blake2b_init_key()
222 memset( P->salt, 0, sizeof( P->salt ) ); in blake2b_init_key()
223 memset( P->personal, 0, sizeof( P->personal ) ); in blake2b_init_key()
225 if( blake2b_init_param( S, P ) < 0 ) return -1; in blake2b_init_key()
240 uint64_t v[16]; in blake2b_compress() local
247 v[i] = S->h[i]; in blake2b_compress()
249 v[ 8] = blake2b_IV[0]; in blake2b_compress()
250 v[ 9] = blake2b_IV[1]; in blake2b_compress()
251 v[10] = blake2b_IV[2]; in blake2b_compress()
252 v[11] = blake2b_IV[3]; in blake2b_compress()
253 v[12] = S->t[0] ^ blake2b_IV[4]; in blake2b_compress()
254 v[13] = S->t[1] ^ blake2b_IV[5]; in blake2b_compress()
255 v[14] = S->f[0] ^ blake2b_IV[6]; in blake2b_compress()
256 v[15] = S->f[1] ^ blake2b_IV[7]; in blake2b_compress()
270 G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \ in blake2b_compress()
271 G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \ in blake2b_compress()
272 G(r,2,v[ 2],v[ 6],v[10],v[14]); \ in blake2b_compress()
273 G(r,3,v[ 3],v[ 7],v[11],v[15]); \ in blake2b_compress()
274 G(r,4,v[ 0],v[ 5],v[10],v[15]); \ in blake2b_compress()
275 G(r,5,v[ 1],v[ 6],v[11],v[12]); \ in blake2b_compress()
276 G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \ in blake2b_compress()
277 G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \ in blake2b_compress()
289 ROUND( 10 ); in blake2b_compress()
293 S->h[i] = S->h[i] ^ v[i] ^ v[i + 8]; in blake2b_compress()
305 uint32_t left = S->buflen; in blake2b_update()
306 uint32_t fill = 2 * BLAKE2B_BLOCKBYTES - left; in blake2b_update()
310 memcpy( S->buf + left, in, fill ); // Fill buffer in blake2b_update()
311 S->buflen += fill; in blake2b_update()
313 blake2b_compress( S, S->buf ); // Compress in blake2b_update()
314 memcpy( S->buf, S->buf + BLAKE2B_BLOCKBYTES, BLAKE2B_BLOCKBYTES ); // Shift buffer left in blake2b_update()
315 S->buflen -= BLAKE2B_BLOCKBYTES; in blake2b_update()
317 inlen -= fill; in blake2b_update()
321 memcpy( S->buf + left, in, inlen ); in blake2b_update()
322 S->buflen += ( uint32_t ) inlen; // Be lazy, do not compress in blake2b_update()
324 inlen -= inlen; in blake2b_update()
336 if(S->outlen != outlen) return -1; in blake2b_final()
338 if( S->buflen > BLAKE2B_BLOCKBYTES ) in blake2b_final()
341 blake2b_compress( S, S->buf ); in blake2b_final()
342 S->buflen -= BLAKE2B_BLOCKBYTES; in blake2b_final()
343 memcpy( S->buf, S->buf + BLAKE2B_BLOCKBYTES, S->buflen ); in blake2b_final()
346 blake2b_increment_counter( S, S->buflen ); in blake2b_final()
348 memset( S->buf + S->buflen, 0, 2 * BLAKE2B_BLOCKBYTES - S->buflen ); /* Padding */ in blake2b_final()
349 blake2b_compress( S, S->buf ); in blake2b_final()
352 store64( buffer + sizeof( S->h[i] ) * i, S->h[i] ); in blake2b_final()
363 if ( NULL == in && inlen > 0 ) return -1; in blake2b()
365 if ( NULL == out ) return -1; in blake2b()
367 if( NULL == key && keylen > 0 ) return -1; in blake2b()
369 if( !outlen || outlen > BLAKE2B_OUTBYTES ) return -1; in blake2b()
371 if( keylen > BLAKE2B_KEYBYTES ) return -1; in blake2b()
375 if( blake2b_init_key( S, outlen, key, keylen ) < 0 ) return -1; in blake2b()
379 if( blake2b_init( S, outlen ) < 0 ) return -1; in blake2b()
382 if( blake2b_update( S, ( uint8_t * )in, inlen ) < 0 ) return -1; in blake2b()