一种适用于n bit的整数上全同态加密方案  

Fully homomorphic encryption scheme applied to n bit

作　　者：孙霓刚[1] 朱浩然 汪伟昕 Sun Nigang;Zhu Haoran;Wang Weixin(School of Information Science&Engineering,Changzhou University,Changzhou Jiangsu 213164,China)

机构地区：[1]常州大学信息科学与工程学院,江苏常州213164

出　　处：《计算机应用研究》2018年第4期1179-1181,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(61103172)

摘　　要：现阶段整数上全同态加密方案效率低且公钥尺寸大,难以在实践中应用。通过对整数上全同态加密方案进行研究,提出了一次可以加密n比特明文的加密方案,n为正整数。方案的公钥尺寸为珟O(λ7),其中,λ为安全参数。该方案在保持较短公钥尺寸的同时,比现有方案加密效率更高,因此能够更好地满足云计算对于密文数据处理的需求。方案的安全性基于近似最大公约数问题和稀疏子集和问题。The efficiency of the fully homomorphic encryption at this stage is low and the public key is long.It is difficult to use in practice.This paper researched the fully homomorphic encryption over the integers.The scheme with the property of encrypting n bit plaintext once was obtained and n∈N+.The size of the public key was(λ7)in this scheme andλwas security parameters.The result indicates that this scheme keeps the low public key size and has higher efficiency.So it is more applicable for cloud computing to process data.The security of the scheme is based on the approximate GCD(greatest common divisor)problem and the sparse-subset sum problem.

关 键 词：全同态加密 近似最大公约数问题 稀疏子集和问题 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]