《计算机应用》唯一官方网站 ›› 2024, Vol. 44 ›› Issue (4): 1166-1171.DOI: 10.11772/j.issn.1001-9081.2023050576

• 网络空间安全 • 上一篇    

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

李艳俊1,2,3, 景小宇2,3, 谢惠琴2,3, 项勇1   

  1. 1.中国电子科技集团公司第十五研究所 信息产业信息安全测评中心, 北京 100083
    2.河南省网络密码技术重点实验室, 郑州 450012
    3.北京电子科技学院, 北京 100070
  • 收稿日期:2023-05-12 修回日期:2023-06-13 接受日期:2023-06-16 发布日期:2023-08-01 出版日期:2024-04-10
  • 通讯作者: 李艳俊
  • 作者简介:李艳俊(1979—),女,山西晋城人,副教授,博士,主要研究方向:密码算法设计与分析、密码协议
    景小宇(1997—),男,湖北武汉人,硕士研究生,主要研究方向:密码算法设计、实现与分析
    谢惠琴(1992—),女,福建宁德人,讲师,博士,主要研究方向:量子密码分析、分组密码设计与分析
    项勇(1978—),男,江苏镇江人,高级工程师,硕士,主要研究方向:信息安全。
  • 基金资助:
    北京市自然科学基金资助项目(4234084);河南省网络密码技术重点实验室研究课题(LNCT2021?A09)

Security analysis of PFP algorithm under quantum computing model

Yanjun LI1,2,3, Xiaoyu JING2,3, Huiqin XIE2,3, Yong XIANG1   

  1. 1.Information Industry Information Security Evaluation Center,The 15th Research Institute of China Electronics Technology Group Corporation,Beijing 100083,China
    2.Henan Key Laboratory of Network Cryptography Technology,Zhengzhou Henan 450012,China
    3.Beijing Institute of Electronic Science and Technology,Beijing 100070,China
  • Received:2023-05-12 Revised:2023-06-13 Accepted:2023-06-16 Online:2023-08-01 Published:2024-04-10
  • Contact: Yanjun LI
  • About author:LI Yanjun, born in 1979, Ph. D., associate professor. Her research interests include design and analysis of cryptographic algorithm, cryptographic protocol.
    JING Xiaoyu, born in 1997, M. S. candidate. His research interests include design, implementation and analysis of cryptographic algorithm.
    XIE Huiqin, born in 1992, Ph. D., lecturer. Her research interests include quantum cryptographic analysis, design and analysis of block cipher.
    XIANG Yong, born in 1978, M. S., senior engineer. His research interests include information security.
  • Supported by:
    Beijing Natural Science Foundation(4234084);Research Project of Henan Key Laboratory of Network Cryptography Technology(LNCT2021-A09)

摘要:

量子技术的快速发展和量子计算效率的不断提高,以及Shor算法和Grover算法的出现,给传统公钥密码和对称密码的安全性造成了较大威胁。因此,基于Feistel结构设计的分组密码PFP算法,首先将轮函数的线性变换P融入Feistel结构的周期函数构造,推导得到PFP算法的4个5轮周期函数,比选择明文攻击模型下典型Feistel结构的周期函数多2轮,并通过实验验证正确性;进一步地,以其中一个5轮周期函数作为区分器,结合量子Grover算法和Simon算法,通过分析PFP密钥编排算法的特点对9、10轮PFP进行了安全性评估,得到正确密钥比特需要的时间复杂度为226、238.5,需要的量子资源为193、212个量子比特,可以恢复58、77比特密钥,优于已有不可能差分分析结果。

关键词: Simon算法, Grover算法, PFP算法, 周期函数, 量子密钥恢复

Abstract:

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 226, 238.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.

Key words: Simon algorithm, Grover algorithm, PFP algorithm, periodic function, quantum key recovery

中图分类号: