A novel polynomial approximation of the mod function over bounded integer domains enables accurate homomorphic mod, rounding, and secret-share conversion in CKKS with up to 10^{-8} accuracy.
Faster homomorphic comparison operations for BGV and BFV.Proceedings on Privacy Enhancing Technologies, 2021(3):246– 264
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Mod Approximation and Its Applications to CKKS Ciphertexts
A novel polynomial approximation of the mod function over bounded integer domains enables accurate homomorphic mod, rounding, and secret-share conversion in CKKS with up to 10^{-8} accuracy.