首页|Researchers’ from University of Lorraine Report Details of New Studies and Findi ngs in the Area of Symmetric Cryptology (On Impossible Boomerang Attacks)
Researchers’ from University of Lorraine Report Details of New Studies and Findi ngs in the Area of Symmetric Cryptology (On Impossible Boomerang Attacks)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
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.”
University of LorraineNancyFranceE uropeMachine LearningSymmetric Cryptology
NETL
NSTL
