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