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
|
/*
* HMAC_RNG
* (C) 2008-2009,2013 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/hmac_rng.h>
#include <botan/libstate.h>
#include <botan/get_byte.h>
#include <botan/entropy_src.h>
#include <botan/internal/xor_buf.h>
#include <algorithm>
#include <chrono>
namespace Botan {
namespace {
void hmac_prf(MessageAuthenticationCode& prf,
secure_vector<byte>& K,
u32bit& counter,
const std::string& label)
{
typedef std::chrono::high_resolution_clock clock;
auto timestamp = clock::now().time_since_epoch().count();
prf.update(K);
prf.update(label);
prf.update_be(timestamp);
prf.update_be(counter);
prf.final(&K[0]);
++counter;
}
}
/*
* HMAC_RNG Constructor
*/
HMAC_RNG::HMAC_RNG(MessageAuthenticationCode* extractor,
MessageAuthenticationCode* prf) :
m_extractor(extractor), m_prf(prf)
{
if(!m_prf->valid_keylength(m_extractor->output_length()) ||
!m_extractor->valid_keylength(m_prf->output_length()))
throw Invalid_Argument("HMAC_RNG: Bad algo combination " +
m_extractor->name() + " and " +
m_prf->name());
// First PRF inputs are all zero, as specified in section 2
m_K.resize(m_prf->output_length());
/*
Normally we want to feedback PRF outputs to the extractor function
to ensure a single bad poll does not reduce entropy. Thus in reseed
we'll want to invoke the PRF before we reset the PRF key, but until
the first reseed the PRF is unkeyed. Rather than trying to keep
track of this, just set the initial PRF key to constant zero.
Since all PRF inputs in the first reseed are constants, this
amounts to suffixing the seed in the first poll with a fixed
constant string.
The PRF key will not be used to generate outputs until after reseed
sets m_seeded to true.
*/
secure_vector<byte> prf_key(m_extractor->output_length());
m_prf->set_key(prf_key);
/*
Use PRF("Botan HMAC_RNG XTS") as the intitial XTS key.
This will be used during the first extraction sequence; XTS values
after this one are generated using the PRF.
If I understand the E-t-E paper correctly (specifically Section 4),
using this fixed extractor key is safe to do.
*/
m_extractor->set_key(prf->process("Botan HMAC_RNG XTS"));
}
/*
* Generate a buffer of random bytes
*/
void HMAC_RNG::randomize(byte out[], size_t length)
{
if(!is_seeded())
{
reseed(256);
if(!is_seeded())
throw PRNG_Unseeded(name());
}
const size_t max_per_prf_iter = m_prf->output_length() / 2;
m_output_since_reseed += length;
if(m_output_since_reseed >= BOTAN_RNG_MAX_OUTPUT_BEFORE_RESEED)
reseed(BOTAN_RNG_RESEED_POLL_BITS);
/*
HMAC KDF as described in E-t-E, using a CTXinfo of "rng"
*/
while(length)
{
hmac_prf(*m_prf, m_K, m_counter, "rng");
const size_t copied = std::min<size_t>(length, max_per_prf_iter);
copy_mem(out, &m_K[0], copied);
out += copied;
length -= copied;
}
}
/*
* Poll for entropy and reset the internal keys
*/
void HMAC_RNG::reseed(size_t poll_bits)
{
/*
Using the terminology of E-t-E, XTR is the MAC function (normally
HMAC) seeded with XTS (below) and we form SKM, the key material, by
polling as many sources as we think needed to reach our polling
goal. We then also include feedback of the current PRK so that
a bad poll doesn't wipe us out.
*/
double bits_collected = 0;
Entropy_Accumulator accum(
[&](const byte in[], size_t in_len, double entropy_estimate)
{
m_extractor->update(in, in_len);
bits_collected += entropy_estimate;
return (bits_collected >= poll_bits);
});
global_state().poll_available_sources(accum);
/*
* It is necessary to feed forward poll data. Otherwise, a good poll
* (collecting a large amount of conditional entropy) followed by a
* bad one (collecting little) would be unsafe. Do this by
* generating new PRF outputs using the previous key and feeding
* them into the extractor function.
*
* Cycle the RNG once (CTXinfo="rng"), then generate a new PRF
* output using the CTXinfo "reseed". Provide these values as input
* to the extractor function.
*/
hmac_prf(*m_prf, m_K, m_counter, "rng");
m_extractor->update(m_K); // K is the CTXinfo=rng PRF output
hmac_prf(*m_prf, m_K, m_counter, "reseed");
m_extractor->update(m_K); // K is the CTXinfo=reseed PRF output
/* Now derive the new PRK using everything that has been fed into
the extractor, and set the PRF key to that */
m_prf->set_key(m_extractor->final());
// Now generate a new PRF output to use as the XTS extractor salt
hmac_prf(*m_prf, m_K, m_counter, "xts");
m_extractor->set_key(m_K);
// Reset state
zeroise(m_K);
m_counter = 0;
m_collected_entropy_estimate =
std::min<size_t>(m_collected_entropy_estimate + bits_collected,
m_extractor->output_length() * 8);
m_output_since_reseed = 0;
}
bool HMAC_RNG::is_seeded() const
{
return (m_collected_entropy_estimate >= 256);
}
/*
* Add user-supplied entropy to the extractor input
*/
void HMAC_RNG::add_entropy(const byte input[], size_t length)
{
m_extractor->update(input, length);
reseed(BOTAN_RNG_RESEED_POLL_BITS);
}
/*
* Clear memory of sensitive data
*/
void HMAC_RNG::clear()
{
m_collected_entropy_estimate = 0;
m_extractor->clear();
m_prf->clear();
zeroise(m_K);
m_counter = 0;
}
/*
* Return the name of this type
*/
std::string HMAC_RNG::name() const
{
return "HMAC_RNG(" + m_extractor->name() + "," + m_prf->name() + ")";
}
}
|
