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
|
/*
* (C) 2009 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include "speed.h"
#include "apps.h"
#include <iostream>
#include <iomanip>
#include <botan/benchmark.h>
#include <botan/aead.h>
#include <botan/auto_rng.h>
#include <botan/parsing.h>
#include <botan/symkey.h>
#include <botan/hex.h>
#include <chrono>
typedef std::chrono::high_resolution_clock benchmark_clock;
using namespace Botan;
namespace {
const std::vector<std::string> default_benchmark_list = {
/* Block ciphers */
"AES-128",
"AES-192",
"AES-256",
"Blowfish",
"CAST-128",
"CAST-256",
"DES",
"IDEA",
"KASUMI",
"MARS",
"MISTY1",
"Noekeon",
"RC2",
"RC5(16)",
"RC6",
"SAFER-SK(10)",
"SEED",
"Serpent",
"Skipjack",
"Square",
"TEA",
"TripleDES",
"Threefish-512",
"Twofish",
"XTEA",
/* Cipher modes */
"AES-128/CBC",
"AES-128/CTR-BE",
"AES-128/EAX",
"AES-128/OCB",
"AES-128/GCM",
"AES-128/XTS",
"Serpent/CBC",
"Serpent/CTR-BE",
"Serpent/EAX",
"Serpent/OCB",
"Serpent/GCM",
"Serpent/XTS",
/* Stream ciphers */
"RC4",
"Salsa20",
/* Hashes */
"Keccak-1600(512)",
"MD5",
"RIPEMD-160",
"SHA-160",
"SHA-256",
"SHA-384",
"SHA-512",
"Skein-512",
"Tiger",
"Whirlpool",
/* MACs */
"CMAC(AES-128)",
"HMAC(SHA-1)"
};
void report_results(const std::string& algo,
const std::map<std::string, double>& speeds)
{
if(speeds.empty())
return;
// invert, showing fastest impl first
std::map<double, std::string> results;
for(auto i = speeds.begin(); i != speeds.end(); ++i)
{
// Speeds might collide, tweak slightly to handle this
if(results[i->second] == "")
results[i->second] = i->first;
else
results[i->second - .01] = i->first;
}
std::cout << algo;
for(auto i = results.rbegin(); i != results.rend(); ++i)
{
std::cout << " [" << i->second << "] "
<< std::fixed << std::setprecision(2) << i->first;
}
std::cout << std::endl;
}
void time_transform(std::unique_ptr<Transform> tf,
RandomNumberGenerator& rng)
{
if(!tf)
return;
const std::chrono::seconds runtime(2);
for(size_t buf_size : { 16, 64, 256, 1024, 8192 })
{
secure_vector<byte> buffer(buf_size);
std::chrono::nanoseconds time_used(0);
tf->start(rng.random_vec(tf->default_nonce_length()));
auto start = std::chrono::high_resolution_clock::now();
secure_vector<byte> buf(buf_size);
size_t reps = 0;
while(time_used < runtime)
{
tf->update(buf);
buf.resize(buf_size);
++reps;
time_used = std::chrono::high_resolution_clock::now() - start;
}
const u64bit nsec_used = std::chrono::duration_cast<std::chrono::nanoseconds>(time_used).count();
const double seconds_used = static_cast<double>(nsec_used) / 1000000000;
const double Mbps = ((reps / seconds_used) * buf_size) / 1024 / 1024;
std::cout << tf->name() << " " << std::setprecision(4) << Mbps
<< " MiB / sec with " << buf_size << " byte blocks\n";
}
}
void time_transform(const std::string& algo, RandomNumberGenerator& rng)
{
std::unique_ptr<Transform> tf;
tf.reset(get_cipher_mode(algo, ENCRYPTION));
if(Keyed_Transform* keyed = dynamic_cast<Keyed_Transform*>(tf.get()))
keyed->set_key(rng.random_vec(keyed->key_spec().maximum_keylength()));
time_transform(std::move(tf), rng);
}
void bench_algo(const std::string& algo,
RandomNumberGenerator& rng,
double seconds,
size_t buf_size)
{
std::chrono::milliseconds ms(
static_cast<std::chrono::milliseconds::rep>(seconds * 1000));
std::map<std::string, double> speeds = algorithm_benchmark(algo, rng, ms, buf_size);
report_results(algo, speeds);
if(speeds.empty())
time_transform(algo, rng);
if(speeds.empty())
bench_pk(rng, algo, seconds);
}
int speed(int argc, char* argv[])
{
OptionParser opts("seconds=|buf-size=");
opts.parse(argv);
double seconds = .5;
u32bit buf_size = 16;
if(opts.is_set("seconds"))
{
seconds = std::atof(opts.value("seconds").c_str());
if(seconds < 0.1 || seconds > (5 * 60))
{
std::cout << "Invalid argument to --seconds\n";
return 2;
}
}
if(opts.is_set("buf-size"))
{
buf_size = std::atoi(opts.value("buf-size").c_str());
if(buf_size == 0 || buf_size > 1024)
{
std::cout << "Invalid argument to --buf-size\n";
return 2;
}
}
auto args = opts.arguments();
if(args.empty())
args = default_benchmark_list;
if(args[0] == "help" || args[0] == "-h")
{
std::cout << "Usage: " << argv[0] << " [algo name...]\n";
return 1;
}
AutoSeeded_RNG rng;
for(auto alg: args)
bench_algo(alg, rng, seconds, buf_size);
return 0;
}
REGISTER_APP(speed);
}
|
