/* * Copyright 2012, Samuel Neves . * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved. * * Licensed under the OpenSSL licenses, (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * https://www.openssl.org/source/license.html * or in the file LICENSE in the source distribution. */ /* * Derived from the BLAKE2 reference implementation written by Samuel Neves. * More information about the BLAKE2 hash function and its implementations * can be found at https://blake2.net. */ #include #include #include "e_os.h" #include "blake2_locl.h" #include "blake2_impl.h" static const uint64_t blake2b_IV[8] = { 0x6a09e667f3bcc908U, 0xbb67ae8584caa73bU, 0x3c6ef372fe94f82bU, 0xa54ff53a5f1d36f1U, 0x510e527fade682d1U, 0x9b05688c2b3e6c1fU, 0x1f83d9abfb41bd6bU, 0x5be0cd19137e2179U }; static const uint8_t blake2b_sigma[12][16] = { { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } , { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } , { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 } , { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 } , { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 } , { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 } , { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 } , { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 } , { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 } , { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13 , 0 } , { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } , { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } }; /* Set that it's the last block we'll compress */ static ossl_inline void blake2b_set_lastblock(BLAKE2B_CTX *S) { S->f[0] = -1; } /* Increment the data hashed counter. */ static ossl_inline void blake2b_increment_counter(BLAKE2B_CTX *S, const uint64_t inc) { S->t[0] += inc; S->t[1] += (S->t[0] < inc); } /* Initialize the hashing state. */ static ossl_inline void blake2b_init0(BLAKE2B_CTX *S) { int i; memset(S, 0, sizeof(BLAKE2B_CTX)); for(i = 0; i < 8; ++i) { S->h[i] = blake2b_IV[i]; } } /* init xors IV with input parameter block */ static void blake2b_init_param(BLAKE2B_CTX *S, const BLAKE2B_PARAM *P) { size_t i; const uint8_t *p = (const uint8_t *)(P); blake2b_init0(S); /* The param struct is carefully hand packed, and should be 64 bytes on * every platform. */ OPENSSL_assert(sizeof(BLAKE2B_PARAM) == 64); /* IV XOR ParamBlock */ for(i = 0; i < 8; ++i) { S->h[i] ^= load64(p + sizeof(S->h[i]) * i); } } /* Initialize the hashing context. Always returns 1. */ int BLAKE2b_Init(BLAKE2B_CTX *c) { BLAKE2B_PARAM P[1]; P->digest_length = BLAKE2B_DIGEST_LENGTH; P->key_length = 0; P->fanout = 1; P->depth = 1; store32(P->leaf_length, 0); store64(P->node_offset, 0); P->node_depth = 0; P->inner_length = 0; memset(P->reserved, 0, sizeof(P->reserved)); memset(P->salt, 0, sizeof(P->salt)); memset(P->personal, 0, sizeof(P->personal)); blake2b_init_param(c, P); return 1; } /* Permute the state while xoring in the block of data. */ static void blake2b_compress(BLAKE2B_CTX *S, const uint8_t block[BLAKE2B_BLOCKBYTES]) { uint64_t m[16]; uint64_t v[16]; int i; for(i = 0; i < 16; ++i) { m[i] = load64(block + i * sizeof(m[i])); } for(i = 0; i < 8; ++i) { v[i] = S->h[i]; } v[8] = blake2b_IV[0]; v[9] = blake2b_IV[1]; v[10] = blake2b_IV[2]; v[11] = blake2b_IV[3]; v[12] = S->t[0] ^ blake2b_IV[4]; v[13] = S->t[1] ^ blake2b_IV[5]; v[14] = S->f[0] ^ blake2b_IV[6]; v[15] = S->f[1] ^ blake2b_IV[7]; #define G(r,i,a,b,c,d) \ do { \ a = a + b + m[blake2b_sigma[r][2*i+0]]; \ d = rotr64(d ^ a, 32); \ c = c + d; \ b = rotr64(b ^ c, 24); \ a = a + b + m[blake2b_sigma[r][2*i+1]]; \ d = rotr64(d ^ a, 16); \ c = c + d; \ b = rotr64(b ^ c, 63); \ } while(0) #define ROUND(r) \ do { \ G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \ G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \ G(r,2,v[ 2],v[ 6],v[10],v[14]); \ G(r,3,v[ 3],v[ 7],v[11],v[15]); \ G(r,4,v[ 0],v[ 5],v[10],v[15]); \ G(r,5,v[ 1],v[ 6],v[11],v[12]); \ G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \ G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \ } while(0) ROUND(0); ROUND(1); ROUND(2); ROUND(3); ROUND(4); ROUND(5); ROUND(6); ROUND(7); ROUND(8); ROUND(9); ROUND(10); ROUND(11); for(i = 0; i < 8; ++i) { S->h[i] = S->h[i] ^ v[i] ^ v[i + 8]; } #undef G #undef ROUND } /* Absorb the input data into the hash state. Always returns 1. */ int BLAKE2b_Update(BLAKE2B_CTX *c, const void *data, size_t datalen) { const uint8_t *in = data; size_t fill; while(datalen > 0) { fill = sizeof(c->buf) - c->buflen; /* Must be >, not >=, so that last block can be hashed differently */ if(datalen > fill) { memcpy(c->buf + c->buflen, in, fill); /* Fill buffer */ blake2b_increment_counter(c, BLAKE2B_BLOCKBYTES); blake2b_compress(c, c->buf); /* Compress */ c->buflen = 0; in += fill; datalen -= fill; } else { /* datalen <= fill */ memcpy(c->buf + c->buflen, in, datalen); c->buflen += datalen; /* Be lazy, do not compress */ return 1; } } return 1; } /* * Calculate the final hash and save it in md. * Always returns 1. */ int BLAKE2b_Final(unsigned char *md, BLAKE2B_CTX *c) { int i; blake2b_increment_counter(c, c->buflen); blake2b_set_lastblock(c); /* Padding */ memset(c->buf + c->buflen, 0, sizeof(c->buf) - c->buflen); blake2b_compress(c, c->buf); /* Output full hash to message digest */ for(i = 0; i < 8; ++i) { store64(md + sizeof(c->h[i]) * i, c->h[i]); } OPENSSL_cleanse(c, sizeof(BLAKE2B_CTX)); return 1; }