static uint8_t field_pow_calc(uint8_t a, uint8_t e) {
uint8_t ret = 1;
for (uint8_t i = 0; i < e; i++)
static uint8_t field_pow_calc(uint8_t a, uint8_t e) {
uint8_t ret = 1;
for (uint8_t i = 0; i < e; i++)
assert(field_mul_calc(i, field_invert(i)) == 1);
// Test multiplication with the logarithm tables
assert(field_mul_calc(i, field_invert(i)) == 1);
// Test multiplication with the logarithm tables
for (uint16_t j = 0; j < P; j++)
assert(field_mul(i, j) == field_mul_calc(i, j));
}
for (uint16_t j = 0; j < P; j++)
assert(field_mul(i, j) == field_mul_calc(i, j));
}
char* files[P]; uint8_t files_count = 0;
char *in_file = (void*)0, *out_file_param = (void*)0;
char* files[P]; uint8_t files_count = 0;
char *in_file = (void*)0, *out_file_param = (void*)0;
for (uint32_t i = 0; i < secret_length; i++) {
a[0] = secret[i];
for (uint8_t j = 1; j < k; j++)
assert(fread(&a[j], sizeof(uint8_t), 1, random) == 1);
for (uint32_t i = 0; i < secret_length; i++) {
a[0] = secret[i];
for (uint8_t j = 1; j < k; j++)
assert(fread(&a[j], sizeof(uint8_t), 1, random) == 1);
D[j][i] = calculateQ(a, k, j+1);
if (i % 32 == 0 && i != 0)
D[j][i] = calculateQ(a, k, j+1);
if (i % 32 == 0 && i != 0)
char out_file_name_buf[strlen(out_file_param) + 4];
strcpy(out_file_name_buf, out_file_param);
char out_file_name_buf[strlen(out_file_param) + 4];
strcpy(out_file_name_buf, out_file_param);