/
Mersenne.hpp
423 lines (301 loc) · 8.96 KB
/
Mersenne.hpp
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
//
// Created by moriya on 01/10/17.
//
#ifndef LIBSCAPI_MERSSENE_H
#define LIBSCAPI_MERSSENE_H
#include "NTL/ZZ_p.h"
#include "NTL/ZZ.h"
#include <x86intrin.h>
#include "gmp.h"
#include <../../include/primitives/Prg.hpp>
using namespace std;
using namespace NTL;
class ZpMersenneIntElement {
//private:
public: //TODO return to private after tesing
static const unsigned int p = 2147483647;
unsigned int elem;
public:
ZpMersenneIntElement(){elem = 0;};
ZpMersenneIntElement(int elem)
{
this->elem = elem;
if(this->elem<p){
return;
}
this->elem -=p;
if(this->elem<p){
return;
}
this->elem -=p;
}
ZpMersenneIntElement& operator=(const ZpMersenneIntElement& other){elem = other.elem; return *this;};
bool operator!=(const ZpMersenneIntElement& other){ return !(other.elem == elem); };
ZpMersenneIntElement operator+(const ZpMersenneIntElement& f2)
{
ZpMersenneIntElement answer;
answer.elem = (elem + f2.elem);
if(answer.elem>=p)
answer.elem-=p;
return answer;
}
ZpMersenneIntElement operator-(const ZpMersenneIntElement& f2)
{
ZpMersenneIntElement answer;
int temp = (int)elem - (int)f2.elem;
if(temp<0){
answer.elem = temp + p;
}
else{
answer.elem = temp;
}
return answer;
}
ZpMersenneIntElement operator/(const ZpMersenneIntElement& f2)
{
//code taken from NTL for the function XGCD
int a = f2.elem;
int b = p;
long s;
int u, v, q, r;
long u0, v0, u1, v1, u2, v2;
int aneg = 0, bneg = 0;
if (a < 0) {
if (a < -NTL_MAX_LONG) Error("XGCD: integer overflow");
a = -a;
aneg = 1;
}
if (b < 0) {
if (b < -NTL_MAX_LONG) Error("XGCD: integer overflow");
b = -b;
bneg = 1;
}
u1=1; v1=0;
u2=0; v2=1;
u = a; v = b;
while (v != 0) {
q = u / v;
r = u % v;
u = v;
v = r;
u0 = u2;
v0 = v2;
u2 = u1 - q*u2;
v2 = v1- q*v2;
u1 = u0;
v1 = v0;
}
if (aneg)
u1 = -u1;
s = u1;
if (s < 0)
s = s + p;
ZpMersenneIntElement inverse(s);
return inverse* (*this);
}
ZpMersenneIntElement operator*(const ZpMersenneIntElement& f2)
{
ZpMersenneIntElement answer;
long multLong = (long)elem * (long) f2.elem;
//get the bottom 31 bit
unsigned int bottom = multLong & p;
//get the top 31 bits
unsigned int top = (multLong>>31);
answer.elem = bottom + top;
//maximim the value of 2p-2
if(answer.elem>=p)
answer.elem-=p;
//return ZpMersenneIntElement((bottom + top) %p);
return answer;
}
ZpMersenneIntElement& operator+=(const ZpMersenneIntElement& f2){ elem = (f2.elem + elem) %p; return *this;};
ZpMersenneIntElement& operator*=(const ZpMersenneIntElement& f2)
{
long multLong = (long)elem * (long) f2.elem;
//get the bottom 31 bit
unsigned int bottom = multLong & p;
//get the top 31 bits
unsigned int top = (multLong>>31) ;
elem = bottom + top;
//maximim the value of 2p-2
if(elem>=p)
elem-=p;
return *this;
}
};
inline ::ostream& operator<<(::ostream& s, const ZpMersenneIntElement& a){ return s << a.elem; };
class ZpMersenneLongElement {
//private:
public: //TODO return to private after tesing
static const unsigned long p = 2305843009213693951;
unsigned long elem;
public:
ZpMersenneLongElement(){elem = 0;};
ZpMersenneLongElement(unsigned long elem)
{
this->elem = elem;
if(this->elem>=p){
this->elem = (this->elem & p) + (this->elem>>61);
if(this->elem >= p)
this->elem-= p;
}
}
inline ZpMersenneLongElement& operator=(const ZpMersenneLongElement& other)
{elem = other.elem; return *this;};
inline bool operator!=(const ZpMersenneLongElement& other)
{ return !(other.elem == elem); };
ZpMersenneLongElement operator+(const ZpMersenneLongElement& f2)
{
ZpMersenneLongElement answer;
answer.elem = (elem + f2.elem);
if(answer.elem>=p)
answer.elem-=p;
return answer;
}
ZpMersenneLongElement operator-(const ZpMersenneLongElement& f2)
{
ZpMersenneLongElement answer;
long temp = (long)elem - (long)f2.elem;
if(temp<0){
answer.elem = temp + p;
}
else{
answer.elem = temp;
}
return answer;
}
ZpMersenneLongElement operator/(const ZpMersenneLongElement& f2)
{
ZpMersenneLongElement answer;
mpz_t d;
mpz_t result;
mpz_t mpz_elem;
mpz_t mpz_me;
mpz_init_set_str (d, "2305843009213693951", 10);
mpz_init(mpz_elem);
mpz_init(mpz_me);
mpz_set_ui(mpz_elem, f2.elem);
mpz_set_ui(mpz_me, elem);
mpz_init(result);
mpz_invert ( result, mpz_elem, d );
mpz_mul (result, result, mpz_me);
mpz_mod (result, result, d);
answer.elem = mpz_get_ui(result);
return answer;
}
ZpMersenneLongElement operator*(const ZpMersenneLongElement& f2)
{
ZpMersenneLongElement answer;
unsigned long long high;
unsigned long low = _mulx_u64(elem, f2.elem, &high);
unsigned long low61 = (low & p);
unsigned long low61to64 = (low>>61);
unsigned long highShift3 = (high<<3);
unsigned long res = low61 + low61to64 + highShift3;
if(res >= p)
res-= p;
answer.elem = res;
return answer;
}
ZpMersenneLongElement& operator+=(const ZpMersenneLongElement& f2)
{
elem = (elem + f2.elem);
if(elem>=p)
elem-=p;
return *this;
}
ZpMersenneLongElement& operator*=(const ZpMersenneLongElement& f2)
{
unsigned long long high;
unsigned long low = _mulx_u64(elem, f2.elem, &high);
unsigned long low61 = (low & p);
unsigned long low61to64 = (low>>61);
unsigned long highShift3 = (high<<3);
unsigned long res = low61 + low61to64 + highShift3;
if(res >= p)
res-= p;
elem = res;
return *this;
}
};
inline ::ostream& operator<<(::ostream& s, const ZpMersenneLongElement& a){ return s << a.elem; };
template <class FieldType>
class TemplateField {
private:
PrgFromOpenSSLAES prg;
long fieldParam;
int elementSizeInBytes;
int elementSizeInBits;
FieldType* m_ZERO;
FieldType* m_ONE;
public:
/**
* the function create a field by:
* generate the irreducible polynomial x^8 + x^4 + x^3 + x + 1 to work with
* init the field with the newly generated polynomial
*/
TemplateField(long fieldParam);
/**
* return the field
*/
string elementToString(const FieldType &element);
FieldType stringToElement(const string &str);
void elementToBytes(unsigned char* output,FieldType &element);
FieldType bytesToElement(unsigned char* elemenetInBytes);
void elementVectorToByteVector(vector<FieldType> &elementVector, vector<byte> &byteVector);
FieldType* GetZero();
FieldType* GetOne();
int getElementSizeInBytes(){ return elementSizeInBytes;}
int getElementSizeInBits(){ return elementSizeInBits;}
/*
* The i-th field element. The ordering is arbitrary, *except* that
* the 0-th field element must be the neutral w.r.t. addition, and the
* 1-st field element must be the neutral w.r.t. multiplication.
*/
FieldType GetElement(long b);
FieldType Random();
~TemplateField();
};
template <class FieldType>
string TemplateField<FieldType>::elementToString(const FieldType& element)
{
ostringstream stream;
stream << element;
string str = stream.str();
return str;
}
template <class FieldType>
FieldType TemplateField<FieldType>::stringToElement(const string &str) {
FieldType element;
istringstream iss(str);
iss >> element;
return element;
}
/**
* A random random field element, uniform distribution
*/
template <class FieldType>
FieldType TemplateField<FieldType>::Random() {
unsigned long b;
if(elementSizeInBytes<=4)
b = prg.getRandom32();
else
b = prg.getRandom64()>>(64-elementSizeInBits);
return GetElement(b);
}
template <class FieldType>
FieldType* TemplateField<FieldType>::GetZero()
{
return m_ZERO;
}
template <class FieldType>
FieldType* TemplateField<FieldType>::GetOne()
{
return m_ONE;
}
template <class FieldType>
TemplateField<FieldType>::~TemplateField() {
delete m_ZERO;
delete m_ONE;
}
#endif //LIBSCAPI_MERSSENE_H