mirror of
https://github.com/servalproject/serval-dna.git
synced 2024-12-30 18:07:01 +00:00
bf9710fd5a
This only affects build_android, if nacl-gcc-prep is run then build/`uname -s` will be created.
70 lines
1.8 KiB
C
70 lines
1.8 KiB
C
#include "crypto_auth.h"
|
|
#include "randombytes.h"
|
|
#include "cpucycles.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_auth_IMPLEMENTATION;
|
|
const char *implementationversion = crypto_auth_VERSION;
|
|
const char *sizenames[] = { "outputbytes", "keybytes", 0 };
|
|
const long long sizes[] = { crypto_auth_BYTES, crypto_auth_KEYBYTES };
|
|
|
|
#define MAXTEST_BYTES 4096
|
|
#ifdef SUPERCOP
|
|
#define MGAP 8192
|
|
#else
|
|
#define MGAP 8
|
|
#endif
|
|
|
|
static unsigned char *k;
|
|
static unsigned char *m;
|
|
static unsigned char *h;
|
|
|
|
void preallocate(void)
|
|
{
|
|
}
|
|
|
|
void allocate(void)
|
|
{
|
|
k = alignedcalloc(crypto_auth_KEYBYTES);
|
|
m = alignedcalloc(MAXTEST_BYTES);
|
|
h = alignedcalloc(crypto_auth_BYTES);
|
|
}
|
|
|
|
#define TIMINGS 15
|
|
static long long cycles[TIMINGS + 1];
|
|
|
|
void measure(void)
|
|
{
|
|
int i;
|
|
int loop;
|
|
int mlen;
|
|
|
|
for (loop = 0;loop < LOOPS;++loop) {
|
|
for (mlen = 0;mlen <= MAXTEST_BYTES;mlen += 1 + mlen / MGAP) {
|
|
randombytes(k,crypto_auth_KEYBYTES);
|
|
randombytes(m,mlen);
|
|
randombytes(h,crypto_auth_BYTES);
|
|
for (i = 0;i <= TIMINGS;++i) {
|
|
cycles[i] = cpucycles();
|
|
crypto_auth(h,m,mlen,k);
|
|
}
|
|
for (i = 0;i < TIMINGS;++i) cycles[i] = cycles[i + 1] - cycles[i];
|
|
printentry(mlen,"cycles",cycles,TIMINGS);
|
|
for (i = 0;i <= TIMINGS;++i) {
|
|
cycles[i] = cpucycles();
|
|
crypto_auth_verify(h,m,mlen,k);
|
|
}
|
|
for (i = 0;i < TIMINGS;++i) cycles[i] = cycles[i + 1] - cycles[i];
|
|
printentry(mlen,"verify_cycles",cycles,TIMINGS);
|
|
}
|
|
}
|
|
}
|