.png){kind=icon}
返回
Low-Complexity Ciphertext Multiplication for CKKS Homomorphic Encryption
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2023.3318859.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Homomorphic encryption (HE) allows direct computations on ciphertexts and is a key enabler of privacy-preserving cloud computing. The CKKS algorithm is among the most popular HE schemes and a ciphertext consists of a pair of polynomials with very large coefficients. The complexity of large coefficients can be greatly reduced by using the residue number system (RNS). However, the relinearization and rescaling that follow the coefficient multiplication in every ciphertext multiplication have even higher complexities. This brief proposes reformulations of the relinearization and rescaling using RNS representation. A novel integer division method is developed to enable the combination and simplification of all involved computations. Constants are pre-multiplied to reduce the number of required multipliers. As a result, the complexity of the ciphertext multiplication is greatly reduced. For an example case, the proposed design leads to 18% less silicon area and 42% shorter latency compared to prior work.
Keyword:
Complexity theory
Computer architecture
Silicon
Homomorphic encryption
Transforms
Sequential analysis
Runtime
Hardware architecture
homomorphic encryption
multiplication
relinearization
rescaling
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
.png){kind=icon}
Applications of theoretical calculations in alkali metal-ion battery investigation理论计算在碱金属离子电池研究中的应用
PREAI
分享收藏PaReNTT: Low-Latency Parallel Residue Number System and NTT-Based Long Polynomial Modular Multiplication for Homomorphic EncryptionPaReNTT: 用于同态加密的低延迟并行残差数系统和基于NTT的长多项式模乘
PREAI
分享收藏
查看更多内容