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 : https://creativecommons.org/publicdomain/zero/1.0
9 - OpenSSL license : https://www.openssl.org/source/license.html
10 - Apache 2.0 : https://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 #ifdef HAVE_CONFIG_H
17 # include <config.h>
18 #endif
19
20 #include <stdint.h>
21 #include <string.h>
22 #include <stdio.h>
23
24 #include "blake2.h"
25 #include "blake2-impl.h"
26
27 static const uint64_t blake2b_IV[8] =
28 {
29 0x6a09e667f3bcc908ULL, 0xbb67ae8584caa73bULL,
30 0x3c6ef372fe94f82bULL, 0xa54ff53a5f1d36f1ULL,
31 0x510e527fade682d1ULL, 0x9b05688c2b3e6c1fULL,
32 0x1f83d9abfb41bd6bULL, 0x5be0cd19137e2179ULL
33 };
34
35 static const uint8_t blake2b_sigma[12][16] =
36 {
37 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } ,
38 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } ,
39 { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 } ,
40 { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 } ,
41 { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 } ,
42 { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 } ,
43 { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 } ,
44 { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 } ,
45 { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 } ,
46 { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13 , 0 } ,
47 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } ,
48 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 }
49 };
50
51
blake2b_set_lastnode(blake2b_state * S)52 static void blake2b_set_lastnode( blake2b_state *S )
53 {
54 S->f[1] = (uint64_t)-1;
55 }
56
57 /* Some helper functions, not necessarily useful */
blake2b_is_lastblock(const blake2b_state * S)58 static int blake2b_is_lastblock( const blake2b_state *S )
59 {
60 return S->f[0] != 0;
61 }
62
blake2b_set_lastblock(blake2b_state * S)63 static void blake2b_set_lastblock( blake2b_state *S )
64 {
65 if( S->last_node ) blake2b_set_lastnode( S );
66
67 S->f[0] = (uint64_t)-1;
68 }
69
blake2b_increment_counter(blake2b_state * S,const uint64_t inc)70 static void blake2b_increment_counter( blake2b_state *S, const uint64_t inc )
71 {
72 S->t[0] += inc;
73 S->t[1] += ( S->t[0] < inc );
74 }
75
blake2b_init0(blake2b_state * S)76 static void blake2b_init0( blake2b_state *S )
77 {
78 size_t i;
79 memset( S, 0, sizeof( blake2b_state ) );
80
81 for( i = 0; i < 8; ++i ) S->h[i] = blake2b_IV[i];
82 }
83
84 /* init xors IV with input parameter block */
blake2b_init_param(blake2b_state * S,const blake2b_param * P)85 int blake2b_init_param( blake2b_state *S, const blake2b_param *P )
86 {
87 const uint8_t *p = ( const uint8_t * )( P );
88 size_t i;
89
90 blake2b_init0( S );
91
92 /* IV XOR ParamBlock */
93 for( i = 0; i < 8; ++i )
94 S->h[i] ^= load64( p + sizeof( S->h[i] ) * i );
95
96 S->outlen = P->digest_length;
97 return 0;
98 }
99
100
101
blake2b_init(blake2b_state * S,size_t outlen)102 int blake2b_init( blake2b_state *S, size_t outlen )
103 {
104 blake2b_param P[1];
105
106 if ( ( !outlen ) || ( outlen > BLAKE2B_OUTBYTES ) ) return -1;
107
108 P->digest_length = (uint8_t)outlen;
109 P->key_length = 0;
110 P->fanout = 1;
111 P->depth = 1;
112 store32( &P->leaf_length, 0 );
113 store32( &P->node_offset, 0 );
114 store32( &P->xof_length, 0 );
115 P->node_depth = 0;
116 P->inner_length = 0;
117 memset( P->reserved, 0, sizeof( P->reserved ) );
118 memset( P->salt, 0, sizeof( P->salt ) );
119 memset( P->personal, 0, sizeof( P->personal ) );
120 return blake2b_init_param( S, P );
121 }
122
123
blake2b_init_key(blake2b_state * S,size_t outlen,const void * key,size_t keylen)124 int blake2b_init_key( blake2b_state *S, size_t outlen, const void *key, size_t keylen )
125 {
126 blake2b_param P[1];
127
128 if ( ( !outlen ) || ( outlen > BLAKE2B_OUTBYTES ) ) return -1;
129
130 if ( !key || !keylen || keylen > BLAKE2B_KEYBYTES ) return -1;
131
132 P->digest_length = (uint8_t)outlen;
133 P->key_length = (uint8_t)keylen;
134 P->fanout = 1;
135 P->depth = 1;
136 store32( &P->leaf_length, 0 );
137 store32( &P->node_offset, 0 );
138 store32( &P->xof_length, 0 );
139 P->node_depth = 0;
140 P->inner_length = 0;
141 memset( P->reserved, 0, sizeof( P->reserved ) );
142 memset( P->salt, 0, sizeof( P->salt ) );
143 memset( P->personal, 0, sizeof( P->personal ) );
144
145 if( blake2b_init_param( S, P ) < 0 ) return -1;
146
147 {
148 uint8_t block[BLAKE2B_BLOCKBYTES];
149 memset( block, 0, BLAKE2B_BLOCKBYTES );
150 memcpy( block, key, keylen );
151 blake2b_update( S, block, BLAKE2B_BLOCKBYTES );
152 secure_zero_memory( block, BLAKE2B_BLOCKBYTES ); /* Burn the key from stack */
153 }
154 return 0;
155 }
156
157 #define G(r,i,a,b,c,d) \
158 do { \
159 a = a + b + m[blake2b_sigma[r][2 * i + 0]]; \
160 d = rotr64(d ^ a, 32); \
161 c = c + d; \
162 b = rotr64(b ^ c, 24); \
163 a = a + b + m[blake2b_sigma[r][2 * i + 1]]; \
164 d = rotr64(d ^ a, 16); \
165 c = c + d; \
166 b = rotr64(b ^ c, 63); \
167 } while(0)
168
169 #define ROUND(r) \
170 do { \
171 G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \
172 G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \
173 G(r,2,v[ 2],v[ 6],v[10],v[14]); \
174 G(r,3,v[ 3],v[ 7],v[11],v[15]); \
175 G(r,4,v[ 0],v[ 5],v[10],v[15]); \
176 G(r,5,v[ 1],v[ 6],v[11],v[12]); \
177 G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \
178 G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \
179 } while(0)
180
blake2b_compress(blake2b_state * S,const uint8_t block[BLAKE2B_BLOCKBYTES])181 static void blake2b_compress( blake2b_state *S, const uint8_t block[BLAKE2B_BLOCKBYTES] )
182 {
183 uint64_t m[16];
184 uint64_t v[16];
185 size_t i;
186
187 for( i = 0; i < 16; ++i ) {
188 m[i] = load64( block + i * sizeof( m[i] ) );
189 }
190
191 for( i = 0; i < 8; ++i ) {
192 v[i] = S->h[i];
193 }
194
195 v[ 8] = blake2b_IV[0];
196 v[ 9] = blake2b_IV[1];
197 v[10] = blake2b_IV[2];
198 v[11] = blake2b_IV[3];
199 v[12] = blake2b_IV[4] ^ S->t[0];
200 v[13] = blake2b_IV[5] ^ S->t[1];
201 v[14] = blake2b_IV[6] ^ S->f[0];
202 v[15] = blake2b_IV[7] ^ S->f[1];
203
204 ROUND( 0 );
205 ROUND( 1 );
206 ROUND( 2 );
207 ROUND( 3 );
208 ROUND( 4 );
209 ROUND( 5 );
210 ROUND( 6 );
211 ROUND( 7 );
212 ROUND( 8 );
213 ROUND( 9 );
214 ROUND( 10 );
215 ROUND( 11 );
216
217 for( i = 0; i < 8; ++i ) {
218 S->h[i] = S->h[i] ^ v[i] ^ v[i + 8];
219 }
220 }
221
222 #undef G
223 #undef ROUND
224
blake2b_update(blake2b_state * S,const void * pin,size_t inlen)225 int blake2b_update( blake2b_state *S, const void *pin, size_t inlen )
226 {
227 const unsigned char * in = (const unsigned char *)pin;
228 if( inlen > 0 )
229 {
230 size_t left = S->buflen;
231 size_t fill = BLAKE2B_BLOCKBYTES - left;
232 if( inlen > fill )
233 {
234 S->buflen = 0;
235 memcpy( S->buf + left, in, fill ); /* Fill buffer */
236 blake2b_increment_counter( S, BLAKE2B_BLOCKBYTES );
237 blake2b_compress( S, S->buf ); /* Compress */
238 in += fill; inlen -= fill;
239 while(inlen > BLAKE2B_BLOCKBYTES) {
240 blake2b_increment_counter(S, BLAKE2B_BLOCKBYTES);
241 blake2b_compress( S, in );
242 in += BLAKE2B_BLOCKBYTES;
243 inlen -= BLAKE2B_BLOCKBYTES;
244 }
245 }
246 memcpy( S->buf + S->buflen, in, inlen );
247 S->buflen += inlen;
248 }
249 return 0;
250 }
251
blake2b_final(blake2b_state * S,void * out,size_t outlen)252 int blake2b_final( blake2b_state *S, void *out, size_t outlen )
253 {
254 uint8_t buffer[BLAKE2B_OUTBYTES] = {0};
255 size_t i;
256
257 if( out == NULL || outlen < S->outlen )
258 return -1;
259
260 if( blake2b_is_lastblock( S ) )
261 return -1;
262
263 blake2b_increment_counter( S, S->buflen );
264 blake2b_set_lastblock( S );
265 memset( S->buf + S->buflen, 0, BLAKE2B_BLOCKBYTES - S->buflen ); /* Padding */
266 blake2b_compress( S, S->buf );
267
268 for( i = 0; i < 8; ++i ) /* Output full hash to temp buffer */
269 store64( buffer + sizeof( S->h[i] ) * i, S->h[i] );
270
271 memcpy( out, buffer, S->outlen );
272 secure_zero_memory(buffer, sizeof(buffer));
273 return 0;
274 }
275
276 /* inlen, at least, should be uint64_t. Others can be size_t. */
blake2b(void * out,size_t outlen,const void * in,size_t inlen,const void * key,size_t keylen)277 int blake2b( void *out, size_t outlen, const void *in, size_t inlen, const void *key, size_t keylen )
278 {
279 blake2b_state S[1];
280
281 /* Verify parameters */
282 if ( NULL == in && inlen > 0 ) return -1;
283
284 if ( NULL == out ) return -1;
285
286 if( NULL == key && keylen > 0 ) return -1;
287
288 if( !outlen || outlen > BLAKE2B_OUTBYTES ) return -1;
289
290 if( keylen > BLAKE2B_KEYBYTES ) return -1;
291
292 if( keylen > 0 )
293 {
294 if( blake2b_init_key( S, outlen, key, keylen ) < 0 ) return -1;
295 }
296 else
297 {
298 if( blake2b_init( S, outlen ) < 0 ) return -1;
299 }
300
301 blake2b_update( S, ( const uint8_t * )in, inlen );
302 blake2b_final( S, out, outlen );
303 return 0;
304 }
305
blake2(void * out,size_t outlen,const void * in,size_t inlen,const void * key,size_t keylen)306 int blake2( void *out, size_t outlen, const void *in, size_t inlen, const void *key, size_t keylen ) {
307 return blake2b(out, outlen, in, inlen, key, keylen);
308 }
309
310 #if defined(SUPERCOP)
crypto_hash(unsigned char * out,unsigned char * in,unsigned long long inlen)311 int crypto_hash( unsigned char *out, unsigned char *in, unsigned long long inlen )
312 {
313 return blake2b( out, BLAKE2B_OUTBYTES, in, inlen, NULL, 0 );
314 }
315 #endif
316
317 #if defined(BLAKE2B_SELFTEST)
318 #include <string.h>
319 #include "blake2-kat.h"
main(void)320 int main( void )
321 {
322 uint8_t key[BLAKE2B_KEYBYTES];
323 uint8_t buf[BLAKE2_KAT_LENGTH];
324 size_t i, step;
325
326 for( i = 0; i < BLAKE2B_KEYBYTES; ++i )
327 key[i] = ( uint8_t )i;
328
329 for( i = 0; i < BLAKE2_KAT_LENGTH; ++i )
330 buf[i] = ( uint8_t )i;
331
332 /* Test simple API */
333 for( i = 0; i < BLAKE2_KAT_LENGTH; ++i )
334 {
335 uint8_t hash[BLAKE2B_OUTBYTES];
336 blake2b( hash, BLAKE2B_OUTBYTES, buf, i, key, BLAKE2B_KEYBYTES );
337
338 if( 0 != memcmp( hash, blake2b_keyed_kat[i], BLAKE2B_OUTBYTES ) )
339 {
340 goto fail;
341 }
342 }
343
344 /* Test streaming API */
345 for(step = 1; step < BLAKE2B_BLOCKBYTES; ++step) {
346 for (i = 0; i < BLAKE2_KAT_LENGTH; ++i) {
347 uint8_t hash[BLAKE2B_OUTBYTES];
348 blake2b_state S;
349 uint8_t * p = buf;
350 size_t mlen = i;
351 int err = 0;
352
353 if( (err = blake2b_init_key(&S, BLAKE2B_OUTBYTES, key, BLAKE2B_KEYBYTES)) < 0 ) {
354 goto fail;
355 }
356
357 while (mlen >= step) {
358 if ( (err = blake2b_update(&S, p, step)) < 0 ) {
359 goto fail;
360 }
361 mlen -= step;
362 p += step;
363 }
364 if ( (err = blake2b_update(&S, p, mlen)) < 0) {
365 goto fail;
366 }
367 if ( (err = blake2b_final(&S, hash, BLAKE2B_OUTBYTES)) < 0) {
368 goto fail;
369 }
370
371 if (0 != memcmp(hash, blake2b_keyed_kat[i], BLAKE2B_OUTBYTES)) {
372 goto fail;
373 }
374 }
375 }
376
377 puts( "ok" );
378 return 0;
379 fail:
380 puts("error");
381 return -1;
382 }
383 #endif
384