期刊文献+

NTRU体制的全同态加密研究 被引量:1

Research on fully homomorphic encryption of NTRU
下载PDF
导出
摘要 NTRU体制结构简单、解密速度快、多密钥处理自然,在后量子密码算法中备受关注,因此对NTRU体制的相关研究内容进行综述。首先介绍了NTRU的研究发展和体制概论分析了解密失败的原因,并总结了基于NTRU体制的关键技术;其次给出了五种基于NTRU体制的全同态加密方案的分析比较,并总结了几种通用的优化方法;最后指出基于NTRU的加密方案待解决的关键问题,指明未来的研究方向,为研究NTRU体制的人员提供参考。 The NTRU system,with its simple structure,fast decryption speed and natural multi-key processing,has attracted much attention in post-quantum cryptographic algorithms,so this paper reviewed the research related to the NTRU system.Firstly,it introduced the research and development of NTRU,system introduction,analyzed the reasons for decryption failure,and summarized the key technologies based on NTRU system.Secondly,it gave the analysis and comparison of five fully homomorphic encryption schemes based on NTRU system,and summarized several general optimization methods.Finally,it pointed out the key problems to be solved by NTRU-based encryption schemes,indicates the future research direction,and provides reference for those who study NTRU system.
作者 秦小月 黄汝维 Qin Xiaoyue;Huang Ruwei(School of Computer,Electronics&Information,Guangxi University,Nanning 530004,China)
出处 《计算机应用研究》 CSCD 北大核心 2021年第6期1619-1625,共7页 Application Research of Computers
基金 国家自然基金资助项目(62062009) 广西科技重大专项资助项目(AA17204058-17) 广西科技重大专项资助项目(桂科AA18118047-7)。
关键词 NTRU体制 全同态加密 解密失败 NTRU system homomorphic encryption decryption failure
  • 相关文献

参考文献18

二级参考文献48

  • 1杨铭,曹云飞.NTRU的应用前景分析与展望[J].信息安全与通信保密,2007,29(8):36-38. 被引量:2
  • 2RIVEST R, SHAMIR A, ADLEMAN L. A method for obtaining di- gital signatures and public-key cryptosystems [ J ]. Communications of the ACM,1978,21 (2) :120-126.
  • 3RIVEST R, SHAMIR A, DERTOUZOS M, On data banks and pri-va- cy homomorphisms [ J ]. Foundations of Secure Computation, 1978,7 ( 1 ) : 169-177.
  • 4BONEH D, GENTRY. A fully homomorphic encryption scheme [ D ]. Stanford : Stanford University,2009.
  • 5GENTRY. Fully homomorphie eneryption using ideal lattices [ C ]// Proc of the 41st Annual ACM Symposium on Theory of Computing. New York : ACM Press,2009 : 169-178.
  • 6Van DIJK, GENTR Y, HALEV I, et al. Fully homomorphic encryp- tion over the integers[ C ]//Proc of the 29th Annual International Conference on Theory and Applications of Cryptograhic Techniques. Berlin: Springer-erlag,2010:24-43.
  • 7GENTRY C. Computing arbitrary function of encryped data[ J ]. Com- munications of the ACM,2010,53(3) :97-105.
  • 8SMART N P, VERCAUTEREN F. Fully homomorphie encryption with relatively small key and ciphertext sizes[ C]//Proc of the 13th Inter- national Conference on Practice and Theory in Public Key Cryptogra- phy. Berlin : Springer-Verlag, 2010:420-443.
  • 9STEHLE D, STEINFELD R. Faster fully homomorphic eneryption [ C]//Proc of International Conference on the Theory and Application of Cryptology and Information Security. Berlin: Springer, 2010 : 377 - 394.
  • 10JEAN-SEBASTIEN C, MANDAL A, NACACHE D, et al. Fully-ho- momorphic encryption over the integers with shorter public-keys [C]//Proc of the 31st Annual Conference on Advances in CRYP- TOLOGY. Berlin : Springer-Verlag,2011:487- 504.

共引文献281

同被引文献7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部