期刊文献+

量子计算模型下PFP算法的安全性分析

Security analysis of PFP algorithm under quantum computing model
下载PDF
导出
摘要 量子技术的快速发展和量子计算效率的不断提高,以及Shor算法和Grover算法的出现,给传统公钥密码和对称密码的安全性造成了较大威胁。因此,基于Feistel结构设计的分组密码PFP算法,首先将轮函数的线性变换P融入Feistel结构的周期函数构造,推导得到PFP算法的4个5轮周期函数,比选择明文攻击模型下典型Feistel结构的周期函数多2轮,并通过实验验证正确性;进一步地,以其中一个5轮周期函数作为区分器,结合量子Grover算法和Simon算法,通过分析PFP密钥编排算法的特点对9、10轮PFP进行了安全性评估,得到正确密钥比特需要的时间复杂度为2^(26)、2^(38.5),需要的量子资源为193、212个量子比特,可以恢复58、77比特密钥,优于已有不可能差分分析结果。 The rapid development of quantum technology and the continuous improvement of quantum computing efficiency,especially the emergence of Shor algorithm and Grover algorithm,greatly threaten the security of traditional public key cipher and symmetric cipher.The block cipher PFP algorithm designed based on Feistel structure was analyzed.First,the linear transformation P of the round function was fused into the periodic functions in the Feistel structure,then four 5-round periodic functions of PFP were obtained,two rounds more than periodic functions in general Feistel structure,which was verified through experiments.Furthermore,by using quantum Grover and Simon algorithms,with a 5-round periodic function as the distinguisher,the security of 9,10-round PFP was evaluated by analyzing the characteristics of PFP key arrangement algorithm.The time complexity required for key recovery is 2^(26),2^(38.5),the quantum resource required is 193,212 qubits,and the 58,77 bits key can be restored,which are superior to the existing impossible differential analysis results.
作者 李艳俊 景小宇 谢惠琴 项勇 LI Yanjun;JING Xiaoyu;XIE Huiqin;XIANG Yong(Information Industry Information Security Evaluation Center,The 15th Research Institute of China Electronics Technology Group Corporation,Beijing 100083,China;Henan Key Laboratory of Network Cryptography Technology,Zhengzhou Henan 450012,China;Beijing Institute of Electronic Science and Technology,Beijing 100070,China)
出处 《计算机应用》 CSCD 北大核心 2024年第4期1166-1171,共6页 journal of Computer Applications
基金 北京市自然科学基金资助项目(4234084) 河南省网络密码技术重点实验室研究课题(LNCT2021⁃A09)。
关键词 Simon算法 GROVER算法 PFP算法 周期函数 量子密钥恢复 Simon algorithm Grover algorithm PFP algorithm periodic function quantum key recovery
  • 相关文献

参考文献12

二级参考文献28

  • 1罗宜元,闫海伦,王磊,胡红钢,来学嘉.分组密码结构抗Simon量子算法攻击研究[J].密码学报,2019,6(5):561-573. 被引量:12
  • 2Bogdanov A, Knudsen L R, Leander G, et al. PRESENT: an ultra-lightweight block cipher. Proceedings of the 9th International Workshop on Cryptographic Hardware and Embedded Systems (CHES'07), Sep 10-13, 2007, Vienna, Austria. LNCS 4727. Heidelberg, Germany: Springer, 2007: 450-466. 被引量:1
  • 3Eisenbarth T, Paar C, Poschmann A, et al. A survey of lightweight cryptography Implementations. IEEE Design & Test of Computers, 2007, 24(6): 522-533. 被引量:1
  • 4Wu W L, Zhang L. LBlock: a lightweight block cipher. Proceedings of the 9th International Workshop on Applied Cryptography and Network Security (ACNS'II), Jun 7-10, 2011, Nerja, Spain. LNCS 6715. Heidelberg, Germany: Springer, 2011 : 327-344. 被引量:1
  • 5Hong 0, Sung J, Hong S, et al. HIGHT: a new block cipher suitable for low-resource device. Proceedings of the 8th International Workshop on Cryptographic Hardware and Embedded Systems (CHES'06), Oct 10-13, 2006, Yokohama, Japan. LNCS 4249. Heidelberg, Germany: Springer, 2006: 46-59. 被引量:1
  • 6Lim C H, Korkishko T. mCrypton: a lightweight block cipher for security of low-cost RFID tags and sensors. Proceedings of the 6th International Workshop on Information Security Applications (WISA'05), Aug 22-24, 2005, Jeju Island,Republic of Korea. LNCS 3786. Springer, Germany: Heidelberg, 2006: 243-258. 被引量:1
  • 7Leander G, Paar C, Poschmann A. New lightweight DES variants. Proceedings of the 14th International Conference on Fast Software Encryption (FSE'07), Mar 26-28, 2007, Luxembourg. LNCS 4593. Heidelberg, Germany: Springer, 2007: 196-210. 被引量:1
  • 8Canniere C, Dunkelman 0, Knezevic M. KATAN and KTANTAN: a family of small and efficient hardware-oriented block ciphers. Proceedings of the II th International Workshop on Cryptographic Hardware and Embedded Systems (CHES'09), Sep 6-9, 2009, Lausanne, Switzerland. LNCS 5747. Springer, Germany: Heidelberg, 2009: 272-288. 被引量:1
  • 9Robshaw M J B. Searching for compact algorithms: CGEN. Progress in Cryptology: Proceedings of the I st International Conference on Cryptology (VIETCRYPT'06), Sep 25-28, 2006, Hanoi, Vietnam. LNCS 4341. Heidelberg, Germany: Springer, 2006: 37-49. 被引量:1
  • 10Izadi M, Sadeghiyan B, Sadeghi an S, et al. MIBS: a new lightweight block cipher. Proceedings oflnternational Conference on Cryptology and Network Security (CANS'09), Dec 12-14, 2009, Kanazawa, Japan. LNCS 5888. Heidelberg, Germany: Springer, 2009: 334-348. 被引量:1

共引文献71

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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