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
|
/*************************************************
* Randpool Source File *
* (C) 1999-2008 Jack Lloyd *
*************************************************/
#include <botan/randpool.h>
#include <botan/loadstor.h>
#include <botan/xor_buf.h>
#include <botan/util.h>
#include <botan/stl_util.h>
#include <algorithm>
namespace Botan {
namespace {
/*************************************************
* PRF based on a MAC *
*************************************************/
enum RANDPOOL_PRF_TAG {
CIPHER_KEY = 0,
MAC_KEY = 1,
GEN_OUTPUT = 2
};
}
/*************************************************
* Generate a buffer of random bytes *
*************************************************/
void Randpool::randomize(byte out[], u32bit length)
{
if(!is_seeded())
{
reseed();
if(!is_seeded())
throw PRNG_Unseeded(name());
}
update_buffer();
while(length)
{
const u32bit copied = std::min(length, buffer.size());
copy_mem(out, buffer.begin(), copied);
out += copied;
length -= copied;
update_buffer();
}
}
/*************************************************
* Refill the output buffer *
*************************************************/
void Randpool::update_buffer()
{
const u64bit timestamp = system_time();
for(u32bit j = 0; j != counter.size(); ++j)
if(++counter[j])
break;
store_be(timestamp, counter + 4);
mac->update(static_cast<byte>(GEN_OUTPUT));
mac->update(counter, counter.size());
SecureVector<byte> mac_val = mac->final();
for(u32bit j = 0; j != mac_val.size(); ++j)
buffer[j % buffer.size()] ^= mac_val[j];
cipher->encrypt(buffer);
if(counter[0] % ITERATIONS_BEFORE_RESEED == 0)
mix_pool();
}
/*************************************************
* Mix the entropy pool *
*************************************************/
void Randpool::mix_pool()
{
const u32bit BLOCK_SIZE = cipher->BLOCK_SIZE;
mac->update(static_cast<byte>(MAC_KEY));
mac->update(pool, pool.size());
mac->set_key(mac->final());
mac->update(static_cast<byte>(CIPHER_KEY));
mac->update(pool, pool.size());
cipher->set_key(mac->final());
xor_buf(pool, buffer, BLOCK_SIZE);
cipher->encrypt(pool);
for(u32bit j = 1; j != POOL_BLOCKS; ++j)
{
const byte* previous_block = pool + BLOCK_SIZE*(j-1);
byte* this_block = pool + BLOCK_SIZE*j;
xor_buf(this_block, previous_block, BLOCK_SIZE);
cipher->encrypt(this_block);
}
update_buffer();
}
/*************************************************
* Reseed the internal state *
*************************************************/
void Randpool::reseed()
{
SecureVector<byte> buffer(1024);
u32bit gathered_entropy = 0;
for(u32bit j = 0; j != entropy_sources.size(); ++j)
{
u32bit got = entropy_sources[j]->slow_poll(buffer, buffer.size());
mac->update(buffer, got);
gathered_entropy += entropy_estimate(buffer, got);
if(gathered_entropy > 512)
break;
}
SecureVector<byte> mac_val = mac->final();
xor_buf(pool, mac_val, mac_val.size());
mix_pool();
entropy += gathered_entropy;
}
/*************************************************
* Add user-supplied entropy *
*************************************************/
void Randpool::add_entropy(const byte input[], u32bit length)
{
SecureVector<byte> mac_val = mac->process(input, length);
xor_buf(pool, mac_val, mac_val.size());
mix_pool();
entropy += entropy_estimate(input, length);
}
/*************************************************
* Add another entropy source to the list *
*************************************************/
void Randpool::add_entropy_source(EntropySource* src)
{
entropy_sources.push_back(src);
}
/*************************************************
* Check if the the pool is seeded *
*************************************************/
bool Randpool::is_seeded() const
{
return (entropy >= 384);
}
/*************************************************
* Clear memory of sensitive data *
*************************************************/
void Randpool::clear() throw()
{
cipher->clear();
mac->clear();
pool.clear();
buffer.clear();
counter.clear();
entropy = 0;
}
/*************************************************
* Return the name of this type *
*************************************************/
std::string Randpool::name() const
{
return "Randpool(" + cipher->name() + "," + mac->name() + ")";
}
/*************************************************
* Randpool Constructor *
*************************************************/
Randpool::Randpool(BlockCipher* cipher_in,
MessageAuthenticationCode* mac_in,
u32bit pool_blocks,
u32bit iter_before_reseed) :
ITERATIONS_BEFORE_RESEED(iter_before_reseed),
POOL_BLOCKS(pool_blocks),
cipher(cipher_in),
mac(mac_in)
{
const u32bit BLOCK_SIZE = cipher->BLOCK_SIZE;
const u32bit OUTPUT_LENGTH = mac->OUTPUT_LENGTH;
if(OUTPUT_LENGTH < BLOCK_SIZE ||
!cipher->valid_keylength(OUTPUT_LENGTH) ||
!mac->valid_keylength(OUTPUT_LENGTH))
{
delete cipher;
delete mac;
throw Internal_Error("Randpool: Invalid algorithm combination " +
cipher->name() + "/" + mac->name());
}
buffer.create(BLOCK_SIZE);
pool.create(POOL_BLOCKS * BLOCK_SIZE);
counter.create(12);
entropy = 0;
}
/*************************************************
* Randpool Destructor *
*************************************************/
Randpool::~Randpool()
{
delete cipher;
delete mac;
std::for_each(entropy_sources.begin(), entropy_sources.end(),
del_fun<EntropySource>());
entropy = 0;
}
}
|
