Closed jrylost closed 2 years ago
I noticed that in issue #34 kimlaine said there's no need for BFV bootstrapping in the vast majority of applications. But I'm still interested in the details of BFV bootstrapping. I find two paper discussing BFV bootstrapping, Homomorphic Lower Digits Removal and Improved FHE Bootstrapping and Bootstrapping Algorithms for BGV and FV. The bootstrapping path they adopted is .
I wonder if it is possible to use modulus switching after step1(Modulus Switching and Dot Product) to make expand or shrink to , and that would fit the in BFV scheme.
Hope you can give me a hint or any advice. Thanks in advance.
p^{e-r} is removed by digit extraction. How would you remove delta in the later steps?
I noticed that in issue #34 kimlaine said there's no need for BFV bootstrapping in the vast majority of applications. But I'm still interested in the details of BFV bootstrapping. I find two paper discussing BFV bootstrapping, Homomorphic Lower Digits Removal and Improved FHE Bootstrapping and Bootstrapping Algorithms for BGV and FV. The bootstrapping path they adopted is .
I wonder if it is possible to use modulus switching after step1(Modulus Switching and Dot Product) to make expand or shrink to , and that would fit the in BFV scheme.
Hope you can give me a hint or any advice. Thanks in advance.