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