blob: 72abd6166d53490605c9e23432081219de7fb4d9 (
plain)
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
|
/*
* Entropy Source Using Intel's rdrand instruction
* (C) 2012 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/internal/rdrand.h>
#include <botan/cpuid.h>
#include <immintrin.h>
namespace Botan {
/*
* Get the timestamp
*/
void Intel_Rdrand::poll(Entropy_Accumulator& accum)
{
if(!CPUID::has_rdrand())
return;
/*
* Put an upper bound on the total entropy we're willing to claim
* for any one polling of rdrand to prevent it from swamping our
* poll. Internally, the rdrand system is a DRGB that reseeds at a
* somewhat unpredictable rate (the current conditions are
* documented, but that might not be true for different
* implementations, eg on Haswell or a future AMD chip, so I don't
* want to assume). This limit ensures we're going to poll at least
* one other source so we have some diversity in our inputs.
*/
const size_t POLL_UPPER_BOUND = 96;
const size_t RDRAND_POLLS = 32;
const double ENTROPY_PER_POLL =
static_cast<double>(POLL_UPPER_BOUND) / (RDRAND_POLLS * 4);
for(size_t i = 0; i != RDRAND_POLLS; ++i)
{
unsigned int r;
#if BOTAN_USE_GCC_INLINE_ASM
int cf = 0;
asm("rdrand %0; adcl $0,%1" :
"=r" (r), "=r" (cf) : "0" (r), "1" (cf) : "cc");
#else
int cf = _rdrand32_step(&r);
#endif
if(cf == 1)
accum.add(r, ENTROPY_PER_POLL);
}
}
}
|
