1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
#include <fplll/fplll.h>
using namespace fplll;
template <class FT> int test_enum(size_t d)
{
RandGen::init_with_seed(0x1337);
ZZ_mat<mpz_t> A = ZZ_mat<mpz_t>(100, 100);
Z_NR<mpz_t> q;
q = 7681;
A.gen_qary(50, q);
lll_reduction(A);
ZZ_mat<mpz_t> U;
MatGSO<Z_NR<mpz_t>, FP_NR<FT>> M(A, U, U, 0);
M.update_gso();
FastEvaluator<FP_NR<FT>> evaluator;
Enumeration<Z_NR<mpz_t>, FP_NR<FT>> enum_obj(M, evaluator);
FP_NR<FT> max_dist;
M.get_r(max_dist, 0, 0);
max_dist *= 0.99;
enum_obj.enumerate(0, d, max_dist, 0);
int status = 0;
// Check that we haven't screwed up the sum
const auto a = enum_obj.get_nodes_array();
uint64_t total = 0;
for (unsigned int i = 0; i < a.size(); i++)
{
total += a[i];
}
status |= (total != enum_obj.get_nodes());
// Check that we haven't overwritten beyond our bounds
for (unsigned int i = d + 1; i < a.size(); i++)
{
status |= (enum_obj.get_nodes(i) != 0);
}
return status;
}
int main()
{
int status = 0;
// Different, so that we may delegate to either the local enumerator or the
// external one.
status |= test_enum<double>(10);
status |= test_enum<double>(30);
return status;
}
|
