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
|
#include <stdlib.h>
#include "randombytes.h"
#include "cpucycles.h"
#include "crypto_scalarmult.h"
extern void printentry(long long,const char *,long long *,long long);
extern unsigned char *alignedcalloc(unsigned long long);
extern const char *primitiveimplementation;
extern const char *implementationversion;
extern const char *sizenames[];
extern const long long sizes[];
extern void allocate(void);
extern void measure(void);
const char *primitiveimplementation = crypto_scalarmult_IMPLEMENTATION;
const char *implementationversion = crypto_scalarmult_VERSION;
const char *sizenames[] = { "outputbytes", "scalarbytes", 0 };
const long long sizes[] = { crypto_scalarmult_BYTES, crypto_scalarmult_SCALARBYTES };
static unsigned char *m;
static unsigned char *n;
static unsigned char *p;
static unsigned char *q;
void preallocate(void)
{
}
void allocate(void)
{
m = alignedcalloc(crypto_scalarmult_SCALARBYTES);
n = alignedcalloc(crypto_scalarmult_SCALARBYTES);
p = alignedcalloc(crypto_scalarmult_BYTES);
q = alignedcalloc(crypto_scalarmult_BYTES);
}
#define TIMINGS 63
static long long cycles[TIMINGS + 1];
void measure(void)
{
int i;
int loop;
for (loop = 0;loop < LOOPS;++loop) {
randombytes(m,crypto_scalarmult_SCALARBYTES);
randombytes(n,crypto_scalarmult_SCALARBYTES);
for (i = 0;i <= TIMINGS;++i) {
cycles[i] = cpucycles();
crypto_scalarmult_base(p,m);
}
for (i = 0;i < TIMINGS;++i) cycles[i] = cycles[i + 1] - cycles[i];
printentry(-1,"base_cycles",cycles,TIMINGS);
for (i = 0;i <= TIMINGS;++i) {
cycles[i] = cpucycles();
crypto_scalarmult(q,n,p);
}
for (i = 0;i < TIMINGS;++i) cycles[i] = cycles[i + 1] - cycles[i];
printentry(-1,"cycles",cycles,TIMINGS);
}
}
|
