mirror of
https://github.com/aicodix/code.git
synced 2026-04-27 14:30:36 +00:00
36 lines
881 B
C++
36 lines
881 B
C++
/*
|
|
Test for the prime field arithmetic
|
|
|
|
Copyright 2024 Ahmet Inan <inan@aicodix.de>
|
|
*/
|
|
|
|
#include <cstdint>
|
|
#include <cassert>
|
|
#include <iostream>
|
|
#include "prime_field.hh"
|
|
|
|
template <typename TYPE, TYPE PRIME>
|
|
void exhaustive_test()
|
|
{
|
|
typedef CODE::PrimeField<TYPE, PRIME> PF;
|
|
for (TYPE a = 0; a < PRIME; ++a)
|
|
for (TYPE b = 0; b < PRIME; ++b)
|
|
assert((PF(a) * PF(b))() == (a * b) % PRIME);
|
|
for (TYPE a = 1; a < PRIME; ++a)
|
|
assert(rcp(PF(a)) * PF(a) == PF(1));
|
|
for (TYPE a = 0; a < PRIME; ++a)
|
|
for (TYPE b = 0; b < PRIME; ++b)
|
|
assert((PF(a) + PF(b))() == (a + b) % PRIME);
|
|
for (TYPE a = 0; a < PRIME; ++a)
|
|
for (TYPE b = 0; b < PRIME; ++b)
|
|
assert((PF(a) - PF(b))() == (a - b + PRIME) % PRIME);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
exhaustive_test<uint32_t, 257>();
|
|
exhaustive_test<uint64_t, 65537>();
|
|
std::cerr << "Prime field arithmetic test passed!" << std::endl;
|
|
return 0;
|
|
}
|
|
|