1 /* $OpenBSD: blake2s.c,v 1.2 2020/07/22 13:54:30 tobhe Exp $ */ 2 /* 3 * Copyright (C) 2012 Samuel Neves <sneves@dei.uc.pt>. All Rights Reserved. 4 * Copyright (C) 2015-2020 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved. 5 * 6 * Permission to use, copy, modify, and distribute this software for any 7 * purpose with or without fee is hereby granted, provided that the above 8 * copyright notice and this permission notice appear in all copies. 9 * 10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES 11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF 12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR 13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN 15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF 16 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. 17 * 18 * This is an implementation of the BLAKE2s hash and PRF functions. 19 * Information: https://blake2.net/ 20 */ 21 22 #include <sys/types.h> 23 #include <sys/systm.h> 24 25 #include <crypto/blake2s.h> 26 27 static inline uint32_t 28 ror32(uint32_t word, unsigned int shift) 29 { 30 return (word >> shift) | (word << (32 - shift)); 31 } 32 33 static const uint32_t blake2s_iv[8] = { 34 0x6A09E667UL, 0xBB67AE85UL, 0x3C6EF372UL, 0xA54FF53AUL, 35 0x510E527FUL, 0x9B05688CUL, 0x1F83D9ABUL, 0x5BE0CD19UL 36 }; 37 38 static const uint8_t blake2s_sigma[10][16] = { 39 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }, 40 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 }, 41 { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 }, 42 { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 }, 43 { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 }, 44 { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 }, 45 { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 }, 46 { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 }, 47 { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 }, 48 { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0 }, 49 }; 50 51 static inline void blake2s_set_lastblock(struct blake2s_state *state) 52 { 53 state->f[0] = -1; 54 } 55 56 static inline void blake2s_increment_counter(struct blake2s_state *state, 57 const uint32_t inc) 58 { 59 state->t[0] += inc; 60 state->t[1] += (state->t[0] < inc); 61 } 62 63 static inline void blake2s_init_param(struct blake2s_state *state, 64 const uint32_t param) 65 { 66 int i; 67 68 memset(state, 0, sizeof(*state)); 69 for (i = 0; i < 8; ++i) 70 state->h[i] = blake2s_iv[i]; 71 state->h[0] ^= param; 72 } 73 74 void blake2s_init(struct blake2s_state *state, const size_t outlen) 75 { 76 #ifdef DIAGNOSTIC 77 KASSERT(!(!outlen || outlen > BLAKE2S_HASH_SIZE)); 78 #endif 79 blake2s_init_param(state, 0x01010000 | outlen); 80 state->outlen = outlen; 81 } 82 83 void blake2s_init_key(struct blake2s_state *state, const size_t outlen, 84 const void *key, const size_t keylen) 85 { 86 uint8_t block[BLAKE2S_BLOCK_SIZE] = { 0 }; 87 88 #ifdef DIAGNOSTIC 89 KASSERT(!(!outlen || outlen > BLAKE2S_HASH_SIZE || 90 !key || !keylen || keylen > BLAKE2S_KEY_SIZE)); 91 #endif 92 93 blake2s_init_param(state, 0x01010000 | keylen << 8 | outlen); 94 state->outlen = outlen; 95 memcpy(block, key, keylen); 96 blake2s_update(state, block, BLAKE2S_BLOCK_SIZE); 97 explicit_bzero(block, BLAKE2S_BLOCK_SIZE); 98 } 99 100 static inline void blake2s_compress(struct blake2s_state *state, 101 const uint8_t *block, size_t nblocks, 102 const uint32_t inc) 103 { 104 uint32_t m[16]; 105 uint32_t v[16]; 106 int i; 107 108 #ifdef DIAGNOSTIC 109 KASSERT(!((nblocks > 1 && inc != BLAKE2S_BLOCK_SIZE))); 110 #endif 111 112 while (nblocks > 0) { 113 blake2s_increment_counter(state, inc); 114 memcpy(m, block, BLAKE2S_BLOCK_SIZE); 115 for (i = 0; i < 16; i++) 116 m[i] = le32toh(m[i]); 117 memcpy(v, state->h, 32); 118 v[ 8] = blake2s_iv[0]; 119 v[ 9] = blake2s_iv[1]; 120 v[10] = blake2s_iv[2]; 121 v[11] = blake2s_iv[3]; 122 v[12] = blake2s_iv[4] ^ state->t[0]; 123 v[13] = blake2s_iv[5] ^ state->t[1]; 124 v[14] = blake2s_iv[6] ^ state->f[0]; 125 v[15] = blake2s_iv[7] ^ state->f[1]; 126 127 #define G(r, i, a, b, c, d) do { \ 128 a += b + m[blake2s_sigma[r][2 * i + 0]]; \ 129 d = ror32(d ^ a, 16); \ 130 c += d; \ 131 b = ror32(b ^ c, 12); \ 132 a += b + m[blake2s_sigma[r][2 * i + 1]]; \ 133 d = ror32(d ^ a, 8); \ 134 c += d; \ 135 b = ror32(b ^ c, 7); \ 136 } while (0) 137 138 #define ROUND(r) do { \ 139 G(r, 0, v[0], v[ 4], v[ 8], v[12]); \ 140 G(r, 1, v[1], v[ 5], v[ 9], v[13]); \ 141 G(r, 2, v[2], v[ 6], v[10], v[14]); \ 142 G(r, 3, v[3], v[ 7], v[11], v[15]); \ 143 G(r, 4, v[0], v[ 5], v[10], v[15]); \ 144 G(r, 5, v[1], v[ 6], v[11], v[12]); \ 145 G(r, 6, v[2], v[ 7], v[ 8], v[13]); \ 146 G(r, 7, v[3], v[ 4], v[ 9], v[14]); \ 147 } while (0) 148 ROUND(0); 149 ROUND(1); 150 ROUND(2); 151 ROUND(3); 152 ROUND(4); 153 ROUND(5); 154 ROUND(6); 155 ROUND(7); 156 ROUND(8); 157 ROUND(9); 158 159 #undef G 160 #undef ROUND 161 162 for (i = 0; i < 8; ++i) 163 state->h[i] ^= v[i] ^ v[i + 8]; 164 165 block += BLAKE2S_BLOCK_SIZE; 166 --nblocks; 167 } 168 } 169 170 void blake2s_update(struct blake2s_state *state, const uint8_t *in, size_t inlen) 171 { 172 const size_t fill = BLAKE2S_BLOCK_SIZE - state->buflen; 173 174 if (!inlen) 175 return; 176 if (inlen > fill) { 177 memcpy(state->buf + state->buflen, in, fill); 178 blake2s_compress(state, state->buf, 1, BLAKE2S_BLOCK_SIZE); 179 state->buflen = 0; 180 in += fill; 181 inlen -= fill; 182 } 183 if (inlen > BLAKE2S_BLOCK_SIZE) { 184 const size_t nblocks = 185 (inlen + BLAKE2S_BLOCK_SIZE - 1) / BLAKE2S_BLOCK_SIZE; 186 /* Hash one less (full) block than strictly possible */ 187 blake2s_compress(state, in, nblocks - 1, BLAKE2S_BLOCK_SIZE); 188 in += BLAKE2S_BLOCK_SIZE * (nblocks - 1); 189 inlen -= BLAKE2S_BLOCK_SIZE * (nblocks - 1); 190 } 191 memcpy(state->buf + state->buflen, in, inlen); 192 state->buflen += inlen; 193 } 194 195 void blake2s_final(struct blake2s_state *state, uint8_t *out) 196 { 197 int i; 198 blake2s_set_lastblock(state); 199 memset(state->buf + state->buflen, 0, 200 BLAKE2S_BLOCK_SIZE - state->buflen); /* Padding */ 201 blake2s_compress(state, state->buf, 1, state->buflen); 202 for (i = 0; i < 8; i++) 203 state->h[i] = htole32(state->h[i]); 204 memcpy(out, state->h, state->outlen); 205 explicit_bzero(state, sizeof(*state)); 206 } 207 208 void blake2s_hmac(uint8_t *out, const uint8_t *in, const uint8_t *key, const size_t outlen, 209 const size_t inlen, const size_t keylen) 210 { 211 struct blake2s_state state; 212 uint8_t x_key[BLAKE2S_BLOCK_SIZE] __aligned(__alignof__(uint32_t)) = { 0 }; 213 uint8_t i_hash[BLAKE2S_HASH_SIZE] __aligned(__alignof__(uint32_t)); 214 int i; 215 216 if (keylen > BLAKE2S_BLOCK_SIZE) { 217 blake2s_init(&state, BLAKE2S_HASH_SIZE); 218 blake2s_update(&state, key, keylen); 219 blake2s_final(&state, x_key); 220 } else 221 memcpy(x_key, key, keylen); 222 223 for (i = 0; i < BLAKE2S_BLOCK_SIZE; ++i) 224 x_key[i] ^= 0x36; 225 226 blake2s_init(&state, BLAKE2S_HASH_SIZE); 227 blake2s_update(&state, x_key, BLAKE2S_BLOCK_SIZE); 228 blake2s_update(&state, in, inlen); 229 blake2s_final(&state, i_hash); 230 231 for (i = 0; i < BLAKE2S_BLOCK_SIZE; ++i) 232 x_key[i] ^= 0x5c ^ 0x36; 233 234 blake2s_init(&state, BLAKE2S_HASH_SIZE); 235 blake2s_update(&state, x_key, BLAKE2S_BLOCK_SIZE); 236 blake2s_update(&state, i_hash, BLAKE2S_HASH_SIZE); 237 blake2s_final(&state, i_hash); 238 239 memcpy(out, i_hash, outlen); 240 explicit_bzero(x_key, BLAKE2S_BLOCK_SIZE); 241 explicit_bzero(i_hash, BLAKE2S_HASH_SIZE); 242 } 243