The library provides a homomorphic encryption scheme by Doroz, Hu and Sunar, along with various applications. The scheme is a variant of Lopez-Alt, Tromer and Vaikuntanathan Homomorphic Encryption.
In the paper, the polynomial is defined in Z_p[x]/<x^n+1>.
But in this program, the polynomial modulus is not x^n+1.
I try to define Modulus_M = 16 (its cyclotomic polynomial is x^8+1), but it can not implement after "make". Because loop will not be false in ComputeFactorDegree function.
Is there any method to set modulus = x^n+1, or can I ignore ComputeFactorDegree function?
In the paper, the polynomial is defined in Z_p[x]/<x^n+1>. But in this program, the polynomial modulus is not x^n+1. I try to define Modulus_M = 16 (its cyclotomic polynomial is x^8+1), but it can not implement after "make". Because loop will not be false in ComputeFactorDegree function. Is there any method to set modulus = x^n+1, or can I ignore ComputeFactorDegree function?