1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
/*
* SHACAL-2
* (C) 2017 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/shacal2.h>
#include <botan/loadstor.h>
#include <botan/cpuid.h>
namespace Botan {
namespace {
inline void SHACAL2_Fwd(uint32_t A, uint32_t B, uint32_t C, uint32_t& D,
uint32_t E, uint32_t F, uint32_t G, uint32_t& H,
uint32_t RK)
{
const uint32_t A_rho = rotate_right(A, 2) ^ rotate_right(A, 13) ^ rotate_right(A, 22);
const uint32_t E_rho = rotate_right(E, 6) ^ rotate_right(E, 11) ^ rotate_right(E, 25);
H += E_rho + ((E & F) ^ (~E & G)) + RK;
D += H;
H += A_rho + ((A & B) | ((A | B) & C));
}
inline void SHACAL2_Rev(uint32_t A, uint32_t B, uint32_t C, uint32_t& D,
uint32_t E, uint32_t F, uint32_t G, uint32_t& H,
uint32_t RK)
{
const uint32_t A_rho = rotate_right(A, 2) ^ rotate_right(A, 13) ^ rotate_right(A, 22);
const uint32_t E_rho = rotate_right(E, 6) ^ rotate_right(E, 11) ^ rotate_right(E, 25);
H -= A_rho + ((A & B) | ((A | B) & C));
D -= H;
H -= E_rho + ((E & F) ^ (~E & G)) + RK;
}
}
/*
* SHACAL2 Encryption
*/
void SHACAL2::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const
{
#if defined(BOTAN_HAS_SHACAL2_SIMD)
if(CPUID::has_simd_32())
{
while(blocks >= 4)
{
simd_encrypt_4(in, out);
in += 4*BLOCK_SIZE;
out += 4*BLOCK_SIZE;
blocks -= 4;
}
}
#endif
for(size_t i = 0; i != blocks; ++i)
{
uint32_t A = load_be<uint32_t>(in, 0);
uint32_t B = load_be<uint32_t>(in, 1);
uint32_t C = load_be<uint32_t>(in, 2);
uint32_t D = load_be<uint32_t>(in, 3);
uint32_t E = load_be<uint32_t>(in, 4);
uint32_t F = load_be<uint32_t>(in, 5);
uint32_t G = load_be<uint32_t>(in, 6);
uint32_t H = load_be<uint32_t>(in, 7);
for(size_t r = 0; r != 64; r += 8)
{
SHACAL2_Fwd(A, B, C, D, E, F, G, H, m_RK[r+0]);
SHACAL2_Fwd(H, A, B, C, D, E, F, G, m_RK[r+1]);
SHACAL2_Fwd(G, H, A, B, C, D, E, F, m_RK[r+2]);
SHACAL2_Fwd(F, G, H, A, B, C, D, E, m_RK[r+3]);
SHACAL2_Fwd(E, F, G, H, A, B, C, D, m_RK[r+4]);
SHACAL2_Fwd(D, E, F, G, H, A, B, C, m_RK[r+5]);
SHACAL2_Fwd(C, D, E, F, G, H, A, B, m_RK[r+6]);
SHACAL2_Fwd(B, C, D, E, F, G, H, A, m_RK[r+7]);
}
store_be(out, A, B, C, D, E, F, G, H);
in += BLOCK_SIZE;
out += BLOCK_SIZE;
}
}
/*
* SHACAL2 Encryption
*/
void SHACAL2::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const
{
#if defined(BOTAN_HAS_SHACAL2_SIMD)
if(CPUID::has_simd_32())
{
while(blocks >= 4)
{
simd_decrypt_4(in, out);
in += 4*BLOCK_SIZE;
out += 4*BLOCK_SIZE;
blocks -= 4;
}
}
#endif
for(size_t i = 0; i != blocks; ++i)
{
uint32_t A = load_be<uint32_t>(in, 0);
uint32_t B = load_be<uint32_t>(in, 1);
uint32_t C = load_be<uint32_t>(in, 2);
uint32_t D = load_be<uint32_t>(in, 3);
uint32_t E = load_be<uint32_t>(in, 4);
uint32_t F = load_be<uint32_t>(in, 5);
uint32_t G = load_be<uint32_t>(in, 6);
uint32_t H = load_be<uint32_t>(in, 7);
for(size_t r = 0; r != 64; r += 8)
{
SHACAL2_Rev(B, C, D, E, F, G, H, A, m_RK[63-r]);
SHACAL2_Rev(C, D, E, F, G, H, A, B, m_RK[62-r]);
SHACAL2_Rev(D, E, F, G, H, A, B, C, m_RK[61-r]);
SHACAL2_Rev(E, F, G, H, A, B, C, D, m_RK[60-r]);
SHACAL2_Rev(F, G, H, A, B, C, D, E, m_RK[59-r]);
SHACAL2_Rev(G, H, A, B, C, D, E, F, m_RK[58-r]);
SHACAL2_Rev(H, A, B, C, D, E, F, G, m_RK[57-r]);
SHACAL2_Rev(A, B, C, D, E, F, G, H, m_RK[56-r]);
}
store_be(out, A, B, C, D, E, F, G, H);
in += BLOCK_SIZE;
out += BLOCK_SIZE;
}
}
/*
* SHACAL2 Key Schedule
*/
void SHACAL2::key_schedule(const uint8_t key[], size_t len)
{
const uint32_t RC[64] = {
0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2
};
if(m_RK.empty())
m_RK.resize(64);
else
clear_mem(m_RK.data(), m_RK.size());
load_be(m_RK.data(), key, len/4);
for(size_t i = 16; i != 64; ++i)
{
const uint32_t sigma0_15 = rotate_right(m_RK[i-15], 7) ^ rotate_right(m_RK[i-15], 18) ^ (m_RK[i-15] >> 3);
const uint32_t sigma1_2 = rotate_right(m_RK[i-2], 17) ^ rotate_right(m_RK[i-2], 19) ^ (m_RK[i-2] >> 10);
m_RK[i] = m_RK[i-16] + sigma0_15 + m_RK[i-7] + sigma1_2;
}
for(size_t i = 0; i != 64; ++i)
{
m_RK[i] += RC[i];
}
}
size_t SHACAL2::parallelism() const
{
#if defined(BOTAN_HAS_SHACAL2_SIMD)
if(CPUID::has_simd_32())
{
return 4;
}
#endif
return 1;
}
std::string SHACAL2::provider() const
{
#if defined(BOTAN_HAS_SHACAL2_SIMD)
if(CPUID::has_simd_32())
{
return "simd";
}
#endif
return "base";
}
/*
* Clear memory of sensitive data
*/
void SHACAL2::clear()
{
zap(m_RK);
}
}
|
