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
|
/*
* Streebog
* (C) 2017 Ribose Inc.
* (C) 2018 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/streebog.h>
#include <botan/exceptn.h>
namespace Botan {
extern const uint64_t STREEBOG_Ax[8][256];
extern const uint64_t STREEBOG_C[12][8];
std::unique_ptr<HashFunction> Streebog::copy_state() const
{
return std::unique_ptr<HashFunction>(new Streebog(*this));
}
Streebog::Streebog(size_t output_bits) :
m_output_bits(output_bits),
m_count(0),
m_position(0),
m_buffer(64),
m_h(8),
m_S(8)
{
if(output_bits != 256 && output_bits != 512)
throw Invalid_Argument("Streebog: Invalid output length " +
std::to_string(output_bits));
clear();
}
std::string Streebog::name() const
{
return "Streebog-" + std::to_string(m_output_bits);
}
/*
* Clear memory of sensitive data
*/
void Streebog::clear()
{
m_count = 0;
m_position = 0;
zeroise(m_buffer);
zeroise(m_S);
const uint64_t fill = (m_output_bits == 512) ? 0 : 0x0101010101010101;
std::fill(m_h.begin(), m_h.end(), fill);
}
/*
* Update the hash
*/
void Streebog::add_data(const uint8_t input[], size_t length)
{
const size_t block_size = m_buffer.size();
if(m_position)
{
buffer_insert(m_buffer, m_position, input, length);
if(m_position + length >= block_size)
{
compress(m_buffer.data());
m_count += 512;
input += (block_size - m_position);
length -= (block_size - m_position);
m_position = 0;
}
}
const size_t full_blocks = length / block_size;
const size_t remaining = length % block_size;
for(size_t i = 0; i != full_blocks; ++i)
{
compress(input + block_size * i);
m_count += 512;
}
buffer_insert(m_buffer, m_position, input + full_blocks * block_size, remaining);
m_position += remaining;
}
/*
* Finalize a hash
*/
void Streebog::final_result(uint8_t output[])
{
m_buffer[m_position++] = 0x01;
if(m_position != m_buffer.size())
clear_mem(&m_buffer[m_position], m_buffer.size() - m_position);
compress(m_buffer.data());
m_count += (m_position - 1) * 8;
zeroise(m_buffer);
store_le(m_count, m_buffer.data());
compress(m_buffer.data(), true);
compress_64(m_S.data(), true);
// FIXME
std::memcpy(output, &m_h[8 - output_length() / 8], output_length());
clear();
}
namespace {
inline uint64_t force_le(uint64_t x)
{
#if defined(BOTAN_TARGET_CPU_IS_LITTLE_ENDIAN)
return x;
#elif defined(BOTAN_TARGET_CPU_IS_BIG_ENDIAN)
return reverse_bytes(x);
#else
store_le(x, reinterpret_cast<uint8_t*>(&x));
return x;
#endif
}
inline void lps(uint64_t block[8])
{
uint8_t r[64];
// FIXME
std::memcpy(r, block, 64);
for(int i = 0; i < 8; ++i)
{
block[i] = force_le(STREEBOG_Ax[0][r[i + 0*8]]) ^
force_le(STREEBOG_Ax[1][r[i + 1*8]]) ^
force_le(STREEBOG_Ax[2][r[i + 2*8]]) ^
force_le(STREEBOG_Ax[3][r[i + 3*8]]) ^
force_le(STREEBOG_Ax[4][r[i + 4*8]]) ^
force_le(STREEBOG_Ax[5][r[i + 5*8]]) ^
force_le(STREEBOG_Ax[6][r[i + 6*8]]) ^
force_le(STREEBOG_Ax[7][r[i + 7*8]]);
}
}
} //namespace
void Streebog::compress(const uint8_t input[], bool last_block)
{
uint64_t M[8];
std::memcpy(M, input, 64);
compress_64(M, last_block);
}
void Streebog::compress_64(const uint64_t M[], bool last_block)
{
uint64_t N = force_le(last_block ? 0ULL : m_count);
uint64_t hN[8];
uint64_t A[8];
copy_mem(hN, m_h.data(), 8);
hN[0] ^= N;
lps(hN);
copy_mem(A, hN, 8);
for(size_t i = 0; i != 8; ++i)
{
hN[i] ^= M[i];
}
for(size_t i = 0; i < 12; ++i)
{
for(size_t j = 0; j != 8; ++j)
A[j] ^= force_le(STREEBOG_C[i][j]);
lps(A);
lps(hN);
for(size_t j = 0; j != 8; ++j)
hN[j] ^= A[j];
}
for(size_t i = 0; i != 8; ++i)
{
m_h[i] ^= hN[i] ^ M[i];
}
if(!last_block)
{
uint64_t carry = 0;
for(int i = 0; i < 8; i++)
{
const uint64_t m = force_le(M[i]);
const uint64_t hi = force_le(m_S[i]);
const uint64_t t = hi + m;
m_S[i] = force_le(t + carry);
carry = (t < hi ? 1 : 0) | (t < m ? 1 : 0);
}
}
}
}
|
