mirror of
https://github.com/opnsense/src.git
synced 2026-03-01 04:40:53 -05:00
0ac341f145
Bring in https://github.com/jedisct1/libsodium at 461ac93b260b91db8ad957f5a576860e3e9c88a1 (August 7, 2018), unmodified. libsodium is derived from Daniel J. Bernstein et al.'s 2011 NaCl ("Networking and Cryptography Library," pronounced "salt") software library. At the risk of oversimplifying, libsodium primarily exists to make it easier to use NaCl. NaCl and libsodium provide high quality implementations of a number of useful cryptographic concepts (as well as the underlying primitics) seeing some adoption in newer network protocols. I considered but dismissed cleaning up the directory hierarchy and discarding artifacts of other build systems in favor of remaining close to upstream (and easing future updates). Nothing is integrated into the build system yet, so in that sense, no functional change.
178 lines
6.4 KiB
C
178 lines
6.4 KiB
C
#define TEST_NAME "sodium_utils"
|
|
#include "cmptest.h"
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
unsigned char buf_add[1000];
|
|
unsigned char buf1[1000];
|
|
unsigned char buf2[1000];
|
|
unsigned char buf1_rev[1000];
|
|
unsigned char buf2_rev[1000];
|
|
unsigned char nonce[24];
|
|
char nonce_hex[49];
|
|
unsigned char *bin_padded;
|
|
size_t bin_len, bin_len2;
|
|
size_t bin_padded_len;
|
|
size_t bin_padded_maxlen;
|
|
size_t blocksize;
|
|
unsigned int i;
|
|
unsigned int j;
|
|
|
|
randombytes_buf(buf1, sizeof buf1);
|
|
memcpy(buf2, buf1, sizeof buf2);
|
|
printf("%d\n", sodium_memcmp(buf1, buf2, sizeof buf1));
|
|
sodium_memzero(buf1, 0U);
|
|
printf("%d\n", sodium_memcmp(buf1, buf2, sizeof buf1));
|
|
sodium_memzero(buf1, sizeof buf1 / 2);
|
|
printf("%d\n", sodium_memcmp(buf1, buf2, sizeof buf1));
|
|
printf("%d\n", sodium_memcmp(buf1, buf2, 0U));
|
|
sodium_memzero(buf2, sizeof buf2 / 2);
|
|
printf("%d\n", sodium_memcmp(buf1, buf2, sizeof buf1));
|
|
|
|
memset(nonce, 0, sizeof nonce);
|
|
sodium_increment(nonce, sizeof nonce);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
memset(nonce, 255, sizeof nonce);
|
|
sodium_increment(nonce, sizeof nonce);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
nonce[1] = 1U;
|
|
sodium_increment(nonce, sizeof nonce);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
nonce[1] = 0U;
|
|
sodium_increment(nonce, sizeof nonce);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
nonce[0] = 255U;
|
|
nonce[2] = 255U;
|
|
sodium_increment(nonce, sizeof nonce);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
for (i = 0U; i < 1000U; i++) {
|
|
bin_len = (size_t) randombytes_uniform(sizeof buf1);
|
|
randombytes_buf(buf1, bin_len);
|
|
randombytes_buf(buf2, bin_len);
|
|
for (j = 0U; j < bin_len; j++) {
|
|
buf1_rev[bin_len - 1 - j] = buf1[j];
|
|
buf2_rev[bin_len - 1 - j] = buf2[j];
|
|
}
|
|
if (memcmp(buf1_rev, buf2_rev, bin_len) *
|
|
sodium_compare(buf1, buf2, bin_len) <
|
|
0) {
|
|
printf("sodium_compare() failure with length=%u\n",
|
|
(unsigned int) bin_len);
|
|
}
|
|
memcpy(buf1, buf2, bin_len);
|
|
if (sodium_compare(buf1, buf2, bin_len)) {
|
|
printf("sodium_compare() equality failure with length=%u\n",
|
|
(unsigned int) bin_len);
|
|
}
|
|
}
|
|
memset(buf1, 0, sizeof buf1);
|
|
if (sodium_is_zero(buf1, sizeof buf1) != 1) {
|
|
printf("sodium_is_zero() failed\n");
|
|
}
|
|
for (i = 0U; i < sizeof buf1; i++) {
|
|
buf1[i]++;
|
|
if (sodium_is_zero(buf1, sizeof buf1) != 0) {
|
|
printf("sodium_is_zero() failed\n");
|
|
}
|
|
buf1[i]--;
|
|
}
|
|
bin_len = randombytes_uniform(sizeof buf1);
|
|
randombytes_buf(buf1, bin_len);
|
|
memcpy(buf2, buf1, bin_len);
|
|
memset(buf_add, 0, bin_len);
|
|
j = randombytes_uniform(10000);
|
|
for (i = 0U; i < j; i++) {
|
|
sodium_increment(buf1, bin_len);
|
|
sodium_increment(buf_add, bin_len);
|
|
}
|
|
sodium_add(buf2, buf_add, bin_len);
|
|
if (sodium_compare(buf1, buf2, bin_len) != 0) {
|
|
printf("sodium_add() failed\n");
|
|
}
|
|
bin_len = randombytes_uniform(sizeof buf1);
|
|
randombytes_buf(buf1, bin_len);
|
|
memcpy(buf2, buf1, bin_len);
|
|
memset(buf_add, 0xff, bin_len);
|
|
sodium_increment(buf2, bin_len);
|
|
sodium_increment(buf2, 0U);
|
|
sodium_add(buf2, buf_add, bin_len);
|
|
sodium_add(buf2, buf_add, 0U);
|
|
if (sodium_compare(buf1, buf2, bin_len) != 0) {
|
|
printf("sodium_add() failed\n");
|
|
}
|
|
|
|
assert(sizeof nonce >= 24U);
|
|
memset(nonce, 0xfe, 24U);
|
|
memset(nonce, 0xff, 6U);
|
|
sodium_increment(nonce, 8U);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
memset(nonce, 0xfe, 24U);
|
|
memset(nonce, 0xff, 10U);
|
|
sodium_increment(nonce, 12U);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
memset(nonce, 0xff, 22U);
|
|
sodium_increment(nonce, 24U);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
|
|
assert(sizeof nonce >= 24U);
|
|
memset(nonce, 0xfe, 24U);
|
|
memset(nonce, 0xff, 6U);
|
|
sodium_add(nonce, nonce, 7U);
|
|
sodium_add(nonce, nonce, 8U);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
memset(nonce, 0xfe, 24U);
|
|
memset(nonce, 0xff, 10U);
|
|
sodium_add(nonce, nonce, 11U);
|
|
sodium_add(nonce, nonce, 12U);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
memset(nonce, 0xff, 22U);
|
|
sodium_add(nonce, nonce, 23U);
|
|
sodium_add(nonce, nonce, 24U);
|
|
printf("%s\n",
|
|
sodium_bin2hex(nonce_hex, sizeof nonce_hex, nonce, sizeof nonce));
|
|
|
|
for (i = 0; i < 2000U; i++) {
|
|
bin_len = randombytes_uniform(200U);
|
|
blocksize = 1U + randombytes_uniform(100U);
|
|
bin_padded_maxlen = bin_len + (blocksize - bin_len % blocksize);
|
|
bin_padded = (unsigned char *) sodium_malloc(bin_padded_maxlen);
|
|
randombytes_buf(bin_padded, bin_padded_maxlen);
|
|
|
|
assert(sodium_pad(&bin_padded_len, bin_padded, bin_len,
|
|
blocksize, bin_padded_maxlen - 1U) == -1);
|
|
assert(sodium_pad(NULL, bin_padded, bin_len,
|
|
blocksize, bin_padded_maxlen + 1U) == 0);
|
|
assert(sodium_pad(&bin_padded_len, bin_padded, bin_len,
|
|
blocksize, bin_padded_maxlen + 1U) == 0);
|
|
assert(sodium_pad(&bin_padded_len, bin_padded, bin_len,
|
|
0U, bin_padded_maxlen) == -1);
|
|
assert(sodium_pad(&bin_padded_len, bin_padded, bin_len,
|
|
blocksize, bin_padded_maxlen) == 0);
|
|
assert(bin_padded_len == bin_padded_maxlen);
|
|
|
|
assert(sodium_unpad(&bin_len2, bin_padded, bin_padded_len,
|
|
bin_padded_len + 1U) == -1);
|
|
assert(sodium_unpad(&bin_len2, bin_padded, bin_padded_len,
|
|
0U) == -1);
|
|
assert(sodium_unpad(&bin_len2, bin_padded, bin_padded_len,
|
|
blocksize) == 0);
|
|
assert(bin_len2 == bin_len);
|
|
|
|
sodium_free(bin_padded);
|
|
}
|
|
|
|
sodium_stackzero(512);
|
|
|
|
return 0;
|
|
}
|