期刊文献+

基于MLWE的低膨胀率加密算法 被引量:3

Low Expansion Rate Encryption Algorithm Based on MLWE
下载PDF
导出
摘要 基于模容错学习问题(MLWE)的格密码算法Kyber具有抗量子攻击、加密效率高的优势,但密文膨胀率较大约为1∶25,仅适用于密钥封装等少数场景。为了构建一种能够应用于一般的公钥加密场景的加密算法,提出了一种改进的基于MLWE的低膨胀率公钥加密算法。文中在Kyber加密算法中引入新的加密参数dp,扩大了明文空间,通过严格的理论推导与实验分析了dp对加密算法正确性的影响,并优化了加密参数,降低了密文膨胀率。改进后的算法会扩大有限域(即计算空间),导致直接使用原算法中的有限域上的多项式乘法运算,需调用额外的大整数计算库,从而降低了加密效率。通过使用基于浮点运算的复数域上的快速傅里叶变换进行多项式乘法,避免了在增大后的有限域上进行大整数多项式乘法。最后,对浮点运算产生的误差进行了分析,同时使用C++实现了改进算法,并将其与Kyber的实验数据进行对比。实验表明,所提算法在保证了计算效率的同时使密文膨胀率由1∶25左右降低到了1∶4.25左右。 The lattice encryption algorithm Kyber based on MLWE has the advantage of anti-quantum attack and high encryption efficiency.However,the expansion rate of ciphertext is as high as about 1 ∶ 25 ,which is just suitable for a few scenes such as key encapsulation.In order to give an encryption algorithm that can be applied to common public key encryption scenes,an improved MLWE based low expansion rate public key encryption algorithm was proposed in this paper.A new encryption parameter dp was introduced into this algorithm to expand the plaintext space.By strict theoretical deduction and experiment,the influence of dp on the correctness of the encryption algorithm was analyzed,and the encryption parameter was optimized to reduce the expansion rate of ciphertext.The improved algorithm will work in a large finite field,which leads to low encryption efficiency.To avoid this situation,this paper proposed a polynomial mul- tiplication method based on FFT in complex field by using floating point arithmetic. And the improved algorithm was implemented in C++.Experimental results show that the new method is more efficient and the floating error is controllable.Compared with Kyber,the ciphertext expansion rate is reduced from 1 ∶ 25 to about 1 ∶ 4.25 .
作者 柯程松 吴文渊 冯勇 KE Cheng-song;WU Wen-yuan;FENG Yong(College of Computer Science & Technology,Chongqing University of Posts & Telecommunications,Chongqing 400065,China;Chongqing Key Laboratory of Automated Reasoning & Cognition,Chongqing Institute of Green &Intelligent Technology,Chinese Academy of Sciences,Chongqing 400714,China)
出处 《计算机科学》 CSCD 北大核心 2019年第4期144-150,共7页 Computer Science
基金 重庆市科委项目(cstc2017zdcy-yszxX0011) 国家自然科学基金资助项目(11471307 11671377) 中科院前沿重点项目(QYZDB-SSW-SYS026)资助
关键词 模容错学习问题 公钥加密 密文膨胀率 复数域 浮点运算 Module learning with errors(MLWE) Public key encryption Ciphertext expansion rate Complex field Floating point arithmetic
  • 相关文献

参考文献3

二级参考文献10

  • 1Oded Regev.On lattices, learning with errors, random linear codes, and cryptography[J].Journal of the ACM (JACM).2009(6)
  • 2Johannes Bl?mer,Stefanie Naewe.Sampling methods for shortest vectors, closest vectors and successive minima[J].Theoretical Computer Science.2009(18)
  • 3Phong Q. Nguyen,Thomas Vidick.Sieve algorithms for the shortest vector problem are practical[J].Journal of Mathematical Cryptology.2008(2)
  • 4Jean-Sebastien Coron,Alexander May.Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring[J].Journal of Cryptology.2007(1)
  • 5Dorit Aharonov,Oded Regev.Lattice problems in NP ∩ coNP[J].Journal of the ACM (JACM).2005(5)
  • 6Subhash Khot.Hardness of approximating the shortest vector problem in lattices[J].Journal of the ACM (JACM).2005(5)
  • 7Phong Q. Nguyen,Igor E. Shparlinski.The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces[J].Designs Codes and Cryptography.2003(2)
  • 8I. Dinur,G. Kindler,R. Raz,S. Safra.Approximating CVP to Within Almost-Polynomial Factors is NP-Hard[J].COMBINATORICA.2003(2)
  • 9Irit Dinur.Approximating SVP ∞ to within almost-polynomial factors is NP-hard[J].Theoretical Computer Science.2002(1)
  • 10Jin-Yi Cai.A new transference theorem in the geometry of numbers and new bounds for Ajtai’s connection factor[J].Discrete Applied Mathematics.2002(1)

共引文献63

同被引文献3

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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