Hi everyone,
I recently came across a paper titled “Fully Homomorphic Encryption for Cyclotomic Prime Moduli”, available at 2024/1587.
The paper reports achieving (G)BFV bootstrapping in 4.81 seconds, but I’m getting around 1.5 seconds with the same parameters using their provided implementation locally, which I found quite interesting.
Are there any plans to implement this in OpenFHE?
Thanks in advance!
Hi @watch,
Yes, we saw the paper and had some discussions about BGV/BFV bootstrapping with the authors a while ago, before this paper was published (based on their prior works). This is certainly a very interesting result. We have not had a chance yet to read this paper in more detail and estimate how much effort it would take to implement the power-of-two-cyclotomics case in OpenFHE. But the result certainly looks promising.
Thank you for the answer!