/* mB = mC => C <- alpha*A + beta*C
otherwise C <- alpha*A + beta*B */
void geam(double alpha, Mat mA, double beta, Mat mB, Mat mC) {
const int n = MatN(mA);
const int n2 = MatN2(mA);
const void* const a = MatElems(mA);
const void* const b = MatElems(mB);
void* const c = MatElems(mC);
const bool dev = MatDev(mA);
switch (MatElemSize(mA)) {
case 4:
if (dev) {
float alpha32 = alpha, beta32 = beta;
cublasSgeam(g_cublasHandle, CUBLAS_OP_N, CUBLAS_OP_N, n, n,
&alpha32, a, n, &beta32, b, n, c, n);
} else {
if (b == c) {
cblas_sscal(n2, beta, c, 1);
} else {
memset(c, 0, MatSize(mC));
cblas_saxpy(n2, beta, b, 1, c, 1);
}
cblas_saxpy(n2, alpha, a, 1, c, 1);
}
break;
case 8:
if (dev) {
cublasDgeam(g_cublasHandle, CUBLAS_OP_N, CUBLAS_OP_N, n, n,
&alpha, a, n, &beta, b, n, c, n);
} else {
if (b == c) {
cblas_dscal(n2, beta, c, 1);
} else {
memset(c, 0, MatSize(mC));
cblas_daxpy(n2, beta, b, 1, c, 1);
}
cblas_daxpy(n2, alpha, a, 1, c, 1);
}
break;
}
}
int main(){
cout << "This experiment check for different values of parameters, how much time it takes to encrypt and decrypt a \"full\" matrix (nslots*nslots), and multply 2 encrypted matrices\nAlso check for what size of matrices, the multiplication in the server on the encrypted data is faster than for the user than do all the work on his machine. Using this formula: N > n(P)*(2*Enc(P)+Dec(P)) when:\nP is the parameters\nn(P) is the nslots value for these values\nEnc(P) and Dec(P) is the time it takes to encrypt and decrypt the matrics in size nslots*nslots\nNOTE: this formula don't take into account the time it takes to send and recieve the data to and from the server, and the time it took to the server to do the actual multiplication\n" << endl;
/*
long m=0, r=1; // Native plaintext space
int p = 65539; // Computations will be 'modulo p'
long L=16; // Levels
long c=3; // Columns in key switching matrix
long w=64; // Hamming weight of secret key
long d=0;
long s = 0; //minimum number of slots [ default=0 ]
long security = 128;*/
long m, r, p, L, c, w, s, d, security, enc1, enc2, dec, encMul, ptMul, recommended;
char tempChar;
bool toEncMult = false, toPrint = false, debugMul = false, toSave = false;
//Scan parameters
cout << "Enter HElib's keys paramter. Enter zero for the recommended values" << endl;
while(true){
cout << "Enter the field of the computations (a prime number): ";
cin >> p;
if(isPrime(p))
break;
cout << "Error! p must be a prime number! " << endl;
}
while(true){
recommended = 1;
cout << "Enter r (recommended " << recommended <<"): ";
cin >> r;
if(r == 0)
r = recommended;
if(r > 0)
break;
cout << "Error! r must be a positive number!" << endl;
}
while(true){
recommended = 16;
cout << "Enter L (recommended " << recommended <<"): ";
cin >> L;
if(L == 0)
L = recommended;
if(L > 1)
break;
cout << "Error! L must be a positive number!" << endl;
}
while(true){
recommended = 3;
cout << "Enter c (recommended " << recommended <<"): ";
cin >> c;
if(c == 0)
c = recommended;
if(c > 1)
break;
cout << "Error! c must be a positive number!" << endl;
}
while(true){
recommended = 64;
cout << "Enter w (recommended " << recommended <<"): ";
cin >> w;
if(w == 0)
w = recommended;
if(w > 1)
break;
cout << "Error! w must be a positive number!" << endl;
}
while(true){
recommended = 0;
cout << "Enter d (recommended " << recommended <<"): ";
cin >> d;
if(d >= 0)
break;
cout << "Error! d must be a positive or zero!" << endl;
}
while(true){
recommended = 0;
cout << "Enter s (recommended " << recommended <<"): ";
cin >> s;
if(s >= 0)
break;
cout << "Error! s must be a positive or zero!" << endl;
}
while(true){
recommended = 128;
cout << "Enter security (recommended " << recommended << "): ";
cin >> security;
if(security == 0)
security = recommended;
if(security >= 1)
break;
cout << "Error! security must be a positive number " << endl;
}
ZZX G;
m = FindM(security,L,c,p, d, s, 0);
FHEcontext context(m, p, r);
// initialize context
buildModChain(context, L, c);
// modify the context, adding primes to the modulus chain
FHESecKey secretKey(context);
// construct a secret key structure
const FHEPubKey& publicKey = secretKey;
// an "upcast": FHESecKey is a subclass of FHEPubKey
//if(0 == d)
G = context.alMod.getFactorsOverZZ()[0];
secretKey.GenSecKey(w);
// actually generate a secret key with Hamming weight w
addSome1DMatrices(secretKey);
EncryptedArray ea(context, G);
// constuct an Encrypted array object ea that is
// associated with the given context and the polynomial G
long nslots = ea.size(), field = power(p,r);
cout << "nslots: " << nslots << endl ;
cout << "Computations will be modulo " << field << endl;
cout << "m: " << m << endl;
unsigned int sz1, sz2, sz3;
while(true){
cout << "Enter number of rows in the first matrix: ";
cin >> sz1;
if(sz1 > 1 && sz1 <= nslots)
break;
cout << "Error! the value must be between 1 to " << nslots << "!" << endl;
}
while(true){
cout << "Enter number of rows in the first matrix: ";
cin >> sz2;
if(sz1 > 2 && sz2 <= nslots)
break;
cout << "Error! the value must be between 1 to " << nslots << "!" << endl;
}
while(true){
cout << "Enter number of rows in the first matrix: ";
cin >> sz3;
if(sz1 > 3 && sz3 <= nslots)
break;
cout << "Error! the value must be between 1 to " << nslots << "!" << endl;
}
PTMatrix PTmat1(MatSize(sz1, sz2),field), PTmat2(MatSize(sz2, sz3), field); //random matrix in size origSize1
while(true){
cout << "To multiply the encrypted matrices? Not affecting the formula, just for statistic" << endl;
cout << "Y for yes, N for no: ";
cin >> tempChar;
if(tempChar == 'Y' || tempChar == 'y'){
toEncMult = true;
break;
}
if(tempChar == 'N' || tempChar == 'n'){
toEncMult = false;
break;
}
cout << "Error! invalid input!" << endl;
}
while(toEncMult){
cout << "Debug the multiplication steps?\nY for yesm N for no :";
cin >> tempChar;
if(tempChar == 'Y' || tempChar == 'y'){
debugMul = true;
break;
}
if(tempChar == 'N' || tempChar == 'n'){
debugMul = false;
break;
}
cout << "Error! invalid input!" << endl;
}
while(true){
cout << "Print the matrices?" << endl;
cout << "Y for yes, N for no: ";
cin >> tempChar;
if(tempChar == 'Y' || tempChar == 'y'){
toPrint = true;
break;
}
if(tempChar == 'N' || tempChar == 'n'){
toPrint = false;
break;
}
cout << "Error! invalid input!" << endl;
}
while(true){
cout << "Save the matrices?" << endl;
cout << "Y for yes, N for no: ";
cin >> tempChar;
if(tempChar == 'Y' || tempChar == 'y'){
toSave = true;
break;
}
if(tempChar == 'N' || tempChar == 'n'){
toSave = false;
break;
}
cout << "Error! invalid input!" << endl;
}
if(toPrint){
PTmat1.print();
PTmat2.print();
}
if(toSave){
ofstream out_mat1("mat1.txt"), out_mat2("mat2.txt");
PTmat1.save(out_mat1);
PTmat2.save(out_mat2);
out_mat1.close(); out_mat2.close();
}
//encryptions
cout << "Encrypting the first matrices..." << endl;
resetTimers();
EncryptedMatrix encMat1 = PTmat1.encrypt(ea, publicKey);
enc1 = stopTimers("to encrypt the first matrix");
cout << "Encrypting the second matrices..." << endl;
resetTimers();
EncryptedMatrix encMat2 = PTmat2.encrypt(ea, publicKey);
enc2 = stopTimers("to encrypt the second matrix");
//multiplication
if(toEncMult){
cout << "Multiplying the matrices..." << endl;
resetTimers();
if(debugMul)
encMat1 = encMat1.debugMul(encMat2); //same as encMat1 *= encMat2 but print progress update
else
encMat1 *= encMat2;
encMul = stopTimers("to multiply the matrices");
}
cout << "Decrypting the result..." << endl;
resetTimers();
PTMatrix res = encMat1.decrypt(ea, secretKey);
dec = stopTimers("to decrypt the result");
if(toPrint)
res.print("Solution: ");
resetTimers();
PTMatrix PTres = PTmat1.mulWithMod(PTmat2,field); //like (PTmat1*PTmat2)%p but do modulu after each multiplication to avoid overflow
ptMul = stopTimers("to multiply the regular matrices");
if(toSave){
ofstream out_res("mat_res.txt"), out_ptRes("mat_pt_res.txt");
res.save(out_res);
PTres.save(out_ptRes);
out_res.close(); out_ptRes.close();
}
//PTres.print("pt result: ");
cout << "\n\n----------------------------------------Summary------------------------------ " << endl;
cout << "p: " << p << ", r: " << r << ", L: " << L << ", c: " << c << ", w: " << w << ", d: " << d << ", s: " << s << ", security: " << security << endl;
cout << "nslots: " << nslots << "\nm: " << m << endl;
cout << "It took " << enc1 << " clock ticks to encrypt the first matrix" << endl;
cout << "It took " << enc2 << " clock ticks to encrypt the second matrix" << endl;
cout << "It took " << dec << " clock ticks to decrypt the result" << endl;
cout << "It took " << ptMul << " clock ticks to multiply the regular matrices" << endl;
if(toEncMult){
cout << "It took " << encMul << " clock ticks to multiply the encrypted matrices" << endl;
cout << "is correct? " << (res==PTres) << endl;
}
long N = nslots*(enc1+enc2+dec)/ptMul;
cout << "N should be greater than " << N << endl;
return 0;
}
