PySEAL/SEALTest/util/nussbaumer.cpp at master · Lab41/PySEAL · GitHub

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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
#include "CppUnitTest.h"
#include "seal/util/nussbaumer.h"
#include "seal/util/polyarith.h"
#include "seal/util/uintarith.h"
#include "seal/bigpoly.h"
#include <random>

using namespace Microsoft::VisualStudio::CppUnitTestFramework;
using namespace seal;
using namespace seal::util;
using namespace std;

namespace SEALTest
{
    namespace util
    {
        TEST_CLASS(PolyFFTMult)
        {
        public:
            TEST_METHOD(NussbaumerMultiplyPolyPolyBase)
            {
                BigPoly poly1(5, 128);
                BigPoly poly2(5, 128);
                BigPoly result(5, 128);
                poly1[0] = 5;
                poly1[1] = 1;
                poly1[2] = 3;
                poly1[3] = 8;
                poly2[0] = 7;
                poly2[1] = 7;
                poly2[3] = 2;
                MemoryPool &pool = *global_variables::global_memory_pool;
                nussbaumer_multiply_poly_poly(poly1.pointer(), poly2.pointer(), 2, 2, 2, 2, result.pointer(), pool);
                Assert::IsTrue("57x^3 + Cx^2 + 24x^1 + FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFE9" == result.to_string());

                result.resize(5, 64);
                result.set_zero();
                nussbaumer_multiply_poly_poly(poly1.pointer(), poly2.pointer(), 2, 2, 2, 1, result.pointer(), pool);
                Assert::IsTrue("57x^3 + Cx^2 + 24x^1 + FFFFFFFFFFFFFFE9" == result.to_string());

                result.resize(5, 128);
                result.set_zero();
                poly1.resize(5, 64);
                poly2.resize(5, 64);
                nussbaumer_multiply_poly_poly(poly1.pointer(), poly2.pointer(), 2, 1, 2,2, result.pointer(), pool);
                Assert::IsTrue("57x^3 + Cx^2 + 24x^1 + FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFE9" == result.to_string());
            }

            TEST_METHOD(NussbaumerMultiplyPolyPoly)
            {
                const int coeff_power = 8;
                const int coeff_count = (1 << coeff_power) + 1;
                BigPoly poly1(coeff_count, 128);
                BigPoly poly2(coeff_count, 128);
                BigPoly polymod(coeff_count, 128);
                BigPoly correct(2 * coeff_count, 128);
                BigPoly result(coeff_count, 128);
                default_random_engine random;
                random.seed(0);
                for (int i = 0; i < coeff_count - 1; ++i)
                {
                    poly1[i] = random() % 100;
                    poly2[i] = random() % 100;
                }
                polymod[0] = 1;
                polymod[coeff_count - 1] = 1;
                MemoryPool &pool = *global_variables::global_memory_pool;
                multiply_poly_poly(poly1.pointer(), coeff_count, 2, poly2.pointer(), coeff_count, 2, 2 * coeff_count, 2, correct.pointer(), pool);
                for (int i = coeff_count - 1; i < 2 * coeff_count; ++i)
                {
                    uint64_t *lower_coeff = get_poly_coeff(correct.pointer(), i - (coeff_count - 1), 2);
                    uint64_t *upper_coeff = get_poly_coeff(correct.pointer(), i, 2);
                    sub_uint_uint(lower_coeff, upper_coeff, 2, lower_coeff);
                    set_zero_uint(2, upper_coeff);
                }
                nussbaumer_multiply_poly_poly(poly1.pointer(), poly2.pointer(), coeff_power, 2, 2, 2, result.pointer(), pool);
                for (int i = 0; i < coeff_count; ++i)
                {
                    Assert::IsTrue(correct[i] == result[i]);
                }
            }

            TEST_METHOD(NussbaumerCrossMultiplyPolyPolyBase)
            {
                BigPoly poly1(5, 64);
                BigPoly poly2(5, 64);
                BigPoly result11(5, 128);
                BigPoly result12(5, 128);
                BigPoly result22(5, 128);

                poly1[0] = 5;
                poly1[1] = 1;
                poly1[2] = 3;
                poly1[3] = 1;

                poly2[0] = 7;
                poly2[1] = 7;
                poly2[2] = 3;
                poly2[3] = 2;

                int coeff_count_power = 2;

                MemoryPool &pool = *global_variables::global_memory_pool;
                nussbaumer_cross_multiply_poly_poly(poly1.pointer(), poly2.pointer(), coeff_count_power, 1, 1, 2, result11.pointer(), result22.pointer(), result12.pointer(),pool);

                BigPoly result11_correct(5, 128);
                nussbaumer_multiply_poly_poly(poly1.pointer(), poly1.pointer(), coeff_count_power, 1, 1, 2, result11_correct.pointer(), pool);
                Assert::AreEqual(result11_correct.pointer()[0], result11.pointer()[0]);
                Assert::AreEqual(result11.pointer()[1], result11_correct.pointer()[1]);
                Assert::AreEqual(result11.pointer()[2], result11_correct.pointer()[2]);
                Assert::AreEqual(result11.pointer()[3], result11_correct.pointer()[3]);

                BigPoly result22_correct(5, 128);
                nussbaumer_multiply_poly_poly(poly2.pointer(), poly2.pointer(), coeff_count_power, 1, 1, 2, result22_correct.pointer(), pool);
                for (int i = 0; i < 4; i++)
                {
                    Assert::AreEqual(result22_correct.pointer()[i], result22.pointer()[i]);
                }

                BigPoly result12_correct(5, 128);
                nussbaumer_multiply_poly_poly(poly1.pointer(), poly2.pointer(), coeff_count_power, 1, 1, 2, result12_correct.pointer(), pool);
                for (int i = 0; i < 4; i++)
                {
                    Assert::AreEqual(result12_correct.pointer()[i], result12.pointer()[i]);
                }

            }

            TEST_METHOD(NussbaumerCrossMultiplyPolyPoly)
            {
                const int coeff_power = 8;
                const int coeff_count = (1 << coeff_power) + 1;
                BigPoly poly1(coeff_count, 128);
                BigPoly poly2(coeff_count, 128);
                BigPoly polymod(coeff_count, 128);
                BigPoly correct11(coeff_count, 128);
                BigPoly correct12(coeff_count, 128);
                BigPoly correct22(coeff_count, 128);
                BigPoly result11(coeff_count, 128);
                BigPoly result12(coeff_count, 128);
                BigPoly result22(coeff_count, 128);

                default_random_engine random;
                random.seed(0);
                for (int i = 0; i < coeff_count - 1; ++i)
                {
                    poly1[i] = random() % 100;
                    poly2[i] = random() % 100;
                }
                polymod[0] = 1;
                polymod[coeff_count - 1] = 1;
                MemoryPool &pool = *global_variables::global_memory_pool;

                nussbaumer_cross_multiply_poly_poly(poly1.pointer(), poly2.pointer(), coeff_power, 1, 2, 2, result11.pointer(), result22.pointer(), result12.pointer(), pool);


                nussbaumer_multiply_poly_poly(poly1.pointer(), poly1.pointer(), coeff_power, 1, 2, 2, correct11.pointer(), pool);
                nussbaumer_multiply_poly_poly(poly1.pointer(), poly2.pointer(), coeff_power, 1, 2, 2, correct12.pointer(), pool);
                nussbaumer_multiply_poly_poly(poly2.pointer(), poly2.pointer(), coeff_power, 1, 2, 2, correct22.pointer(), pool);

                for (int i = 0; i < coeff_count - 1; ++i)
                {
                    Assert::IsTrue(correct11[i] == result11[i]);
                    Assert::IsTrue(correct12[i] == result12[i]);
                    Assert::IsTrue(correct22[i] == result22[i]);
                }
            }
        };
    }
}