系统工程与电子技术 ›› 2025, Vol. 47 ›› Issue (9): 3099-3108.doi: 10.12305/j.issn.1001-506X.2025.09.32

• 通信与网络 • 上一篇    

面向MD哈希结构的量子新牧群攻击

李雪莲1,*, 李程龙1(), 裴焘2,3, 高军涛4   

  1. 1. 西安电子科技大学数学与统计学院,陕西 西安 710071
    2. 武汉船舶通信研究所,湖北 武汉 430205
    3. 武汉大学国家网络安全学院,湖北 武汉 430072
    4. 西安电子科技大学通信工程学院,陕西 西安 710071
  • 收稿日期:2024-05-17 出版日期:2025-09-25 发布日期:2025-09-16
  • 通讯作者: 李雪莲 E-mail:18047288473@163.com
  • 作者简介:李程龙(2000—),男,硕士研究生,主要研究方向为量子密码分析
    裴 涛(1987—),男,高级工程师,硕士,主要研究方向为流密码
    高军涛(1979—),男,副教授,博士,主要研究方向为伪随机序列、流密码
  • 基金资助:
    陕西省重点研发计划(2021ZDLGY06-04); 广西密码学与信息安全重点实验室基金(GCIS201802); 西安电子科技大学交叉培育项目(21103240011)资助课题

New quantum herding attack on hash with MD construction

Xuelian LI1,*, Chenglong LI1(), Tao PEI2,3, Juntao GAO4   

  1. 1. School of Mathematics and Statistics,Xidian University,Xi’an 710071,China
    2. Wuhan Maritime Communication Research Institute,Wuhan 430205,China
    3. School of Cyber Science and Engineering,Wuhan University,Wuhan 430072,China
    4. School of Telecommunications Engineering,Xidian University,Xi’an 710071,China
  • Received:2024-05-17 Online:2025-09-25 Published:2025-09-16
  • Contact: Xuelian LI E-mail:18047288473@163.com

摘要:

针对 MD(Merkle-Damgard)哈希结构在量子环境下的安全性问题,提出BHT(Brassard-H?yer-Tapp)量子算法、 CNS(Chailloux-Naya Plasencia-Schrottenloher)量子算法分别与经典新牧群攻击结合的思路,构建两种攻击模式。首先,使用BHT量子算法构造 “可变长钻石树”,增加可连接节点的数量,提升攻击效率。在一定条件下,当恢复消息长度相同时,攻击复杂度更低。然后,以安全哈希算法(secure hash algorithm,SHA)-256为例,给出具体攻击复杂度。接着,提出CNS量子算法与新牧群攻击结合的攻击模式,攻击过程中不再需要量子随机存取储存器(quantum random access memory,qRAM),降低攻击实现成本。攻击模式可以在一定范围内选择消息长度进行恢复,优于现存方案中不可选择的情况。

关键词: 哈希函数, 牧群攻击, BHT(Brassard-H?yer-Tapp)算法, CNS(Chailloux-Naya Plasencia –Schrottenloher)算法

Abstract:

Aiming at the security issues of MD (Merkle-Damgard) with hash structure in the quantum environment, the idea of combining BHT (Brassard-H?yer-Tapp) quantum algorithm and CNS (Chailloux-Naya Plasencia-Schrottenloher) quantum algorithm with the classical new herding attack respectively is proposed, and two attack modes are constructed. Firstly, the BHT quantum algorithm is used to construct a “variable length diamond tree” to increase the number of connected nodes and improve the attack efficiency. Under certain conditions, when the length of recovery message is the same, the attack complexity is lower. Then, taking secure hash algorithm (SHA)-256 as an example, the specific attack complexity is given. Then, an attack mode combining CNS quantum algorithm with new herding attack is proposed, which no longer needs quantum random access memory (qRAM) in the attack process, reducing the attack implementation cost. The attack mode can select the message length for recovery within a certain range, which is better than the non-selectable case in the existing schemes.

Key words: hash function, herding attack, BHT (Brassard-H?yer-Tapp) algorithm, CNS (Hailloux-Naya Plasencia–Schrottenloher) algorithm

中图分类号: