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
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
|
/* nettle-benchmark.c
Tests the performance of the various algorithms.
Copyright (C) 2001, 2010, 2014 Niels Möller
This file is part of GNU Nettle.
GNU Nettle is free software: you can redistribute it and/or
modify it under the terms of either:
* the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at your
option) any later version.
or
* the GNU General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version.
or both in parallel, as here.
GNU Nettle is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received copies of the GNU General Public License and
the GNU Lesser General Public License along with this program. If
not, see http://www.gnu.org/licenses/.
*/
#if HAVE_CONFIG_H
# include "config.h"
#endif
#include <assert.h>
#include <errno.h>
#include <math.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include "timing.h"
#include "aes.h"
#include "arcfour.h"
#include "blowfish.h"
#include "cast128.h"
#include "cbc.h"
#include "ctr.h"
#include "des.h"
#include "eax.h"
#include "gcm.h"
#include "memxor.h"
#include "salsa20.h"
#include "serpent.h"
#include "sha1.h"
#include "sha2.h"
#include "sha3.h"
#include "twofish.h"
#include "umac.h"
#include "poly1305.h"
#include "nettle-meta.h"
#include "nettle-internal.h"
#include "getopt.h"
static double frequency = 0.0;
/* Process BENCH_BLOCK bytes at a time, for BENCH_INTERVAL seconds. */
#define BENCH_BLOCK 10240
#define BENCH_INTERVAL 0.1
/* FIXME: Proper configure test for rdtsc? */
#ifndef WITH_CYCLE_COUNTER
# if defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__))
# define WITH_CYCLE_COUNTER 1
# else
# define WITH_CYCLE_COUNTER 0
# endif
#endif
#if WITH_CYCLE_COUNTER
# if defined(__i386__)
#define GET_CYCLE_COUNTER(hi, lo) \
__asm__("xorl %%eax,%%eax\n" \
"movl %%ebx, %%edi\n" \
"cpuid\n" \
"rdtsc\n" \
"movl %%edi, %%ebx\n" \
: "=a" (lo), "=d" (hi) \
: /* No inputs. */ \
: "%edi", "%ecx", "cc")
# elif defined(__x86_64__)
#define GET_CYCLE_COUNTER(hi, lo) \
__asm__("xorl %%eax,%%eax\n" \
"mov %%rbx, %%r10\n" \
"cpuid\n" \
"rdtsc\n" \
"mov %%r10, %%rbx\n" \
: "=a" (lo), "=d" (hi) \
: /* No inputs. */ \
: "%r10", "%rcx", "cc")
# endif
#define BENCH_ITERATIONS 10
#endif
static void NORETURN PRINTF_STYLE(1,2)
die(const char *format, ...)
{
va_list args;
va_start(args, format);
vfprintf(stderr, format, args);
va_end(args);
exit(EXIT_FAILURE);
}
static double overhead = 0.0;
/* Returns second per function call */
static double
time_function(void (*f)(void *arg), void *arg)
{
unsigned ncalls;
double elapsed;
for (ncalls = 10 ;;)
{
unsigned i;
time_start();
for (i = 0; i < ncalls; i++)
f(arg);
elapsed = time_end();
if (elapsed > BENCH_INTERVAL)
break;
else if (elapsed < BENCH_INTERVAL / 10)
ncalls *= 10;
else
ncalls *= 2;
}
return elapsed / ncalls - overhead;
}
static void
bench_nothing(void *arg UNUSED)
{
return;
}
struct bench_memxor_info
{
uint8_t *dst;
const uint8_t *src;
const uint8_t *other;
};
static void
bench_memxor(void *arg)
{
struct bench_memxor_info *info = arg;
memxor (info->dst, info->src, BENCH_BLOCK);
}
static void
bench_memxor3(void *arg)
{
struct bench_memxor_info *info = arg;
memxor3 (info->dst, info->src, info->other, BENCH_BLOCK);
}
struct bench_hash_info
{
void *ctx;
nettle_hash_update_func *update;
const uint8_t *data;
};
static void
bench_hash(void *arg)
{
struct bench_hash_info *info = arg;
info->update(info->ctx, BENCH_BLOCK, info->data);
}
struct bench_cipher_info
{
void *ctx;
nettle_cipher_func *crypt;
uint8_t *data;
};
static void
bench_cipher(void *arg)
{
struct bench_cipher_info *info = arg;
info->crypt(info->ctx, BENCH_BLOCK, info->data, info->data);
}
struct bench_cbc_info
{
void *ctx;
nettle_cipher_func *crypt;
uint8_t *data;
unsigned block_size;
uint8_t *iv;
};
static void
bench_cbc_encrypt(void *arg)
{
struct bench_cbc_info *info = arg;
cbc_encrypt(info->ctx, info->crypt,
info->block_size, info->iv,
BENCH_BLOCK, info->data, info->data);
}
static void
bench_cbc_decrypt(void *arg)
{
struct bench_cbc_info *info = arg;
cbc_decrypt(info->ctx, info->crypt,
info->block_size, info->iv,
BENCH_BLOCK, info->data, info->data);
}
static void
bench_ctr(void *arg)
{
struct bench_cbc_info *info = arg;
ctr_crypt(info->ctx, info->crypt,
info->block_size, info->iv,
BENCH_BLOCK, info->data, info->data);
}
struct bench_aead_info
{
void *ctx;
nettle_crypt_func *crypt;
nettle_hash_update_func *update;
uint8_t *data;
};
static void
bench_aead_crypt(void *arg)
{
const struct bench_aead_info *info = arg;
info->crypt (info->ctx, BENCH_BLOCK, info->data, info->data);
}
static void
bench_aead_update(void *arg)
{
const struct bench_aead_info *info = arg;
info->update (info->ctx, BENCH_BLOCK, info->data);
}
/* Set data[i] = floor(sqrt(i)) */
static void
init_data(uint8_t *data)
{
unsigned i,j;
for (i = j = 0; i<BENCH_BLOCK; i++)
{
if (j*j < i)
j++;
data[i] = j;
}
}
static void
init_key(unsigned length,
uint8_t *key)
{
unsigned i;
for (i = 0; i<length; i++)
key[i] = i;
}
static void
init_nonce(unsigned length,
uint8_t *nonce)
{
unsigned i;
for (i = 0; i<length; i++)
nonce[i] = 3*i;
}
static void
header(void)
{
printf("%18s %11s Mbyte/s%s\n",
"Algorithm", "mode",
frequency > 0.0 ? " cycles/byte cycles/block" : "");
}
static void
display(const char *name, const char *mode, unsigned block_size,
double time)
{
printf("%18s %11s %7.2f",
name, mode,
BENCH_BLOCK / (time * 1048576.0));
if (frequency > 0.0)
{
printf(" %11.2f", time * frequency / BENCH_BLOCK);
if (block_size > 0)
printf(" %12.2f", time * frequency * block_size / BENCH_BLOCK);
}
printf("\n");
}
static void *
xalloc(size_t size)
{
void *p = malloc(size);
if (!p)
die("Virtual memory exhausted.\n");
return p;
}
static void
time_overhead(void)
{
overhead = time_function(bench_nothing, NULL);
printf("benchmark call overhead: %7f us", overhead * 1e6);
if (frequency > 0.0)
printf("%7.2f cycles\n", overhead * frequency);
printf("\n");
}
static void
time_memxor(void)
{
struct bench_memxor_info info;
uint8_t src[BENCH_BLOCK + sizeof(long)];
uint8_t other[BENCH_BLOCK + sizeof(long)];
uint8_t dst[BENCH_BLOCK];
info.src = src;
info.dst = dst;
display ("memxor", "aligned", sizeof(unsigned long),
time_function(bench_memxor, &info));
info.src = src + 1;
display ("memxor", "unaligned", sizeof(unsigned long),
time_function(bench_memxor, &info));
info.src = src;
info.other = other;
display ("memxor3", "aligned", sizeof(unsigned long),
time_function(bench_memxor3, &info));
info.other = other + 1;
display ("memxor3", "unaligned01", sizeof(unsigned long),
time_function(bench_memxor3, &info));
info.src = src + 1;
display ("memxor3", "unaligned11", sizeof(unsigned long),
time_function(bench_memxor3, &info));
info.other = other + 2;
display ("memxor3", "unaligned12", sizeof(unsigned long),
time_function(bench_memxor3, &info));
}
static void
time_hash(const struct nettle_hash *hash)
{
static uint8_t data[BENCH_BLOCK];
struct bench_hash_info info;
info.ctx = xalloc(hash->context_size);
info.update = hash->update;
info.data = data;
init_data(data);
hash->init(info.ctx);
display(hash->name, "update", hash->block_size,
time_function(bench_hash, &info));
free(info.ctx);
}
static void
time_umac(void)
{
static uint8_t data[BENCH_BLOCK];
struct bench_hash_info info;
struct umac32_ctx ctx32;
struct umac64_ctx ctx64;
struct umac96_ctx ctx96;
struct umac128_ctx ctx128;
uint8_t key[16];
umac32_set_key (&ctx32, key);
info.ctx = &ctx32;
info.update = (nettle_hash_update_func *) umac32_update;
info.data = data;
display("umac32", "update", UMAC_BLOCK_SIZE,
time_function(bench_hash, &info));
umac64_set_key (&ctx64, key);
info.ctx = &ctx64;
info.update = (nettle_hash_update_func *) umac64_update;
info.data = data;
display("umac64", "update", UMAC_BLOCK_SIZE,
time_function(bench_hash, &info));
umac96_set_key (&ctx96, key);
info.ctx = &ctx96;
info.update = (nettle_hash_update_func *) umac96_update;
info.data = data;
display("umac96", "update", UMAC_BLOCK_SIZE,
time_function(bench_hash, &info));
umac128_set_key (&ctx128, key);
info.ctx = &ctx128;
info.update = (nettle_hash_update_func *) umac128_update;
info.data = data;
display("umac128", "update", UMAC_BLOCK_SIZE,
time_function(bench_hash, &info));
}
static void
time_poly1305_aes(void)
{
static uint8_t data[BENCH_BLOCK];
struct bench_hash_info info;
struct poly1305_aes_ctx ctx;
uint8_t key[32];
poly1305_aes_set_key (&ctx, key);
info.ctx = &ctx;
info.update = (nettle_hash_update_func *) poly1305_aes_update;
info.data = data;
display("poly1305-aes", "update", 1024,
time_function(bench_hash, &info));
}
static int
prefix_p(const char *prefix, const char *s)
{
size_t i;
for (i = 0; prefix[i]; i++)
if (prefix[i] != s[i])
return 0;
return 1;
}
static int
block_cipher_p(const struct nettle_cipher *cipher)
{
/* Don't use nettle cbc and ctr for openssl ciphers. */
return cipher->block_size > 0 && !prefix_p("openssl", cipher->name);
}
static void
time_cipher(const struct nettle_cipher *cipher)
{
void *ctx = xalloc(cipher->context_size);
uint8_t *key = xalloc(cipher->key_size);
static uint8_t data[BENCH_BLOCK];
printf("\n");
init_data(data);
{
/* Decent initializers are a GNU extension, so don't use it here. */
struct bench_cipher_info info;
info.ctx = ctx;
info.crypt = cipher->encrypt;
info.data = data;
init_key(cipher->key_size, key);
cipher->set_encrypt_key(ctx, key);
display(cipher->name, "ECB encrypt", cipher->block_size,
time_function(bench_cipher, &info));
}
{
struct bench_cipher_info info;
info.ctx = ctx;
info.crypt = cipher->decrypt;
info.data = data;
init_key(cipher->key_size, key);
cipher->set_decrypt_key(ctx, key);
display(cipher->name, "ECB decrypt", cipher->block_size,
time_function(bench_cipher, &info));
}
if (block_cipher_p(cipher))
{
uint8_t *iv = xalloc(cipher->block_size);
/* Do CBC mode */
{
struct bench_cbc_info info;
info.ctx = ctx;
info.crypt = cipher->encrypt;
info.data = data;
info.block_size = cipher->block_size;
info.iv = iv;
memset(iv, 0, sizeof(cipher->block_size));
cipher->set_encrypt_key(ctx, key);
display(cipher->name, "CBC encrypt", cipher->block_size,
time_function(bench_cbc_encrypt, &info));
}
{
struct bench_cbc_info info;
info.ctx = ctx;
info.crypt = cipher->decrypt;
info.data = data;
info.block_size = cipher->block_size;
info.iv = iv;
memset(iv, 0, sizeof(cipher->block_size));
cipher->set_decrypt_key(ctx, key);
display(cipher->name, "CBC decrypt", cipher->block_size,
time_function(bench_cbc_decrypt, &info));
}
/* Do CTR mode */
{
struct bench_cbc_info info;
info.ctx = ctx;
info.crypt = cipher->encrypt;
info.data = data;
info.block_size = cipher->block_size;
info.iv = iv;
memset(iv, 0, sizeof(cipher->block_size));
cipher->set_encrypt_key(ctx, key);
display(cipher->name, "CTR", cipher->block_size,
time_function(bench_ctr, &info));
}
free(iv);
}
free(ctx);
free(key);
}
static void
time_aead(const struct nettle_aead *aead)
{
void *ctx = xalloc(aead->context_size);
uint8_t *key = xalloc(aead->key_size);
uint8_t *nonce = xalloc(aead->nonce_size);
static uint8_t data[BENCH_BLOCK];
printf("\n");
init_data(data);
if (aead->set_nonce)
init_nonce (aead->nonce_size, nonce);
{
/* Decent initializers are a GNU extension, so don't use it here. */
struct bench_aead_info info;
info.ctx = ctx;
info.crypt = aead->encrypt;
info.data = data;
init_key(aead->key_size, key);
aead->set_encrypt_key(ctx, key);
if (aead->set_nonce)
aead->set_nonce (ctx, nonce);
display(aead->name, "encrypt", aead->block_size,
time_function(bench_aead_crypt, &info));
}
{
struct bench_aead_info info;
info.ctx = ctx;
info.crypt = aead->decrypt;
info.data = data;
init_key(aead->key_size, key);
aead->set_decrypt_key(ctx, key);
if (aead->set_nonce)
aead->set_nonce (ctx, nonce);
display(aead->name, "decrypt", aead->block_size,
time_function(bench_aead_crypt, &info));
}
if (aead->update)
{
struct bench_aead_info info;
info.ctx = ctx;
info.update = aead->update;
info.data = data;
aead->set_encrypt_key(ctx, key);
if (aead->set_nonce)
aead->set_nonce (ctx, nonce);
display(aead->name, "update", aead->block_size,
time_function(bench_aead_update, &info));
}
free(ctx);
free(key);
free(nonce);
}
/* Try to get accurate cycle times for assembler functions. */
#if WITH_CYCLE_COUNTER
static int
compare_double(const void *ap, const void *bp)
{
double a = *(const double *) ap;
double b = *(const double *) bp;
if (a < b)
return -1;
else if (a > b)
return 1;
else
return 0;
}
#define TIME_CYCLES(t, code) do { \
double tc_count[5]; \
uint32_t tc_start_lo, tc_start_hi, tc_end_lo, tc_end_hi; \
unsigned tc_i, tc_j; \
for (tc_j = 0; tc_j < 5; tc_j++) \
{ \
tc_i = 0; \
GET_CYCLE_COUNTER(tc_start_hi, tc_start_lo); \
for (; tc_i < BENCH_ITERATIONS; tc_i++) \
{ code; } \
\
GET_CYCLE_COUNTER(tc_end_hi, tc_end_lo); \
\
tc_end_hi -= (tc_start_hi + (tc_start_lo > tc_end_lo)); \
tc_end_lo -= tc_start_lo; \
\
tc_count[tc_j] = ldexp(tc_end_hi, 32) + tc_end_lo; \
} \
qsort(tc_count, 5, sizeof(double), compare_double); \
(t) = tc_count[2] / BENCH_ITERATIONS; \
} while (0)
static void
bench_sha1_compress(void)
{
uint32_t state[_SHA1_DIGEST_LENGTH];
uint8_t data[SHA1_BLOCK_SIZE];
double t;
TIME_CYCLES (t, _nettle_sha1_compress(state, data));
printf("sha1_compress: %.2f cycles\n", t);
}
static void
bench_salsa20_core(void)
{
uint32_t state[_SALSA20_INPUT_LENGTH];
double t;
TIME_CYCLES (t, _nettle_salsa20_core(state, state, 20));
printf("salsa20_core: %.2f cycles\n", t);
}
static void
bench_sha3_permute(void)
{
struct sha3_state state;
double t;
TIME_CYCLES (t, sha3_permute (&state));
printf("sha3_permute: %.2f cycles (%.2f / round)\n", t, t / 24.0);
}
#else
#define bench_sha1_compress()
#define bench_salsa20_core()
#define bench_sha3_permute()
#endif
#if WITH_OPENSSL
# define OPENSSL(x) x,
#else
# define OPENSSL(x)
#endif
int
main(int argc, char **argv)
{
unsigned i;
int c;
const char *alg;
const struct nettle_hash *hashes[] =
{
&nettle_md2, &nettle_md4, &nettle_md5,
OPENSSL(&nettle_openssl_md5)
&nettle_sha1, OPENSSL(&nettle_openssl_sha1)
&nettle_sha224, &nettle_sha256,
&nettle_sha384, &nettle_sha512,
&nettle_sha512_224, &nettle_sha512_256,
&nettle_sha3_224, &nettle_sha3_256,
&nettle_sha3_384, &nettle_sha3_512,
&nettle_ripemd160, &nettle_gosthash94,
NULL
};
const struct nettle_cipher *ciphers[] =
{
&nettle_aes128, &nettle_aes192, &nettle_aes256,
OPENSSL(&nettle_openssl_aes128)
OPENSSL(&nettle_openssl_aes192)
OPENSSL(&nettle_openssl_aes256)
&nettle_blowfish128, OPENSSL(&nettle_openssl_blowfish128)
&nettle_camellia128, &nettle_camellia192, &nettle_camellia256,
&nettle_cast128, OPENSSL(&nettle_openssl_cast128)
&nettle_des, OPENSSL(&nettle_openssl_des)
&nettle_des3,
&nettle_serpent256,
&nettle_twofish128, &nettle_twofish192, &nettle_twofish256,
NULL
};
const struct nettle_aead *aeads[] =
{
/* Stream ciphers */
&nettle_arcfour128, OPENSSL(&nettle_openssl_arcfour128)
&nettle_salsa20, &nettle_salsa20r12, &nettle_chacha,
/* Proper AEAD algorithme. */
&nettle_gcm_aes128,
&nettle_gcm_aes192,
&nettle_gcm_aes256,
&nettle_gcm_camellia128,
&nettle_gcm_camellia256,
&nettle_eax_aes128,
&nettle_chacha_poly1305,
NULL
};
enum { OPT_HELP = 300 };
static const struct option options[] =
{
/* Name, args, flag, val */
{ "help", no_argument, NULL, OPT_HELP },
{ "clock-frequency", required_argument, NULL, 'f' },
{ NULL, 0, NULL, 0 }
};
while ( (c = getopt_long(argc, argv, "f:", options, NULL)) != -1)
switch (c)
{
case 'f':
frequency = atof(optarg);
if (frequency > 0.0)
break;
case OPT_HELP:
printf("Usage: nettle-benchmark [-f clock frequency] [alg]\n");
return EXIT_SUCCESS;
case '?':
return EXIT_FAILURE;
default:
abort();
}
alg = argv[optind];
time_init();
bench_sha1_compress();
bench_salsa20_core();
bench_sha3_permute();
printf("\n");
time_overhead();
header();
if (!alg || strstr ("memxor", alg))
{
time_memxor();
printf("\n");
}
for (i = 0; hashes[i]; i++)
if (!alg || strstr(hashes[i]->name, alg))
time_hash(hashes[i]);
if (!alg || strstr ("umac", alg))
time_umac();
if (!alg || strstr ("poly1305-aes", alg))
time_poly1305_aes();
for (i = 0; ciphers[i]; i++)
if (!alg || strstr(ciphers[i]->name, alg))
time_cipher(ciphers[i]);
for (i = 0; aeads[i]; i++)
if (!alg || strstr(aeads[i]->name, alg))
time_aead(aeads[i]);
return 0;
}
|