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
|
/*
* Runtime benchmarking
* (C) 2008 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/benchmark.h>
#include <botan/buf_comp.h>
#include <botan/block_cipher.h>
#include <botan/stream_cipher.h>
#include <botan/hash.h>
#include <botan/mac.h>
#include <botan/time.h>
#include <memory>
namespace Botan {
namespace {
/**
* Benchmark BufferedComputation (hash or MAC)
*/
std::pair<u64bit, u64bit> bench_buf_comp(BufferedComputation* buf_comp,
u64bit nanoseconds_max,
const byte buf[], u32bit buf_len)
{
u64bit reps = 0;
u64bit nanoseconds_used = 0;
while(nanoseconds_used < nanoseconds_max)
{
const u64bit start = get_nanoseconds_clock();
buf_comp->update(buf, buf_len);
nanoseconds_used += get_nanoseconds_clock() - start;
++reps;
}
return std::make_pair(reps * buf_len, nanoseconds_used);
}
/**
* Benchmark block cipher
*/
std::pair<u64bit, u64bit>
bench_block_cipher(BlockCipher* block_cipher,
u64bit nanoseconds_max,
byte buf[], u32bit buf_len)
{
const u32bit in_blocks = buf_len / block_cipher->BLOCK_SIZE;
u64bit reps = 0;
u64bit nanoseconds_used = 0;
block_cipher->set_key(buf, block_cipher->MAXIMUM_KEYLENGTH);
while(nanoseconds_used < nanoseconds_max)
{
const u64bit start = get_nanoseconds_clock();
block_cipher->encrypt_n(buf, buf, in_blocks);
nanoseconds_used += get_nanoseconds_clock() - start;
++reps;
}
return std::make_pair(reps * in_blocks * block_cipher->BLOCK_SIZE,
nanoseconds_used);
}
/**
* Benchmark stream
*/
std::pair<u64bit, u64bit>
bench_stream_cipher(StreamCipher* stream_cipher,
u64bit nanoseconds_max,
byte buf[], u32bit buf_len)
{
u64bit reps = 0;
u64bit nanoseconds_used = 0;
stream_cipher->set_key(buf, stream_cipher->MAXIMUM_KEYLENGTH);
while(nanoseconds_used < nanoseconds_max)
{
const u64bit start = get_nanoseconds_clock();
stream_cipher->cipher1(buf, buf_len);
nanoseconds_used += get_nanoseconds_clock() - start;
++reps;
}
return std::make_pair(reps * buf_len, nanoseconds_used);
}
/**
* Benchmark hash
*/
std::pair<u64bit, u64bit>
bench_hash(HashFunction* hash,
u64bit nanoseconds_max,
const byte buf[], u32bit buf_len)
{
return bench_buf_comp(hash, nanoseconds_max, buf, buf_len);
}
/**
* Benchmark MAC
*/
std::pair<u64bit, u64bit>
bench_mac(MessageAuthenticationCode* mac,
u64bit nanoseconds_max,
const byte buf[], u32bit buf_len)
{
mac->set_key(buf, mac->MAXIMUM_KEYLENGTH);
return bench_buf_comp(mac, nanoseconds_max, buf, buf_len);
}
}
std::map<std::string, double>
algorithm_benchmark(const std::string& name,
u32bit milliseconds,
RandomNumberGenerator& rng,
Algorithm_Factory& af)
{
std::vector<std::string> providers = af.providers_of(name);
std::map<std::string, double> all_results;
if(providers.empty()) // no providers, nothing to do
return all_results;
const u64bit ns_per_provider =
(static_cast<u64bit>(milliseconds) * 1000 * 1000) / providers.size();
std::vector<byte> buf(16 * 1024);
rng.randomize(&buf[0], buf.size());
for(u32bit i = 0; i != providers.size(); ++i)
{
const std::string provider = providers[i];
std::pair<u64bit, u64bit> results(0, 0);
if(const BlockCipher* proto =
af.prototype_block_cipher(name, provider))
{
std::auto_ptr<BlockCipher> block_cipher(proto->clone());
results = bench_block_cipher(block_cipher.get(),
ns_per_provider,
&buf[0], buf.size());
}
else if(const StreamCipher* proto =
af.prototype_stream_cipher(name, provider))
{
std::auto_ptr<StreamCipher> stream_cipher(proto->clone());
results = bench_stream_cipher(stream_cipher.get(),
ns_per_provider,
&buf[0], buf.size());
}
else if(const HashFunction* proto =
af.prototype_hash_function(name, provider))
{
std::auto_ptr<HashFunction> hash(proto->clone());
results = bench_hash(hash.get(), ns_per_provider,
&buf[0], buf.size());
}
else if(const MessageAuthenticationCode* proto =
af.prototype_mac(name, provider))
{
std::auto_ptr<MessageAuthenticationCode> mac(proto->clone());
results = bench_mac(mac.get(), ns_per_provider,
&buf[0], buf.size());
}
if(results.first && results.second)
{
/* 953.67 == 1000 * 1000 * 1000 / 1024 / 1024 - the conversion
factor from bytes per nanosecond to mebibytes per second.
*/
double speed = (953.67 * results.first) / results.second;
all_results[provider] = speed;
}
}
return all_results;
}
}
|
