Python code coverage for Modules/_blake2/impl/blake2s-ref.c

#	count	content
1	n/a	/*
2	n/a	BLAKE2 reference source code package - reference C implementations
3	n/a
4	n/a	Copyright 2012, Samuel Neves <sneves@dei.uc.pt>. You may use this under the
5	n/a	terms of the CC0, the OpenSSL Licence, or the Apache Public License 2.0, at
6	n/a	your option. The terms of these licenses can be found at:
7	n/a
8	n/a	- CC0 1.0 Universal : http://creativecommons.org/publicdomain/zero/1.0
9	n/a	- OpenSSL license : https://www.openssl.org/source/license.html
10	n/a	- Apache 2.0 : http://www.apache.org/licenses/LICENSE-2.0
11	n/a
12	n/a	More information about the BLAKE2 hash function can be found at
13	n/a	https://blake2.net.
14	n/a	*/
15	n/a
16	n/a	#include <stdint.h>
17	n/a	#include <string.h>
18	n/a	#include <stdio.h>
19	n/a
20	n/a	#include "blake2.h"
21	n/a	#include "blake2-impl.h"
22	n/a
23	n/a	static const uint32_t blake2s_IV[8] =
24	n/a	{
25	n/a	0x6A09E667UL, 0xBB67AE85UL, 0x3C6EF372UL, 0xA54FF53AUL,
26	n/a	0x510E527FUL, 0x9B05688CUL, 0x1F83D9ABUL, 0x5BE0CD19UL
27	n/a	};
28	n/a
29	n/a	static const uint8_t blake2s_sigma[10][16] =
30	n/a	{
31	n/a	{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } ,
32	n/a	{ 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } ,
33	n/a	{ 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 } ,
34	n/a	{ 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 } ,
35	n/a	{ 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 } ,
36	n/a	{ 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 } ,
37	n/a	{ 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 } ,
38	n/a	{ 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 } ,
39	n/a	{ 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 } ,
40	n/a	{ 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13 , 0 } ,
41	n/a	};
42	n/a
43	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_set_lastnode( blake2s_state *S )
44	n/a	{
45	n/a	S->f[1] = -1;
46	n/a	return 0;
47	n/a	}
48	n/a
49	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_clear_lastnode( blake2s_state *S )
50	n/a	{
51	n/a	S->f[1] = 0;
52	n/a	return 0;
53	n/a	}
54	n/a
55	n/a	/* Some helper functions, not necessarily useful */
56	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_is_lastblock( const blake2s_state *S )
57	n/a	{
58	n/a	return S->f[0] != 0;
59	n/a	}
60	n/a
61	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_set_lastblock( blake2s_state *S )
62	n/a	{
63	n/a	if( S->last_node ) blake2s_set_lastnode( S );
64	n/a
65	n/a	S->f[0] = -1;
66	n/a	return 0;
67	n/a	}
68	n/a
69	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_clear_lastblock( blake2s_state *S )
70	n/a	{
71	n/a	if( S->last_node ) blake2s_clear_lastnode( S );
72	n/a
73	n/a	S->f[0] = 0;
74	n/a	return 0;
75	n/a	}
76	n/a
77	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_increment_counter( blake2s_state *S, const uint32_t inc )
78	n/a	{
79	n/a	S->t[0] += inc;
80	n/a	S->t[1] += ( S->t[0] < inc );
81	n/a	return 0;
82	n/a	}
83	n/a
84	n/a	/* Parameter-related functions */
85	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_digest_length( blake2s_param *P, const uint8_t digest_length )
86	n/a	{
87	n/a	P->digest_length = digest_length;
88	n/a	return 0;
89	n/a	}
90	n/a
91	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_fanout( blake2s_param *P, const uint8_t fanout )
92	n/a	{
93	n/a	P->fanout = fanout;
94	n/a	return 0;
95	n/a	}
96	n/a
97	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_max_depth( blake2s_param *P, const uint8_t depth )
98	n/a	{
99	n/a	P->depth = depth;
100	n/a	return 0;
101	n/a	}
102	n/a
103	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_leaf_length( blake2s_param *P, const uint32_t leaf_length )
104	n/a	{
105	n/a	store32( &P->leaf_length, leaf_length );
106	n/a	return 0;
107	n/a	}
108	n/a
109	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_node_offset( blake2s_param *P, const uint64_t node_offset )
110	n/a	{
111	n/a	store48( P->node_offset, node_offset );
112	n/a	return 0;
113	n/a	}
114	n/a
115	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_node_depth( blake2s_param *P, const uint8_t node_depth )
116	n/a	{
117	n/a	P->node_depth = node_depth;
118	n/a	return 0;
119	n/a	}
120	n/a
121	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_inner_length( blake2s_param *P, const uint8_t inner_length )
122	n/a	{
123	n/a	P->inner_length = inner_length;
124	n/a	return 0;
125	n/a	}
126	n/a
127	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_salt( blake2s_param *P, const uint8_t salt[BLAKE2S_SALTBYTES] )
128	n/a	{
129	n/a	memcpy( P->salt, salt, BLAKE2S_SALTBYTES );
130	n/a	return 0;
131	n/a	}
132	n/a
133	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_param_set_personal( blake2s_param *P, const uint8_t personal[BLAKE2S_PERSONALBYTES] )
134	n/a	{
135	n/a	memcpy( P->personal, personal, BLAKE2S_PERSONALBYTES );
136	n/a	return 0;
137	n/a	}
138	n/a
139	n/a	BLAKE2_LOCAL_INLINE(int) blake2s_init0( blake2s_state *S )
140	n/a	{
141	n/a	int i;
142	n/a	memset( S, 0, sizeof( blake2s_state ) );
143	n/a
144	n/a	for( i = 0; i < 8; ++i ) S->h[i] = blake2s_IV[i];
145	n/a
146	n/a	return 0;
147	n/a	}
148	n/a
149	n/a	/* init2 xors IV with input parameter block */
150	n/a	int blake2s_init_param( blake2s_state S, const blake2s_param P )
151	n/a	{
152	n/a	const uint32_t p = ( const uint32_t )( P );
153	n/a	size_t i;
154	n/a
155	n/a	blake2s_init0( S );
156	n/a
157	n/a	/* IV XOR ParamBlock */
158	n/a	for( i = 0; i < 8; ++i )
159	n/a	S->h[i] ^= load32( &p[i] );
160	n/a
161	n/a	return 0;
162	n/a	}
163	n/a
164	n/a
165	n/a	/* Sequential blake2s initialization */
166	n/a	int blake2s_init( blake2s_state *S, const uint8_t outlen )
167	n/a	{
168	n/a	blake2s_param P[1];
169	n/a
170	n/a	/* Move interval verification here? */
171	n/a	if ( ( !outlen ) \|\| ( outlen > BLAKE2S_OUTBYTES ) ) return -1;
172	n/a
173	n/a	P->digest_length = outlen;
174	n/a	P->key_length = 0;
175	n/a	P->fanout = 1;
176	n/a	P->depth = 1;
177	n/a	store32( &P->leaf_length, 0 );
178	n/a	store48( &P->node_offset, 0 );
179	n/a	P->node_depth = 0;
180	n/a	P->inner_length = 0;
181	n/a	/* memset(P->reserved, 0, sizeof(P->reserved) ); */
182	n/a	memset( P->salt, 0, sizeof( P->salt ) );
183	n/a	memset( P->personal, 0, sizeof( P->personal ) );
184	n/a	return blake2s_init_param( S, P );
185	n/a	}
186	n/a
187	n/a	int blake2s_init_key( blake2s_state S, const uint8_t outlen, const void key, const uint8_t keylen )
188	n/a	{
189	n/a	blake2s_param P[1];
190	n/a
191	n/a	if ( ( !outlen ) \|\| ( outlen > BLAKE2S_OUTBYTES ) ) return -1;
192	n/a
193	n/a	if ( !key \|\| !keylen \|\| keylen > BLAKE2S_KEYBYTES ) return -1;
194	n/a
195	n/a	P->digest_length = outlen;
196	n/a	P->key_length = keylen;
197	n/a	P->fanout = 1;
198	n/a	P->depth = 1;
199	n/a	store32( &P->leaf_length, 0 );
200	n/a	store48( &P->node_offset, 0 );
201	n/a	P->node_depth = 0;
202	n/a	P->inner_length = 0;
203	n/a	/* memset(P->reserved, 0, sizeof(P->reserved) ); */
204	n/a	memset( P->salt, 0, sizeof( P->salt ) );
205	n/a	memset( P->personal, 0, sizeof( P->personal ) );
206	n/a
207	n/a	if( blake2s_init_param( S, P ) < 0 ) return -1;
208	n/a
209	n/a	{
210	n/a	uint8_t block[BLAKE2S_BLOCKBYTES];
211	n/a	memset( block, 0, BLAKE2S_BLOCKBYTES );
212	n/a	memcpy( block, key, keylen );
213	n/a	blake2s_update( S, block, BLAKE2S_BLOCKBYTES );
214	n/a	secure_zero_memory( block, BLAKE2S_BLOCKBYTES ); /* Burn the key from stack */
215	n/a	}
216	n/a	return 0;
217	n/a	}
218	n/a
219	n/a	static int blake2s_compress( blake2s_state *S, const uint8_t block[BLAKE2S_BLOCKBYTES] )
220	n/a	{
221	n/a	uint32_t m[16];
222	n/a	uint32_t v[16];
223	n/a	size_t i;
224	n/a
225	n/a	for( i = 0; i < 16; ++i )
226	n/a	m[i] = load32( block + i * sizeof( m[i] ) );
227	n/a
228	n/a	for( i = 0; i < 8; ++i )
229	n/a	v[i] = S->h[i];
230	n/a
231	n/a	v[ 8] = blake2s_IV[0];
232	n/a	v[ 9] = blake2s_IV[1];
233	n/a	v[10] = blake2s_IV[2];
234	n/a	v[11] = blake2s_IV[3];
235	n/a	v[12] = S->t[0] ^ blake2s_IV[4];
236	n/a	v[13] = S->t[1] ^ blake2s_IV[5];
237	n/a	v[14] = S->f[0] ^ blake2s_IV[6];
238	n/a	v[15] = S->f[1] ^ blake2s_IV[7];
239	n/a	#define G(r,i,a,b,c,d) \
240	n/a	do { \
241	n/a	a = a + b + m[blake2s_sigma[r][2*i+0]]; \
242	n/a	d = rotr32(d ^ a, 16); \
243	n/a	c = c + d; \
244	n/a	b = rotr32(b ^ c, 12); \
245	n/a	a = a + b + m[blake2s_sigma[r][2*i+1]]; \
246	n/a	d = rotr32(d ^ a, 8); \
247	n/a	c = c + d; \
248	n/a	b = rotr32(b ^ c, 7); \
249	n/a	} while(0)
250	n/a	#define ROUND(r) \
251	n/a	do { \
252	n/a	G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \
253	n/a	G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \
254	n/a	G(r,2,v[ 2],v[ 6],v[10],v[14]); \
255	n/a	G(r,3,v[ 3],v[ 7],v[11],v[15]); \
256	n/a	G(r,4,v[ 0],v[ 5],v[10],v[15]); \
257	n/a	G(r,5,v[ 1],v[ 6],v[11],v[12]); \
258	n/a	G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \
259	n/a	G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \
260	n/a	} while(0)
261	n/a	ROUND( 0 );
262	n/a	ROUND( 1 );
263	n/a	ROUND( 2 );
264	n/a	ROUND( 3 );
265	n/a	ROUND( 4 );
266	n/a	ROUND( 5 );
267	n/a	ROUND( 6 );
268	n/a	ROUND( 7 );
269	n/a	ROUND( 8 );
270	n/a	ROUND( 9 );
271	n/a
272	n/a	for( i = 0; i < 8; ++i )
273	n/a	S->h[i] = S->h[i] ^ v[i] ^ v[i + 8];
274	n/a
275	n/a	#undef G
276	n/a	#undef ROUND
277	n/a	return 0;
278	n/a	}
279	n/a
280	n/a
281	n/a	int blake2s_update( blake2s_state S, const uint8_t in, uint64_t inlen )
282	n/a	{
283	n/a	while( inlen > 0 )
284	n/a	{
285	n/a	size_t left = S->buflen;
286	n/a	size_t fill = 2 * BLAKE2S_BLOCKBYTES - left;
287	n/a
288	n/a	if( inlen > fill )
289	n/a	{
290	n/a	memcpy( S->buf + left, in, fill ); /* Fill buffer */
291	n/a	S->buflen += fill;
292	n/a	blake2s_increment_counter( S, BLAKE2S_BLOCKBYTES );
293	n/a	blake2s_compress( S, S->buf ); /* Compress */
294	n/a	memcpy( S->buf, S->buf + BLAKE2S_BLOCKBYTES, BLAKE2S_BLOCKBYTES ); /* Shift buffer left */
295	n/a	S->buflen -= BLAKE2S_BLOCKBYTES;
296	n/a	in += fill;
297	n/a	inlen -= fill;
298	n/a	}
299	n/a	else /* inlen <= fill */
300	n/a	{
301	n/a	memcpy( S->buf + left, in, (size_t)inlen );
302	n/a	S->buflen += (size_t)inlen; /* Be lazy, do not compress */
303	n/a	in += inlen;
304	n/a	inlen -= inlen;
305	n/a	}
306	n/a	}
307	n/a
308	n/a	return 0;
309	n/a	}
310	n/a
311	n/a	int blake2s_final( blake2s_state S, uint8_t out, uint8_t outlen )
312	n/a	{
313	n/a	uint8_t buffer[BLAKE2S_OUTBYTES] = {0};
314	n/a	int i;
315	n/a
316	n/a	if( out == NULL \|\| outlen == 0 \|\| outlen > BLAKE2S_OUTBYTES )
317	n/a	return -1;
318	n/a
319	n/a	if( blake2s_is_lastblock( S ) )
320	n/a	return -1;
321	n/a
322	n/a
323	n/a	if( S->buflen > BLAKE2S_BLOCKBYTES )
324	n/a	{
325	n/a	blake2s_increment_counter( S, BLAKE2S_BLOCKBYTES );
326	n/a	blake2s_compress( S, S->buf );
327	n/a	S->buflen -= BLAKE2S_BLOCKBYTES;
328	n/a	memmove( S->buf, S->buf + BLAKE2S_BLOCKBYTES, S->buflen );
329	n/a	}
330	n/a
331	n/a	blake2s_increment_counter( S, ( uint32_t )S->buflen );
332	n/a	blake2s_set_lastblock( S );
333	n/a	memset( S->buf + S->buflen, 0, 2 * BLAKE2S_BLOCKBYTES - S->buflen ); /* Padding */
334	n/a	blake2s_compress( S, S->buf );
335	n/a
336	n/a	for( i = 0; i < 8; ++i ) /* Output full hash to temp buffer */
337	n/a	store32( buffer + sizeof( S->h[i] ) * i, S->h[i] );
338	n/a
339	n/a	memcpy( out, buffer, outlen );
340	n/a	return 0;
341	n/a	}
342	n/a
343	n/a	int blake2s( uint8_t out, const void in, const void *key, const uint8_t outlen, const uint64_t inlen, uint8_t keylen )
344	n/a	{
345	n/a	blake2s_state S[1];
346	n/a
347	n/a	/* Verify parameters */
348	n/a	if ( NULL == in && inlen > 0 ) return -1;
349	n/a
350	n/a	if ( NULL == out ) return -1;
351	n/a
352	n/a	if ( NULL == key && keylen > 0) return -1;
353	n/a
354	n/a	if( !outlen \|\| outlen > BLAKE2S_OUTBYTES ) return -1;
355	n/a
356	n/a	if( keylen > BLAKE2S_KEYBYTES ) return -1;
357	n/a
358	n/a	if( keylen > 0 )
359	n/a	{
360	n/a	if( blake2s_init_key( S, outlen, key, keylen ) < 0 ) return -1;
361	n/a	}
362	n/a	else
363	n/a	{
364	n/a	if( blake2s_init( S, outlen ) < 0 ) return -1;
365	n/a	}
366	n/a
367	n/a	blake2s_update( S, ( const uint8_t * )in, inlen );
368	n/a	blake2s_final( S, out, outlen );
369	n/a	return 0;
370	n/a	}
371	n/a
372	n/a	#if defined(SUPERCOP)
373	n/a	int crypto_hash( unsigned char out, unsigned char in, unsigned long long inlen )
374	n/a	{
375	n/a	return blake2s( out, in, NULL, BLAKE2S_OUTBYTES, inlen, 0 );
376	n/a	}
377	n/a	#endif
378	n/a
379	n/a	#if defined(BLAKE2S_SELFTEST)
380	n/a	#include <string.h>
381	n/a	#include "blake2-kat.h"
382	n/a	int main( int argc, char **argv )
383	n/a	{
384	n/a	uint8_t key[BLAKE2S_KEYBYTES];
385	n/a	uint8_t buf[KAT_LENGTH];
386	n/a	size_t i;
387	n/a
388	n/a	for( i = 0; i < BLAKE2S_KEYBYTES; ++i )
389	n/a	key[i] = ( uint8_t )i;
390	n/a
391	n/a	for( i = 0; i < KAT_LENGTH; ++i )
392	n/a	buf[i] = ( uint8_t )i;
393	n/a
394	n/a	for( i = 0; i < KAT_LENGTH; ++i )
395	n/a	{
396	n/a	uint8_t hash[BLAKE2S_OUTBYTES];
397	n/a	blake2s( hash, buf, key, BLAKE2S_OUTBYTES, i, BLAKE2S_KEYBYTES );
398	n/a
399	n/a	if( 0 != memcmp( hash, blake2s_keyed_kat[i], BLAKE2S_OUTBYTES ) )
400	n/a	{
401	n/a	puts( "error" );
402	n/a	return -1;
403	n/a	}
404	n/a	}
405	n/a
406	n/a	puts( "ok" );
407	n/a	return 0;
408	n/a	}
409	n/a	#endif
410	n/a
411	n/a