arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2005.13415cs.LOcs.CR
收藏

CDCL(加密)SAT加密分析解决方案

CDCL(Crypto) SAT Solvers for Cryptanalysis

Saeed Nejati, Vijay Ganesh

摘要:

在过去的二十年里,我们已经看到了冲突驱动的子句学习布尔可满足性(CDCL SAT)求解器在各种领域的工业问题上的效率有了显着的提高。像SAT求解器这样强大的通用搜索工具的可用性使得许多研究人员提出了基于SAT的密码分析方法,包括在散列函数中发现冲突和破坏对称加密方案的技术。以前提出的大多数基于SAT的密码分析方法都是黑箱技术,在这个意义上,密码分析问题被编码为SAT实例,然后调用CDCL SAT求解器来求解所述实例。这种方法的一个缺点是,这样生成的编码可能太大,任何现代求解器都无法有效求解。也许这种方法的一个更重要的弱点是,求解器没有专门化或调整来求解给定的实例。为了解决这些问题,我们提出了一种称为CDCL(加密)的方法(受可满足性模理论求解器中的CDCL(T)范式的启发),利用有关加密原语的特定领域知识来定制CDCL SAT求解器的内部子程序。具体来说,我们扩展的传播和冲突分析子程序的CDCL求解器与专门的代码,有知识的加密原语被分析的求解器。我们证明了这种方法的权力,在差分路径和代数故障分析的哈希函数。我们的初步结果是非常令人鼓舞的,并加强了这种方法是一个显着的改进黑箱SAT为基础的密码分析的概念。

英文摘要:

Over the last two decades, we have seen a dramatic improvement in the efficiency of conflict-driven clause-learning Boolean satisfiability (CDCL SAT) solvers on industrial problems from a variety of domains. The availability of such powerful general-purpose search tools as SAT solvers has led many researchers to propose SAT-based methods for cryptanalysis, including techniques for finding collisions in hash functions and breaking symmetric encryption schemes. Most of the previously proposed SAT-based cryptanalysis approaches are blackbox techniques, in the sense that the cryptanalysis problem is encoded as a SAT instance and then a CDCL SAT solver is invoked to solve the said instance. A weakness of this approach is that the encoding thus generated may be too large for any modern solver to solve efficiently. Perhaps a more important weakness of this approach is that the solver is in no way specialized or tuned to solve the given instance. To address these issues, we propose an approach called CDCL(Crypto) (inspired by the CDCL(T) paradigm in Satisfiability Modulo Theory solvers) to tailor the internal subroutines of the CDCL SAT solver with domain-specific knowledge about cryptographic primitives. Specifically, we extend the propagation and conflict analysis subroutines of CDCL solvers with specialized codes that have knowledge about the cryptographic primitive being analyzed by the solver. We demonstrate the power of this approach in the differential path and algebraic fault analysis of hash functions. Our initial results are very encouraging and reinforce the notion that this approach is a significant improvement over blackbox SAT-based cryptanalysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑