mirror of
https://github.com/BLAKE2/BLAKE2
synced 2024-11-23 02:42:10 +01:00
349 lines
8.7 KiB
C
349 lines
8.7 KiB
C
/*
|
|
BLAKE2 reference source code package - optimized C implementations
|
|
|
|
Copyright 2012, Samuel Neves <sneves@dei.uc.pt>. You may use this under the
|
|
terms of the CC0, the OpenSSL Licence, or the Apache Public License 2.0, at
|
|
your option. The terms of these licenses can be found at:
|
|
|
|
- CC0 1.0 Universal : http://creativecommons.org/publicdomain/zero/1.0
|
|
- OpenSSL license : https://www.openssl.org/source/license.html
|
|
- Apache 2.0 : http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
More information about the BLAKE2 hash function can be found at
|
|
https://blake2.net.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <stdint.h>
|
|
|
|
#if defined(_OPENMP)
|
|
#include <omp.h>
|
|
#endif
|
|
|
|
#include "blake2.h"
|
|
#include "blake2-impl.h"
|
|
|
|
#define PARALLELISM_DEGREE 4
|
|
|
|
static int blake2bp_init_leaf( blake2b_state *S, size_t outlen, size_t keylen, uint64_t offset )
|
|
{
|
|
blake2b_param P[1];
|
|
P->digest_length = (uint8_t)outlen;
|
|
P->key_length = (uint8_t)keylen;
|
|
P->fanout = PARALLELISM_DEGREE;
|
|
P->depth = 2;
|
|
P->leaf_length = 0;
|
|
P->node_offset = offset;
|
|
P->xof_length = 0;
|
|
P->node_depth = 0;
|
|
P->inner_length = BLAKE2B_OUTBYTES;
|
|
memset( P->reserved, 0, sizeof( P->reserved ) );
|
|
memset( P->salt, 0, sizeof( P->salt ) );
|
|
memset( P->personal, 0, sizeof( P->personal ) );
|
|
return blake2b_init_param( S, P );
|
|
}
|
|
|
|
static int blake2bp_init_root( blake2b_state *S, size_t outlen, size_t keylen )
|
|
{
|
|
blake2b_param P[1];
|
|
P->digest_length = (uint8_t)outlen;
|
|
P->key_length = (uint8_t)keylen;
|
|
P->fanout = PARALLELISM_DEGREE;
|
|
P->depth = 2;
|
|
P->leaf_length = 0;
|
|
P->node_offset = 0;
|
|
P->xof_length = 0;
|
|
P->node_depth = 1;
|
|
P->inner_length = BLAKE2B_OUTBYTES;
|
|
memset( P->reserved, 0, sizeof( P->reserved ) );
|
|
memset( P->salt, 0, sizeof( P->salt ) );
|
|
memset( P->personal, 0, sizeof( P->personal ) );
|
|
return blake2b_init_param( S, P );
|
|
}
|
|
|
|
|
|
int blake2bp_init( blake2bp_state *S, size_t outlen )
|
|
{
|
|
size_t i;
|
|
if( !outlen || outlen > BLAKE2B_OUTBYTES ) return -1;
|
|
|
|
memset( S->buf, 0, sizeof( S->buf ) );
|
|
S->buflen = 0;
|
|
S->outlen = outlen;
|
|
|
|
if( blake2bp_init_root( S->R, outlen, 0 ) < 0 )
|
|
return -1;
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
if( blake2bp_init_leaf( S->S[i], outlen, 0, i ) < 0 ) return -1;
|
|
|
|
S->R->last_node = 1;
|
|
S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
|
|
return 0;
|
|
}
|
|
|
|
int blake2bp_init_key( blake2bp_state *S, size_t outlen, const void *key, size_t keylen )
|
|
{
|
|
size_t i;
|
|
|
|
if( !outlen || outlen > BLAKE2B_OUTBYTES ) return -1;
|
|
|
|
if( !key || !keylen || keylen > BLAKE2B_KEYBYTES ) return -1;
|
|
|
|
memset( S->buf, 0, sizeof( S->buf ) );
|
|
S->buflen = 0;
|
|
S->outlen = outlen;
|
|
|
|
if( blake2bp_init_root( S->R, outlen, keylen ) < 0 )
|
|
return -1;
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
if( blake2bp_init_leaf( S->S[i], outlen, keylen, i ) < 0 ) return -1;
|
|
|
|
S->R->last_node = 1;
|
|
S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
|
|
{
|
|
uint8_t block[BLAKE2B_BLOCKBYTES];
|
|
memset( block, 0, BLAKE2B_BLOCKBYTES );
|
|
memcpy( block, key, keylen );
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
blake2b_update( S->S[i], block, BLAKE2B_BLOCKBYTES );
|
|
|
|
secure_zero_memory( block, BLAKE2B_BLOCKBYTES ); /* Burn the key from stack */
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
int blake2bp_update( blake2bp_state *S, const void *pin, size_t inlen )
|
|
{
|
|
const unsigned char * in = (const unsigned char *)pin;
|
|
size_t left = S->buflen;
|
|
size_t fill = sizeof( S->buf ) - left;
|
|
size_t i;
|
|
|
|
if( left && inlen >= fill )
|
|
{
|
|
memcpy( S->buf + left, in, fill );
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
blake2b_update( S->S[i], S->buf + i * BLAKE2B_BLOCKBYTES, BLAKE2B_BLOCKBYTES );
|
|
|
|
in += fill;
|
|
inlen -= fill;
|
|
left = 0;
|
|
}
|
|
|
|
#if defined(_OPENMP)
|
|
#pragma omp parallel shared(S), num_threads(PARALLELISM_DEGREE)
|
|
#else
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
#endif
|
|
{
|
|
#if defined(_OPENMP)
|
|
size_t i = omp_get_thread_num();
|
|
#endif
|
|
size_t inlen__ = inlen;
|
|
const unsigned char *in__ = ( const unsigned char * )in;
|
|
in__ += i * BLAKE2B_BLOCKBYTES;
|
|
|
|
while( inlen__ >= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES )
|
|
{
|
|
blake2b_update( S->S[i], in__, BLAKE2B_BLOCKBYTES );
|
|
in__ += PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
|
|
inlen__ -= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
|
|
}
|
|
}
|
|
|
|
in += inlen - inlen % ( PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES );
|
|
inlen %= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
|
|
|
|
if( inlen > 0 )
|
|
memcpy( S->buf + left, in, inlen );
|
|
|
|
S->buflen = left + inlen;
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
int blake2bp_final( blake2bp_state *S, void *out, size_t outlen )
|
|
{
|
|
uint8_t hash[PARALLELISM_DEGREE][BLAKE2B_OUTBYTES];
|
|
size_t i;
|
|
|
|
if(out == NULL || outlen < S->outlen) {
|
|
return -1;
|
|
}
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
{
|
|
if( S->buflen > i * BLAKE2B_BLOCKBYTES )
|
|
{
|
|
size_t left = S->buflen - i * BLAKE2B_BLOCKBYTES;
|
|
|
|
if( left > BLAKE2B_BLOCKBYTES ) left = BLAKE2B_BLOCKBYTES;
|
|
|
|
blake2b_update( S->S[i], S->buf + i * BLAKE2B_BLOCKBYTES, left );
|
|
}
|
|
|
|
blake2b_final( S->S[i], hash[i], BLAKE2B_OUTBYTES );
|
|
}
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
blake2b_update( S->R, hash[i], BLAKE2B_OUTBYTES );
|
|
|
|
return blake2b_final( S->R, out, S->outlen );
|
|
}
|
|
|
|
int blake2bp( void *out, size_t outlen, const void *in, size_t inlen, const void *key, size_t keylen )
|
|
{
|
|
uint8_t hash[PARALLELISM_DEGREE][BLAKE2B_OUTBYTES];
|
|
blake2b_state S[PARALLELISM_DEGREE][1];
|
|
blake2b_state FS[1];
|
|
size_t i;
|
|
|
|
/* Verify parameters */
|
|
if ( NULL == in && inlen > 0 ) return -1;
|
|
|
|
if ( NULL == out ) return -1;
|
|
|
|
if( NULL == key && keylen > 0 ) return -1;
|
|
|
|
if( !outlen || outlen > BLAKE2B_OUTBYTES ) return -1;
|
|
|
|
if( keylen > BLAKE2B_KEYBYTES ) return -1;
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
if( blake2bp_init_leaf( S[i], outlen, keylen, i ) < 0 ) return -1;
|
|
|
|
S[PARALLELISM_DEGREE - 1]->last_node = 1; /* mark last node */
|
|
|
|
if( keylen > 0 )
|
|
{
|
|
uint8_t block[BLAKE2B_BLOCKBYTES];
|
|
memset( block, 0, BLAKE2B_BLOCKBYTES );
|
|
memcpy( block, key, keylen );
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
blake2b_update( S[i], block, BLAKE2B_BLOCKBYTES );
|
|
|
|
secure_zero_memory( block, BLAKE2B_BLOCKBYTES ); /* Burn the key from stack */
|
|
}
|
|
|
|
#if defined(_OPENMP)
|
|
#pragma omp parallel shared(S,hash), num_threads(PARALLELISM_DEGREE)
|
|
#else
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
#endif
|
|
{
|
|
#if defined(_OPENMP)
|
|
size_t i = omp_get_thread_num();
|
|
#endif
|
|
size_t inlen__ = inlen;
|
|
const unsigned char *in__ = ( const unsigned char * )in;
|
|
in__ += i * BLAKE2B_BLOCKBYTES;
|
|
|
|
while( inlen__ >= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES )
|
|
{
|
|
blake2b_update( S[i], in__, BLAKE2B_BLOCKBYTES );
|
|
in__ += PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
|
|
inlen__ -= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
|
|
}
|
|
|
|
if( inlen__ > i * BLAKE2B_BLOCKBYTES )
|
|
{
|
|
const size_t left = inlen__ - i * BLAKE2B_BLOCKBYTES;
|
|
const size_t len = left <= BLAKE2B_BLOCKBYTES ? left : BLAKE2B_BLOCKBYTES;
|
|
blake2b_update( S[i], in__, len );
|
|
}
|
|
|
|
blake2b_final( S[i], hash[i], BLAKE2B_OUTBYTES );
|
|
}
|
|
|
|
if( blake2bp_init_root( FS, outlen, keylen ) < 0 )
|
|
return -1;
|
|
|
|
FS->last_node = 1; /* Mark as last node */
|
|
|
|
for( i = 0; i < PARALLELISM_DEGREE; ++i )
|
|
blake2b_update( FS, hash[i], BLAKE2B_OUTBYTES );
|
|
|
|
return blake2b_final( FS, out, outlen );
|
|
}
|
|
|
|
|
|
#if defined(BLAKE2BP_SELFTEST)
|
|
#include <string.h>
|
|
#include "blake2-kat.h"
|
|
int main( void )
|
|
{
|
|
uint8_t key[BLAKE2B_KEYBYTES];
|
|
uint8_t buf[BLAKE2_KAT_LENGTH];
|
|
size_t i, step;
|
|
|
|
for( i = 0; i < BLAKE2B_KEYBYTES; ++i )
|
|
key[i] = ( uint8_t )i;
|
|
|
|
for( i = 0; i < BLAKE2_KAT_LENGTH; ++i )
|
|
buf[i] = ( uint8_t )i;
|
|
|
|
/* Test simple API */
|
|
for( i = 0; i < BLAKE2_KAT_LENGTH; ++i )
|
|
{
|
|
uint8_t hash[BLAKE2B_OUTBYTES];
|
|
blake2bp( hash, BLAKE2B_OUTBYTES, buf, i, key, BLAKE2B_KEYBYTES );
|
|
|
|
if( 0 != memcmp( hash, blake2bp_keyed_kat[i], BLAKE2B_OUTBYTES ) )
|
|
{
|
|
goto fail;
|
|
}
|
|
}
|
|
|
|
/* Test streaming API */
|
|
for(step = 1; step < BLAKE2B_BLOCKBYTES; ++step) {
|
|
for (i = 0; i < BLAKE2_KAT_LENGTH; ++i) {
|
|
uint8_t hash[BLAKE2B_OUTBYTES];
|
|
blake2bp_state S;
|
|
uint8_t * p = buf;
|
|
size_t mlen = i;
|
|
int err = 0;
|
|
|
|
if( (err = blake2bp_init_key(&S, BLAKE2B_OUTBYTES, key, BLAKE2B_KEYBYTES)) < 0 ) {
|
|
goto fail;
|
|
}
|
|
|
|
while (mlen >= step) {
|
|
if ( (err = blake2bp_update(&S, p, step)) < 0 ) {
|
|
goto fail;
|
|
}
|
|
mlen -= step;
|
|
p += step;
|
|
}
|
|
if ( (err = blake2bp_update(&S, p, mlen)) < 0) {
|
|
goto fail;
|
|
}
|
|
if ( (err = blake2bp_final(&S, hash, BLAKE2B_OUTBYTES)) < 0) {
|
|
goto fail;
|
|
}
|
|
|
|
if (0 != memcmp(hash, blake2bp_keyed_kat[i], BLAKE2B_OUTBYTES)) {
|
|
goto fail;
|
|
}
|
|
}
|
|
}
|
|
|
|
puts( "ok" );
|
|
return 0;
|
|
fail:
|
|
puts("error");
|
|
return -1;
|
|
}
|
|
#endif
|
|
|