^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) // SPDX-License-Identifier: GPL-2.0 OR MIT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) * Copyright (C) 2015-2019 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) * This is an implementation of the BLAKE2s hash and PRF functions.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) * Information: https://blake2.net/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) #include <crypto/internal/blake2s.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) #include <linux/types.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) #include <linux/string.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) #include <linux/kernel.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include <linux/module.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include <linux/init.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) #include <linux/bug.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) #include <asm/unaligned.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) static const u8 blake2s_sigma[10][16] = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0 },
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) static inline void blake2s_increment_counter(struct blake2s_state *state,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) const u32 inc)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) state->t[0] += inc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) state->t[1] += (state->t[0] < inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) void blake2s_compress_generic(struct blake2s_state *state,const u8 *block,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) size_t nblocks, const u32 inc)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) u32 m[16];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) u32 v[16];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) WARN_ON(IS_ENABLED(DEBUG) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) (nblocks > 1 && inc != BLAKE2S_BLOCK_SIZE));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50) while (nblocks > 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) blake2s_increment_counter(state, inc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) memcpy(m, block, BLAKE2S_BLOCK_SIZE);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) le32_to_cpu_array(m, ARRAY_SIZE(m));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) memcpy(v, state->h, 32);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) v[ 8] = BLAKE2S_IV0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) v[ 9] = BLAKE2S_IV1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) v[10] = BLAKE2S_IV2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) v[11] = BLAKE2S_IV3;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) v[12] = BLAKE2S_IV4 ^ state->t[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60) v[13] = BLAKE2S_IV5 ^ state->t[1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) v[14] = BLAKE2S_IV6 ^ state->f[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) v[15] = BLAKE2S_IV7 ^ state->f[1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) #define G(r, i, a, b, c, d) do { \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) a += b + m[blake2s_sigma[r][2 * i + 0]]; \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) d = ror32(d ^ a, 16); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) c += d; \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) b = ror32(b ^ c, 12); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) a += b + m[blake2s_sigma[r][2 * i + 1]]; \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) d = ror32(d ^ a, 8); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) c += d; \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) b = ror32(b ^ c, 7); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) #define ROUND(r) do { \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) G(r, 0, v[0], v[ 4], v[ 8], v[12]); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) G(r, 1, v[1], v[ 5], v[ 9], v[13]); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) G(r, 2, v[2], v[ 6], v[10], v[14]); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) G(r, 3, v[3], v[ 7], v[11], v[15]); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80) G(r, 4, v[0], v[ 5], v[10], v[15]); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) G(r, 5, v[1], v[ 6], v[11], v[12]); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82) G(r, 6, v[2], v[ 7], v[ 8], v[13]); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) G(r, 7, v[3], v[ 4], v[ 9], v[14]); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84) } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) ROUND(0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) ROUND(1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) ROUND(2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) ROUND(3);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) ROUND(4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) ROUND(5);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) ROUND(6);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) ROUND(7);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) ROUND(8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) ROUND(9);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) #undef G
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97) #undef ROUND
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) for (i = 0; i < 8; ++i)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) state->h[i] ^= v[i] ^ v[i + 8];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) block += BLAKE2S_BLOCK_SIZE;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) --nblocks;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) EXPORT_SYMBOL(blake2s_compress_generic);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) MODULE_LICENSE("GPL v2");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) MODULE_DESCRIPTION("BLAKE2s hash function");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) MODULE_AUTHOR("Jason A. Donenfeld <Jason@zx2c4.com>");