Efficient Mod Approximation and Its Applications to CKKS Ciphertexts
Yufei Zhou

TL;DR
This paper introduces a novel polynomial interpolation method for accurately approximating the mod function over all integer inputs, enhancing CKKS homomorphic encryption with efficient data packing and precise operations.
Contribution
It proposes a new polynomial approximation technique for the mod function and designs two data packing schemes, BitStack and CRTStack, for improved CKKS efficiency.
Findings
Achieves approximation accuracy up to 10^{-8}
Enables efficient ciphertext rounding and secret share conversion
Improves plaintext space utilization in CKKS
Abstract
The mod function plays a critical role in numerous data encoding and cryptographic primitives. However, the widely used CKKS homomorphic encryption (HE) scheme supports only arithmetic operations, making it difficult to perform mod computations on encrypted data. Approximating the mod function with polynomials has therefore become an important yet challenging problem. Existing homomorphic mod constructions provide accurate results only within limited subranges of the input domain, leaving the problem of achieving accurate approximation across the entire input domain unresolved.In this work, we propose a novel method based on polynomial interpolation and Chebyshev series to accurately approximate the mod function over all integer points in the bounded input interval. Building upon this, we design two efficient data packing schemes, BitStack and CRTStack, tailored for small-integer inputs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
