摘要
为了提高目前全同态加密的效率,针对于志敏等人提出的基于整数GCD的全同态加密方案中,公钥尺寸过大的缺陷,利用Coron等人关于整数上的压缩公钥和换模运算的思想,提出一种较快速的全同态加密方案。改进后的方案,公钥尺寸减小,攻击算法复杂度降低,无须mod2运算以及bootstrapping。安全性可以规约到近似最大公因子问题。
In view of research on FHE by Yu Zhimin et al. , to improve the efficiency, and reduce the size of public key, this paper proposed a faster scheme based on study on the public key compression and modulus switching over the integers by Coron et al. For the public key of new scheme is smaller, the complexity of attack algorithm is reduced, without mod2 arithmetic and bootstrapping. And the security depends on the approximate GCD problem.
出处
《计算机应用研究》
CSCD
北大核心
2015年第11期3448-3451,3455,共5页
Application Research of Computers
关键词
压缩公钥
全同态加密
近似最大公因子问题
public key compression
fully homomorphic encryption （FHE）
approximate GCD
