Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA

Kircanski, Aleksandar

doi:10.1007/978-3-319-28166-7_16

Cited by 3 publications

(3 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2011, Murphy [Mur11] provided several examples for both AES and DES of boomerangs never coming back. Similar results were obtained by Kircanski in [Kir15]: a SAT solver is used to show that previous rectangle/boomerang attacks on XTEA [Lu09], SM3 [WKD07] and SHACAL-1 [DKK06] primitives were based on incompatible characteristics.…”

Section: Introductionsupporting

confidence: 76%

Catching the Fastest Boomerangs

Delaune

Derbez

Vavrille

2020

ToSC

View full text Add to dashboard Cite

In this paper we describe a new tool to search for boomerang distinguishers. One limitation of the MILP model of Liu et al. is that it handles only one round for the middle part while Song et al. have shown that dependencies could affect much more rounds, for instance up to 6 rounds for SKINNY. Thus we describe a new approach to turn an MILP model to search for truncated characteristics into an MILP model to search for truncated boomerang characteristics automatically handling the middle rounds. We then show a new CP model to search for the best possible instantiations to identify good boomerang distinguishers. Finally we systematized the method initiated by Song et al. to precisely compute the probability of a boomerang. As a result, we found many new boomerang distinguishers up to 24 rounds in the TK3 model. In particular, we improved by a factor 230 the probability of the best known distinguisher against 18-round SKINNY-128/256.

show abstract

Section: Introductionsupporting

confidence: 76%

Catching the Fastest Boomerangs

Delaune

Derbez

Vavrille

2020

ToSC

View full text Add to dashboard Cite

show abstract

“…The CNF encodings are obtained from the language's semantic. The tool was used in [11] in order to show that previous differential analyses of some block ciphers (i.e. XTEA and SHACAL-1) were based on incompatible differential trails.…”

Section: Literature Reviewmentioning

confidence: 99%

CryptoSAT: a tool for SAT‐based cryptanalysis

Lafitte

2018

IET Information Security

View full text Add to dashboard Cite

“…Therefore, we use 's method to set up a linear system of equations for detecting contradictions. The ideas given by Kircanski in can also help us when constructing available differential characteristics. It is notable that the number of contradicting bit conditions will increase exponentially when 15 or more rounds are considered.…”

Section: Boomerang Attacks On Round‐reduced Lsh Hash Functionsmentioning

confidence: 99%

Cryptanalysis of the LSH hash functions

Hao

2016

Security Comm. Networks

View full text Add to dashboard Cite

In this paper, we study the security of the LSH hash functions. We find that the wide‐pipe MD‐structural LSH hash functions apply the 17th PGV scheme which is “backward attackable”. This property equips us with trivial attacks including pseudo‐preimage, free‐start collision, and Type II boomerang. These attacks can never be available to previous MD‐structural hash functions like Skein. We stress that such trivial attacks can only be regarded as distinguishers rather than real threat to the LSH in nowadays' practical applications. But we should still be cautious about the possible malicious use of LSH in specific situations in the future. We also launch 14‐round boomerang attacks on LSH‐512 and LSH‐256 hash functions with complexities 2308 and 2242, respectively. We verify the correctness of our boomerang attacks by giving practical 11‐round boomerang quartets. To the best of our knowledge, these are the first practically verifiable boomerang results on the LSH hash functions. These boomerang results indicate that the round functions of LSH are well designed. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA

Cited by 3 publications

References 46 publications

Catching the Fastest Boomerangs

Catching the Fastest Boomerangs

CryptoSAT: a tool for SAT‐based cryptanalysis

Cryptanalysis of the LSH hash functions

Contact Info

Product

Resources

About