serval-dna/nacl/nacl-20110221/crypto_stream/try.c
Daniel O'Connor bf9710fd5a Unpacked nacl-20110221 after processing by nacl-prepare-sources.
This only affects build_android, if nacl-gcc-prep is run then build/`uname -s` will be created.
2012-02-27 12:40:14 +10:30

125 lines
4.0 KiB
C

/*
* crypto_stream/try.c version 20090118
* D. J. Bernstein
* Public domain.
*/
#include <stdlib.h>
#include "crypto_stream.h"
extern unsigned char *alignedcalloc(unsigned long long);
const char *primitiveimplementation = crypto_stream_IMPLEMENTATION;
#define MAXTEST_BYTES 10000
#define CHECKSUM_BYTES 4096
#define TUNE_BYTES 1536
static unsigned char *k;
static unsigned char *n;
static unsigned char *m;
static unsigned char *c;
static unsigned char *s;
static unsigned char *k2;
static unsigned char *n2;
static unsigned char *m2;
static unsigned char *c2;
static unsigned char *s2;
void preallocate(void)
{
}
void allocate(void)
{
k = alignedcalloc(crypto_stream_KEYBYTES);
n = alignedcalloc(crypto_stream_NONCEBYTES);
m = alignedcalloc(MAXTEST_BYTES);
c = alignedcalloc(MAXTEST_BYTES);
s = alignedcalloc(MAXTEST_BYTES);
k2 = alignedcalloc(crypto_stream_KEYBYTES);
n2 = alignedcalloc(crypto_stream_NONCEBYTES);
m2 = alignedcalloc(MAXTEST_BYTES);
c2 = alignedcalloc(MAXTEST_BYTES);
s2 = alignedcalloc(MAXTEST_BYTES);
}
void predoit(void)
{
}
void doit(void)
{
crypto_stream_xor(c,m,TUNE_BYTES,n,k);
}
char checksum[crypto_stream_KEYBYTES * 2 + 1];
const char *checksum_compute(void)
{
long long i;
long long j;
for (i = 0;i < CHECKSUM_BYTES;++i) {
long long mlen = i;
long long clen = i;
long long slen = i;
long long klen = crypto_stream_KEYBYTES;
long long nlen = crypto_stream_NONCEBYTES;
for (j = -16;j < 0;++j) m[j] = random();
for (j = -16;j < 0;++j) c[j] = random();
for (j = -16;j < 0;++j) s[j] = random();
for (j = -16;j < 0;++j) n[j] = random();
for (j = -16;j < 0;++j) k[j] = random();
for (j = mlen;j < mlen + 16;++j) m[j] = random();
for (j = clen;j < clen + 16;++j) c[j] = random();
for (j = slen;j < slen + 16;++j) s[j] = random();
for (j = nlen;j < nlen + 16;++j) n[j] = random();
for (j = klen;j < klen + 16;++j) k[j] = random();
for (j = -16;j < mlen + 16;++j) m2[j] = m[j];
for (j = -16;j < clen + 16;++j) c2[j] = c[j];
for (j = -16;j < slen + 16;++j) s2[j] = s[j];
for (j = -16;j < nlen + 16;++j) n2[j] = n[j];
for (j = -16;j < klen + 16;++j) k2[j] = k[j];
crypto_stream_xor(c,m,mlen,n,k);
for (j = -16;j < mlen + 16;++j) if (m[j] != m2[j]) return "crypto_stream_xor overwrites m";
for (j = -16;j < slen + 16;++j) if (s[j] != s2[j]) return "crypto_stream_xor overwrites s";
for (j = -16;j < nlen + 16;++j) if (n[j] != n2[j]) return "crypto_stream_xor overwrites n";
for (j = -16;j < klen + 16;++j) if (k[j] != k2[j]) return "crypto_stream_xor overwrites k";
for (j = -16;j < 0;++j) if (c[j] != c2[j]) return "crypto_stream_xor writes before output";
for (j = clen;j < clen + 16;++j) if (c[j] != c2[j]) return "crypto_stream_xor writes after output";
for (j = -16;j < clen + 16;++j) c2[j] = c[j];
crypto_stream(s,slen,n,k);
for (j = -16;j < mlen + 16;++j) if (m[j] != m2[j]) return "crypto_stream overwrites m";
for (j = -16;j < clen + 16;++j) if (c[j] != c2[j]) return "crypto_stream overwrites c";
for (j = -16;j < nlen + 16;++j) if (n[j] != n2[j]) return "crypto_stream overwrites n";
for (j = -16;j < klen + 16;++j) if (k[j] != k2[j]) return "crypto_stream overwrites k";
for (j = -16;j < 0;++j) if (s[j] != s2[j]) return "crypto_stream writes before output";
for (j = slen;j < slen + 16;++j) if (s[j] != s2[j]) return "crypto_stream writes after output";
for (j = 0;j < mlen;++j)
if ((s[j] ^ m[j]) != c[j]) return "crypto_stream_xor does not match crypto_stream";
for (j = 0;j < clen;++j) k[j % klen] ^= c[j];
crypto_stream_xor(m,c,clen,n,k);
crypto_stream(s,slen,n,k);
for (j = 0;j < mlen;++j)
if ((s[j] ^ m[j]) != c[j]) return "crypto_stream_xor does not match crypto_stream";
for (j = 0;j < mlen;++j) n[j % nlen] ^= m[j];
m[mlen] = 0;
}
for (i = 0;i < crypto_stream_KEYBYTES;++i) {
checksum[2 * i] = "0123456789abcdef"[15 & (k[i] >> 4)];
checksum[2 * i + 1] = "0123456789abcdef"[15 & k[i]];
}
checksum[2 * i] = 0;
return 0;
}