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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
|
/*
* XTS Mode
* (C) 2009,2013 Jack Lloyd
* (C) 2016 Daniel Neus, Rohde & Schwarz Cybersecurity
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/xts.h>
#include <botan/internal/poly_dbl.h>
namespace Botan {
XTS_Mode::XTS_Mode(BlockCipher* cipher) : m_cipher(cipher)
{
if(m_cipher->block_size() != 8 &&
m_cipher->block_size() != 16 &&
m_cipher->block_size() != 32 &&
m_cipher->block_size() != 64)
{
throw Invalid_Argument("Cannot use " + cipher->name() + " with XTS");
}
m_tweak_cipher.reset(m_cipher->clone());
m_tweak.resize(update_granularity());
}
void XTS_Mode::clear()
{
m_cipher->clear();
m_tweak_cipher->clear();
reset();
}
void XTS_Mode::reset()
{
zeroise(m_tweak);
}
std::string XTS_Mode::name() const
{
return cipher().name() + "/XTS";
}
size_t XTS_Mode::update_granularity() const
{
return cipher().parallel_bytes();
}
size_t XTS_Mode::minimum_final_size() const
{
return cipher().block_size() + 1;
}
Key_Length_Specification XTS_Mode::key_spec() const
{
return cipher().key_spec().multiple(2);
}
size_t XTS_Mode::default_nonce_length() const
{
return cipher().block_size();
}
bool XTS_Mode::valid_nonce_length(size_t n) const
{
return cipher().block_size() == n;
}
void XTS_Mode::key_schedule(const uint8_t key[], size_t length)
{
const size_t key_half = length / 2;
if(length % 2 == 1 || !m_cipher->valid_keylength(key_half))
throw Invalid_Key_Length(name(), length);
m_cipher->set_key(key, key_half);
m_tweak_cipher->set_key(&key[key_half], key_half);
}
void XTS_Mode::start_msg(const uint8_t nonce[], size_t nonce_len)
{
if(!valid_nonce_length(nonce_len))
throw Invalid_IV_Length(name(), nonce_len);
copy_mem(m_tweak.data(), nonce, nonce_len);
m_tweak_cipher->encrypt(m_tweak.data());
update_tweak(0);
}
void XTS_Mode::update_tweak(size_t which)
{
const size_t BS = m_tweak_cipher->block_size();
if(which > 0)
poly_double_n_le(m_tweak.data(), &m_tweak[(which-1)*BS], BS);
const size_t blocks_in_tweak = update_granularity() / BS;
for(size_t i = 1; i < blocks_in_tweak; ++i)
poly_double_n_le(&m_tweak[i*BS], &m_tweak[(i-1)*BS], BS);
}
size_t XTS_Encryption::output_length(size_t input_length) const
{
return input_length;
}
size_t XTS_Encryption::process(uint8_t buf[], size_t sz)
{
const size_t BS = cipher().block_size();
BOTAN_ASSERT(sz % BS == 0, "Input is full blocks");
size_t blocks = sz / BS;
const size_t blocks_in_tweak = update_granularity() / BS;
while(blocks)
{
const size_t to_proc = std::min(blocks, blocks_in_tweak);
const size_t to_proc_bytes = to_proc * BS;
xor_buf(buf, tweak(), to_proc_bytes);
cipher().encrypt_n(buf, buf, to_proc);
xor_buf(buf, tweak(), to_proc_bytes);
buf += to_proc * BS;
blocks -= to_proc;
update_tweak(to_proc);
}
return sz;
}
void XTS_Encryption::finish(secure_vector<uint8_t>& buffer, size_t offset)
{
BOTAN_ASSERT(buffer.size() >= offset, "Offset is sane");
const size_t sz = buffer.size() - offset;
uint8_t* buf = buffer.data() + offset;
BOTAN_ASSERT(sz >= minimum_final_size(), "Have sufficient final input in XTS encrypt");
const size_t BS = cipher().block_size();
if(sz % BS == 0)
{
update(buffer, offset);
}
else
{
// steal ciphertext
const size_t full_blocks = ((sz / BS) - 1) * BS;
const size_t final_bytes = sz - full_blocks;
BOTAN_ASSERT(final_bytes > BS && final_bytes < 2*BS, "Left over size in expected range");
secure_vector<uint8_t> last(buf + full_blocks, buf + full_blocks + final_bytes);
buffer.resize(full_blocks + offset);
update(buffer, offset);
xor_buf(last, tweak(), BS);
cipher().encrypt(last);
xor_buf(last, tweak(), BS);
for(size_t i = 0; i != final_bytes - BS; ++i)
{
last[i] ^= last[i + BS];
last[i + BS] ^= last[i];
last[i] ^= last[i + BS];
}
xor_buf(last, tweak() + BS, BS);
cipher().encrypt(last);
xor_buf(last, tweak() + BS, BS);
buffer += last;
}
}
size_t XTS_Decryption::output_length(size_t input_length) const
{
return input_length;
}
size_t XTS_Decryption::process(uint8_t buf[], size_t sz)
{
const size_t BS = cipher().block_size();
BOTAN_ASSERT(sz % BS == 0, "Input is full blocks");
size_t blocks = sz / BS;
const size_t blocks_in_tweak = update_granularity() / BS;
while(blocks)
{
const size_t to_proc = std::min(blocks, blocks_in_tweak);
const size_t to_proc_bytes = to_proc * BS;
xor_buf(buf, tweak(), to_proc_bytes);
cipher().decrypt_n(buf, buf, to_proc);
xor_buf(buf, tweak(), to_proc_bytes);
buf += to_proc * BS;
blocks -= to_proc;
update_tweak(to_proc);
}
return sz;
}
void XTS_Decryption::finish(secure_vector<uint8_t>& buffer, size_t offset)
{
BOTAN_ASSERT(buffer.size() >= offset, "Offset is sane");
const size_t sz = buffer.size() - offset;
uint8_t* buf = buffer.data() + offset;
BOTAN_ASSERT(sz >= minimum_final_size(), "Have sufficient final input in XTS decrypt");
const size_t BS = cipher().block_size();
if(sz % BS == 0)
{
update(buffer, offset);
}
else
{
// steal ciphertext
const size_t full_blocks = ((sz / BS) - 1) * BS;
const size_t final_bytes = sz - full_blocks;
BOTAN_ASSERT(final_bytes > BS && final_bytes < 2*BS, "Left over size in expected range");
secure_vector<uint8_t> last(buf + full_blocks, buf + full_blocks + final_bytes);
buffer.resize(full_blocks + offset);
update(buffer, offset);
xor_buf(last, tweak() + BS, BS);
cipher().decrypt(last);
xor_buf(last, tweak() + BS, BS);
for(size_t i = 0; i != final_bytes - BS; ++i)
{
last[i] ^= last[i + BS];
last[i + BS] ^= last[i];
last[i] ^= last[i + BS];
}
xor_buf(last, tweak(), BS);
cipher().decrypt(last);
xor_buf(last, tweak(), BS);
buffer += last;
}
}
}
|
