arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.15076cs.CRcs.ITcs.LGmath.IT
收藏

基于机器学习的密码分析信息论度量

Cryptanalysis via Machine Learning Based Information Theoretic Metrics

University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Massachusetts Institute of Technology(麻省理工学院);Clemson University(克莱姆森大学);Technion Israel Institute of Technology(以色列理工学院);MIT Lincoln Laboratory(麻省理工学院林肯实验室)

Benjamin D. Kim, Vipindev Adat Vasudevan, Rafael G. L. D'Oliveira, Alejandro Cohen, Thomas Stahlbuhk, Muriel Médard

AI总结:

本文提出两种基于机器学习信息论度量的密码分析算法,利用互信息神经估计和二元交叉熵分类在已知明文设置下评估密码系统鲁棒性,能高效识别非IND-CPA安全加密方案及参数缺陷,为密码系统健全性提供快速经验检查。

摘要:

机器学习(ML)和密码分析领域共享一个有趣且共同的目标,即基于给定的一组输入和输出创建一个函数。然而,这两个领域在实现这一目标的方法上存在巨大差异。在本文中,我们探索整合 ML 领域的知识,以提供对密码系统的经验性评估。具体而言,我们利用信息论度量来执行基于 ML 的分布估计。我们提出了两种新颖的 ML 算法应用,这些应用可以在已知明文设置中应用,对任何密码系统执行密码分析。我们使用互信息神经估计来计算密码系统的互信息泄露,并使用二元交叉熵分类来对选择明文攻击(CPA)下的不可区分性进行建模。这些算法可以直接应用于审计场景,以评估密码系统的鲁棒性,并且结果可以提供有用的经验界限。我们通过经验性地分析几种加密方案来评估我们方法的有效性。此外,我们将分析扩展到新颖的基于网络编码的密码系统,并为我们的算法提供了其他用例。我们表明,我们的分类模型能够以高准确率正确识别出非 IND-CPA 安全的加密方案,例如 DES、RSA 和 AES ECB。它还能识别具有错误参数的 CPA 安全密码系统中的故障,例如 AES-CTR 的精简计数器版本。我们还得出结论,使用我们的算法,在大多数情况下,使用较少计算能力的较小规模神经网络可以识别密码系统中的漏洞,从而提供对密码系统健全性的快速检查,并帮助决定是否花费更多资源来部署能够破解该密码系统的更大网络。

英文摘要:

The fields of machine learning (ML) and cryptanalysis share an interestingly common objective of creating a function, based on a given set of inputs and outputs. However, the approaches and methods in doing so vary vastly between the two fields. In this paper, we explore integrating the knowledge from the ML domain to provide empirical evaluations of cryptosystems. Particularly, we utilize information theoretic metrics to perform ML-based distribution estimation. We propose two novel applications of ML algorithms that can be applied in a known plaintext setting to perform cryptanalysis on any cryptosystem. We use mutual information neural estimation to calculate a cryptosystem's mutual information leakage, and a binary cross entropy classification to model an indistinguishability under chosen plaintext attack (CPA). These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem and the results can provide a useful empirical bound. We evaluate the efficacy of our methodologies by empirically analyzing several encryption schemes. Furthermore, we extend the analysis to novel network coding-based cryptosystems and provide other use cases for our algorithms. We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy. It also identifies the faults in CPA-secure cryptosystems with faulty parameters, such a reduced counter version of AES-CTR. We also conclude that with our algorithms, in most cases a smaller-sized neural network using less computing power can identify vulnerabilities in cryptosystems, providing a quick check of the sanity of the cryptosystem and help to decide whether to spend more resources to deploy larger networks that are able to break the cryptosystem.

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

↑