libsodium: Needed for Dnscrypto-proxy Release 1.3.0
[tomato.git] / release / src / router / libsodium / src / libsodium / crypto_generichash / blake2 / ref / blake2s-ref.c
blobd7f74a6d9a5df7bd720ee388de151c71177f276a
1 /*
2 BLAKE2 reference source code package - reference 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/>.
14 #include <stdint.h>
15 #include <string.h>
16 #include <stdio.h>
18 #include "crypto_generichash_blake2b.h"
19 #include "blake2.h"
20 #include "blake2-impl.h"
22 static const uint32_t blake2s_IV[8] =
24 0x6A09E667UL, 0xBB67AE85UL, 0x3C6EF372UL, 0xA54FF53AUL,
25 0x510E527FUL, 0x9B05688CUL, 0x1F83D9ABUL, 0x5BE0CD19UL
28 static const uint8_t blake2s_sigma[10][16] =
30 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } ,
31 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } ,
32 { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 } ,
33 { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 } ,
34 { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 } ,
35 { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 } ,
36 { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 } ,
37 { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 } ,
38 { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 } ,
39 { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13 , 0 } ,
42 static inline int blake2s_set_lastnode( blake2s_state *S )
44 S->f[1] = ~0U;
45 return 0;
48 static inline int blake2s_clear_lastnode( blake2s_state *S )
50 S->f[1] = 0U;
51 return 0;
54 /* Some helper functions, not necessarily useful */
55 static inline int blake2s_set_lastblock( blake2s_state *S )
57 if( S->last_node ) blake2s_set_lastnode( S );
59 S->f[0] = ~0U;
60 return 0;
63 static inline int blake2s_clear_lastblock( blake2s_state *S )
65 if( S->last_node ) blake2s_clear_lastnode( S );
67 S->f[0] = 0U;
68 return 0;
71 static inline int blake2s_increment_counter( blake2s_state *S, const uint32_t inc )
73 S->t[0] += inc;
74 S->t[1] += ( S->t[0] < inc );
75 return 0;
78 // Parameter-related functions
79 static inline int blake2s_param_set_digest_length( blake2s_param *P, const uint8_t digest_length )
81 P->digest_length = digest_length;
82 return 0;
85 static inline int blake2s_param_set_fanout( blake2s_param *P, const uint8_t fanout )
87 P->fanout = fanout;
88 return 0;
91 static inline int blake2s_param_set_max_depth( blake2s_param *P, const uint8_t depth )
93 P->depth = depth;
94 return 0;
97 static inline int blake2s_param_set_leaf_length( blake2s_param *P, const uint32_t leaf_length )
99 store32( &P->leaf_length, leaf_length );
100 return 0;
103 static inline int blake2s_param_set_node_offset( blake2s_param *P, const uint64_t node_offset )
105 store48( P->node_offset, node_offset );
106 return 0;
109 static inline int blake2s_param_set_node_depth( blake2s_param *P, const uint8_t node_depth )
111 P->node_depth = node_depth;
112 return 0;
115 static inline int blake2s_param_set_inner_length( blake2s_param *P, const uint8_t inner_length )
117 P->inner_length = inner_length;
118 return 0;
121 static inline int blake2s_param_set_salt( blake2s_param *P, const uint8_t salt[BLAKE2S_SALTBYTES] )
123 memcpy( P->salt, salt, BLAKE2S_SALTBYTES );
124 return 0;
127 static inline int blake2s_param_set_personal( blake2s_param *P, const uint8_t personal[BLAKE2S_PERSONALBYTES] )
129 memcpy( P->personal, personal, BLAKE2S_PERSONALBYTES );
130 return 0;
133 static inline int blake2s_init0( blake2s_state *S )
135 memset( S, 0, sizeof( blake2s_state ) );
137 for( int i = 0; i < 8; ++i ) S->h[i] = blake2s_IV[i];
139 return 0;
142 /* init2 xors IV with input parameter block */
143 int blake2s_init_param( blake2s_state *S, const blake2s_param *P )
145 blake2s_init0( S );
146 uint32_t *p = ( uint32_t * )( P );
148 /* IV XOR ParamBlock */
149 for( size_t i = 0; i < 8; ++i )
150 S->h[i] ^= load32( &p[i] );
152 return 0;
156 // Sequential blake2s initialization
157 int blake2s_init( blake2s_state *S, const uint8_t outlen )
159 blake2s_param P[1];
161 /* Move interval verification here? */
162 if ( ( !outlen ) || ( outlen > BLAKE2S_OUTBYTES ) ) return -1;
164 P->digest_length = outlen;
165 P->key_length = 0;
166 P->fanout = 1;
167 P->depth = 1;
168 store32( &P->leaf_length, 0 );
169 store48( &P->node_offset, 0 );
170 P->node_depth = 0;
171 P->inner_length = 0;
172 // memset(P->reserved, 0, sizeof(P->reserved) );
173 memset( P->salt, 0, sizeof( P->salt ) );
174 memset( P->personal, 0, sizeof( P->personal ) );
175 return blake2s_init_param( S, P );
178 int blake2s_init_key( blake2s_state *S, const uint8_t outlen, const void *key, const uint8_t keylen )
180 blake2s_param P[1];
182 if ( ( !outlen ) || ( outlen > BLAKE2S_OUTBYTES ) ) return -1;
184 if ( !key || !keylen || keylen > BLAKE2S_KEYBYTES ) return -1;
186 P->digest_length = outlen;
187 P->key_length = keylen;
188 P->fanout = 1;
189 P->depth = 1;
190 store32( &P->leaf_length, 0 );
191 store48( &P->node_offset, 0 );
192 P->node_depth = 0;
193 P->inner_length = 0;
194 // memset(P->reserved, 0, sizeof(P->reserved) );
195 memset( P->salt, 0, sizeof( P->salt ) );
196 memset( P->personal, 0, sizeof( P->personal ) );
198 if( blake2s_init_param( S, P ) < 0 ) return -1;
201 uint8_t block[BLAKE2S_BLOCKBYTES];
202 memset( block, 0, BLAKE2S_BLOCKBYTES );
203 memcpy( block, key, keylen );
204 blake2s_update( S, block, BLAKE2S_BLOCKBYTES );
205 secure_zero_memory( block, BLAKE2S_BLOCKBYTES ); /* Burn the key from stack */
207 return 0;
210 static int blake2s_compress( blake2s_state *S, const uint8_t block[BLAKE2S_BLOCKBYTES] )
212 uint32_t m[16];
213 uint32_t v[16];
215 for( size_t i = 0; i < 16; ++i )
216 m[i] = load32( block + i * sizeof( m[i] ) );
218 for( size_t i = 0; i < 8; ++i )
219 v[i] = S->h[i];
221 v[ 8] = blake2s_IV[0];
222 v[ 9] = blake2s_IV[1];
223 v[10] = blake2s_IV[2];
224 v[11] = blake2s_IV[3];
225 v[12] = S->t[0] ^ blake2s_IV[4];
226 v[13] = S->t[1] ^ blake2s_IV[5];
227 v[14] = S->f[0] ^ blake2s_IV[6];
228 v[15] = S->f[1] ^ blake2s_IV[7];
229 #define G(r,i,a,b,c,d) \
230 do { \
231 a = a + b + m[blake2s_sigma[r][2*i+0]]; \
232 d = rotr32(d ^ a, 16); \
233 c = c + d; \
234 b = rotr32(b ^ c, 12); \
235 a = a + b + m[blake2s_sigma[r][2*i+1]]; \
236 d = rotr32(d ^ a, 8); \
237 c = c + d; \
238 b = rotr32(b ^ c, 7); \
239 } while(0)
240 #define ROUND(r) \
241 do { \
242 G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \
243 G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \
244 G(r,2,v[ 2],v[ 6],v[10],v[14]); \
245 G(r,3,v[ 3],v[ 7],v[11],v[15]); \
246 G(r,4,v[ 0],v[ 5],v[10],v[15]); \
247 G(r,5,v[ 1],v[ 6],v[11],v[12]); \
248 G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \
249 G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \
250 } while(0)
251 ROUND( 0 );
252 ROUND( 1 );
253 ROUND( 2 );
254 ROUND( 3 );
255 ROUND( 4 );
256 ROUND( 5 );
257 ROUND( 6 );
258 ROUND( 7 );
259 ROUND( 8 );
260 ROUND( 9 );
262 for( size_t i = 0; i < 8; ++i )
263 S->h[i] = S->h[i] ^ v[i] ^ v[i + 8];
265 #undef G
266 #undef ROUND
267 return 0;
271 int blake2s_update( blake2s_state *S, const uint8_t *in, uint64_t inlen )
273 while( inlen > 0 )
275 size_t left = S->buflen;
276 size_t fill = 2 * BLAKE2S_BLOCKBYTES - left;
278 if( inlen > fill )
280 memcpy( S->buf + left, in, fill ); // Fill buffer
281 S->buflen += fill;
282 blake2s_increment_counter( S, BLAKE2S_BLOCKBYTES );
283 blake2s_compress( S, S->buf ); // Compress
284 memcpy( S->buf, S->buf + BLAKE2S_BLOCKBYTES, BLAKE2S_BLOCKBYTES ); // Shift buffer left
285 S->buflen -= BLAKE2S_BLOCKBYTES;
286 in += fill;
287 inlen -= fill;
289 else // inlen <= fill
291 memcpy( S->buf + left, in, inlen );
292 S->buflen += inlen; // Be lazy, do not compress
293 in += inlen;
294 inlen -= inlen;
298 return 0;
301 int blake2s_final( blake2s_state *S, uint8_t *out, uint8_t outlen )
303 uint8_t buffer[BLAKE2S_OUTBYTES];
305 if( S->buflen > BLAKE2S_BLOCKBYTES )
307 blake2s_increment_counter( S, BLAKE2S_BLOCKBYTES );
308 blake2s_compress( S, S->buf );
309 S->buflen -= BLAKE2S_BLOCKBYTES;
310 memcpy( S->buf, S->buf + BLAKE2S_BLOCKBYTES, S->buflen );
313 blake2s_increment_counter( S, ( uint32_t )S->buflen );
314 blake2s_set_lastblock( S );
315 memset( S->buf + S->buflen, 0, 2 * BLAKE2S_BLOCKBYTES - S->buflen ); /* Padding */
316 blake2s_compress( S, S->buf );
318 for( int i = 0; i < 8; ++i ) /* Output full hash to temp buffer */
319 store32( buffer + sizeof( S->h[i] ) * i, S->h[i] );
321 memcpy( out, buffer, outlen );
322 return 0;
325 int blake2s( uint8_t *out, const void *in, const void *key, const uint8_t outlen, const uint64_t inlen, uint8_t keylen )
327 blake2s_state S[1];
329 /* Verify parameters */
330 if ( NULL == in ) return -1;
332 if ( NULL == out ) return -1;
334 if ( NULL == key ) keylen = 0; /* Fail here instead if keylen != 0 and key == NULL? */
336 if( keylen > 0 )
338 if( blake2s_init_key( S, outlen, key, keylen ) < 0 ) return -1;
340 else
342 if( blake2s_init( S, outlen ) < 0 ) return -1;
345 blake2s_update( S, ( uint8_t * )in, inlen );
346 blake2s_final( S, out, outlen );
347 return 0;