摘要
机器人与机器学习每日新闻的新闻记者兼新闻编辑-对称密码学的研究结果在一份新的报告中讨论。根据NewsRx记者来自法国南希的新闻报道，研究表明，"不可能的Boomer Ang攻击，由陆于2008年引入，是不可能差分攻击的延伸，它依赖于概率为0的回飞镖识别器丢弃不正确的密钥猜测。"新闻编辑们从洛林大学的研究中引用了一句话：“在卢的工作中，被认为不可能的回飞镖区分器是从4个（不同的）概率-1的差异中建立的，这4个差异的总和在中间不等于0，在这篇文章中，本文研究了由回飞棒开关约束导出的更精细级矛盾扩展这一概念的可能性.我们首先讨论了二次费斯特尔密码,特别是西蒙密码.我们解释了它们非常具体的回飞棒约束,以加强一个矛盾,即我们用SMT求解器搜索一种新的不可能回飞棒区分器.接下来我们将讨论二次费斯特尔密码,特别是西蒙密码.切换到面向单词的密码，研究如何利用B oomerang连通表的矛盾。我们将这一思想应用于SKINNYee，这是一种在Crypto 2022上提出的可调整分组密码，得到了21轮的距离。
Abstract
By a News Reporter-Staff News Editor at Robotics & Machine Learning Daily News Daily News – Research findings on symmetric cryptol ogy are discussed in a new report. According to news reporting originating from Nancy, France, by NewsRx correspondents, research stated, “The impossible boomer ang attack, introduced in 2008 by Jiqiang Lu, is an extension of the impossible differential attack that relies on a boomerang distinguisher of probability 0 fo r discarding incorrect key guesses.” The news editors obtained a quote from the research from University of Lorraine: “In Lu’s work, the considered impossible boomerang distinguishers were built fr om 4 (different) probability-1 differentials that lead to 4 differences that do not sum to 0 in the middle, in a miss-in-the-middle way. In this article, we stu dy the possibility of extending this notion by looking at finerlevel contradicti ons that derive from boomerang switch constraints. We start by discussing the ca se of quadratic Feistel ciphers and in particular of the Simon ciphers. We explo it their very specific boomerang constraints to enforce a contradiction that cre ates a new type of impossible boomerang distinguisher that we search with an SMT solver. We next switch to word-oriented ciphers and study how to leverage the B oomerang Connectivity Table contradictions. We apply this idea to SKINNYee, a re cent tweakable block cipher proposed at Crypto 2022 and obtain a 21-round distin guisher.”
NETL
NSTL