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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
#include <../fplll/sieve/sieve_main.h> /* standalone bin */
#include <cstring>
#include <fplll.h>
#include <test_utils.h>
#ifndef TESTDATADIR
#define TESTDATADIR ".."
#endif
using namespace std;
using namespace fplll;
/**
@brief Test sieve by checking if function returns correct vector.
@param A input lattice
@param b shortest vector
@return
*/
template <class ZT> int test_sieve_alg(ZZ_mat<ZT> &A, vector<Z_NR<mpz_t>> &b, int alg)
{
GaussSieve<ZT, FP_NR<double>> gsieve(A, alg, 0, 0);
Z_NR<ZT> goal_norm;
goal_norm = 0;
gsieve.sieve(goal_norm);
NumVect<Z_NR<ZT>> v = gsieve.return_first();
Z_NR<ZT> tmp;
Z_NR<ZT> norm_s;
Z_NR<ZT> norm_b;
for (int i = 0; i < A.get_cols(); i++)
{
tmp.mul(v[i], v[i]);
norm_s.add(norm_s, tmp);
tmp.mul(b[i], b[i]);
norm_b.add(norm_b, tmp);
}
if (norm_s != norm_b)
return 1;
return 0;
}
template <class ZT> int test_sieve(ZZ_mat<ZT> &A, vector<Z_NR<mpz_t>> &b)
{
int r = 0;
r |= test_sieve_alg<ZT>(A, b, 2);
r |= test_sieve_alg<ZT>(A, b, 3);
r |= test_sieve_alg<ZT>(A, b, 4);
return r;
}
/**
@brief Test sieve for matrix stored in file pointed to by `input_filename`.
@param input_filename a path
@return zero on success
*/
template <class ZT> int test_filename(const char *input_filename, const char *output_filename)
{
ZZ_mat<ZT> A;
int status = 0;
status |= read_matrix(A, input_filename);
vector<Z_NR<mpz_t>> b;
status |= read_vector(b, output_filename);
status |= test_sieve<ZT>(A, b);
return status;
}
/*
Note make check uses the following relative path for the filename.
*/
int main(int /*argc*/, char ** /*argv*/)
{
int status = 0;
status |= test_filename<mpz_t>(TESTDATADIR "/tests/lattices/example_svp_in",
TESTDATADIR "/tests/lattices/example_svp_out");
if (status == 0)
{
cerr << "All tests passed." << endl;
return 0;
}
else
{
return -1;
}
return 0;
}
|
