Paper 2026/2562
A New Approach to Reducing Modulus Requirements in Homomorphic Computation: Precision Allocation in CKKS
Abstract
Fully homomorphic encryption (FHE) enables computation over encrypted data subject to the prescribed security and precision requirements (allowable deviations from ideal results). Among all FHE schemes, CKKS is a representative scheme for approximate arithmetic, allowing the same operation on multiple values packed into a single RLWE ciphertext. Reducing ciphertext modulus \(Q\) for given output precision requirements under RLWE security constraints is a central challenge in homomorphic computation. However, despite advances in plaintext and ciphertext representations, algorithmic optimizations, and modulus management, the budget in most existing approaches remains dependent on the highest required precision and cannot reduce the baseline modulus cost to overcome encryption noise. In this work, we make average rather than maximum precision requirements govern the modulus budget and achieve savings in the baseline cost. Under decryption correctness constraints, we make these possible by allocating arbitrary output precision among independent values and quantify the modulus savings arising from differences in their precision requirements. As a bonus, our construction preserves the standard CKKS ciphertext format, which helps maintain compatibility with existing optimizations. And the construction inherits the IND-CPA security of CKKS without additional cryptographic assumptions. In a repeated squaring experiment, we use 67% fewer initial modulus bits and one quarter of the ring dimension of standard CKKS, while meeting the same precision and security requirements.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- CKKSFHEprecisionerror analysis
- Contact author(s)
-
liangzhaoyang @ mail nankai edu cn
liurunkun @ mail nankai edu cn
jingweifang @ mail nankai edu cn
dingdan @ nankai edu cn - History
- 2026-10-28: last of 6 revisions
- 2026-10-20: received
- See all versions
- Short URL
- https://ia.cr/2026/2562
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2562,
author = {Zhaoyang Liang and Runkun Liu and Jingwei Fang and Dan Ding},
title = {A New Approach to Reducing Modulus Requirements in Homomorphic Computation: Precision Allocation in {CKKS}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2562},
year = {2026},
url = {https://eprint.iacr.org/2026/2562}
}