基于可编程SAT的SHA-256碰撞攻击
SHA-256 Collision Attack with Programmatic SAT
AI总结:
本文提出SAT与CAS混合求解方法,通过动态检测不一致性引导搜索,在步数缩减的SHA-256中成功找到38步碰撞,显著优于纯SAT方法的28步上限。
摘要:
密码学哈希函数在确保数据安全方面发挥着至关重要的作用,它从可变长度的输入生成固定长度的哈希值。哈希函数SHA-256因其在二十多年的严格审查后仍具有的韧性而被信赖用于数据安全。其关键特性之一是抗碰撞性,即找到两个具有相同哈希值的不同输入在计算上是不可行的。目前,最好的SHA-256碰撞攻击使用差分密码分析来在简化版本的SHA-256中寻找碰撞,这些版本被缩减为具有更少的步数,从而使寻找碰撞变得可行。在本文中,我们使用可满足性(SAT)求解器作为工具来搜索步数缩减的SHA-256碰撞,并在计算机代数系统(CAS)的辅助下动态引导求解器,CAS用于检测不一致性并推导出求解器自身无法检测到的信息。我们的混合SAT + CAS求解器显著优于纯SAT方法,使我们能够在步数缩减的SHA-256中找到具有显著更多步数的碰撞。使用SAT + CAS,我们找到了一个带有修改初始化向量的SHA-256的38步碰撞——这是由Mendel、Nad和Schläffer的高度复杂的搜索工具首次发现的。相比之下,纯SAT方法最多只能找到不超过28步的碰撞。然而,我们的工作仅使用了SAT求解器CaDiCaL及其可编程接口IPASIR-UP。
英文摘要:
Cryptographic hash functions play a crucial role in ensuring data security, generating fixed-length hashes from variable-length inputs. The hash function SHA-256 is trusted for data security due to its resilience after over twenty years of intense scrutiny. One of its critical properties is collision resistance, meaning that it is infeasible to find two different inputs with the same hash. Currently, the best SHA-256 collision attacks use differential cryptanalysis to find collisions in simplified versions of SHA-256 that are reduced to have fewer steps, making it feasible to find collisions. In this paper, we use a satisfiability (SAT) solver as a tool to search for step-reduced SHA-256 collisions, and dynamically guide the solver with the aid of a computer algebra system (CAS) used to detect inconsistencies and deduce information that the solver would otherwise not detect on its own. Our hybrid SAT + CAS solver significantly outperformed a pure SAT approach, enabling us to find collisions in step-reduced SHA-256 with significantly more steps. Using SAT + CAS, we find a 38-step collision of SHA-256 with a modified initialization vector -- something first found by a highly sophisticated search tool of Mendel, Nad, and Schläffer. Conversely, a pure SAT approach could find collisions for no more than 28 steps. However, our work only uses the SAT solver CaDiCaL and its programmatic interface IPASIR-UP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。