You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
According to your article "A Full RNS Variant of Approximate Homomorphic Encryption", the Vector qVec should have L + 1 elements. However, it seems like that the size of qVec may be L or L + 1 as shown in the code. I wonder if there is something wrong?
uint64_t prime = (1ULL << Q0_BIT_SIZE) + bnd * M + 1;
if(primeTest(prime)) {
qVec[0] = prime;
break;
}
bnd++;
}
bnd = 1;
while(cnt < L) {
uint64_t prime1 = (1ULL << logp) + bnd * M + 1;
if(primeTest(prime1)) {
qVec[cnt] = prime1;
cnt++;
}
uint64_t prime2 = (1ULL << logp) - bnd * M + 1;
if(primeTest(prime2)) {
qVec[cnt] = prime2;
cnt++;
}
bnd++;
}
The text was updated successfully, but these errors were encountered:
zzwplus
changed the title
According to your article "A Full RNS Variant of Approximate Homomorphic Encryption", the Vector qVec should have L + 1 elements. However, it seems like that the size of qVec is only L as shown in the code. I wonder if there is something wrong?
About the size of qVec[]
Jan 12, 2022
According to your article "A Full RNS Variant of Approximate Homomorphic Encryption", the Vector qVec should have L + 1 elements. However, it seems like that the size of qVec may be L or L + 1 as shown in the code. I wonder if there is something wrong?
FullRNS-HEAAN/src/Context.cpp
Lines 39 to 66 in 515f641
The text was updated successfully, but these errors were encountered: