-
Notifications
You must be signed in to change notification settings - Fork 7
/
polynomial.h
51 lines (45 loc) · 1.26 KB
/
polynomial.h
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
//
// Created by anonymized on 12/7/21.
//
#pragma once
#ifndef ZKUNSAT_NEW_POLYNOMIAL_H
#define ZKUNSAT_NEW_POLYNOMIAL_H
#include "utils.h"
#include "commons.h"
class polynomial {
public:
vector <block> coefficient;
vector <block> mcoefficient;
polynomial(){
}
polynomial(vector<block> coefficient);
polynomial(vector<uint64_t> roots);
void Evaluate(block &res, block &mres, block &input) const ;
void Equal(const polynomial& lfh) const;
void InnerProductEqual(vector<polynomial>& p1, vector<polynomial>& p2);
void ProductEqual(polynomial& p1, polynomial& p2);
void ConverseCheck(polynomial& lhs);
void print() {
for (block b: coefficient) {
cout << "[" << (b) << "]";
}
cout << endl;
}
};
inline void GF2EX2polynomial(GF2EX& a, polynomial& b){
long d = deg(a);
assert(!(d > DEGREE));
std::vector<block> coeff;
for (long i = 0; i < DEGREE; i ++){
GF2E c = NTL::coeff(a, i);
GF2X raw = c._GF2E__rep;
block tmp = zero_block;
for(int i = 0; i < 128; i++){
if (IsOne(NTL::coeff(raw, i)))
tmp = set_bit(tmp, i);
}
coeff.push_back(tmp);
}
b = polynomial(coeff);
}
#endif //ZKUNSAT_NEW_POLYNOMIAL_H