Results 1 to 10 of about 10,387 (191)
On Impossible Boomerang Attacks
IACR Transactions on Symmetric CryptologyThe impossible boomerang attack, introduced in 2008 by Jiqiang Lu, is an extension of the impossible differential attack that relies on a boomerang distinguisher of probability 0 for discarding incorrect key guesses.
Xavier Bonnetain +4 more
doaj +5 more sources
On Boomerang Attacks on Quadratic Feistel Ciphers
IACR Transactions on Symmetric Cryptology, 2023 The recent introduction of the Boomerang Connectivity Table (BCT) at Eurocrypt 2018 revived interest in boomerang cryptanalysis and in the need to correctly build boomerang distinguishers.
Xavier Bonnetain, Virginie Lallemand
doaj +5 more sources
Automatic boomerang attacks search on Rijndael [PDF]
Journal of Mathematical CryptologyBoomerang attacks were introduced in 1999 by Wagner (The boomerang attack. In: Knudsen LR, editor. FSE’99. vol. 1636 of LNCS. Heidelberg: Springer; 1999. p.
Rouquette Loïc +2 more
doaj +4 more sources
Impossible Boomerang Attacks Revisited
IACR Transactions on Symmetric CryptologyThe impossible boomerang (IB) attack was first introduced by Lu in his doctoral thesis and subsequently published at DCC in 2011. The IB attack is a variant of the impossible differential (ID) attack by incorporating the idea of the boomerang attack. In
Jianing Zhang, Haoyang Wang, Deng Tang
doaj +5 more sources
A novel systematic byte substitution method to design strong bijective substitution box (S-box) using piece-wise-linear chaotic map [PDF]
PeerJ Computer Science, 2022 Cryptography deals with designing practical mathematical algorithms having the two primitive elements of confusion and diffusion. The security of encrypted data is highly dependent on these two primitive elements and a key.
Asim Ali +3 more
doaj +3 more sources
, 1999 This paper describes a new differential-style attack, which we call the boomerang attack. This attack has several interesting applications. First, we disprove the of t-repeated claim that eliminating all high-probability differentials for the whole cipher is sufficient to guarantee security against differential attacks.
David Wagner
openalex +3 more sources
Boomerang Attacks on BLAKE-32 [PDF]
, 2011 We present high probability differential trails on 2 and 3 rounds of BLAKE-32. Using the trails we are able to launch boomerang attacks on up to 8 round-reduced keyed permutation of BLAKE-32. Also, we show that boomerangs can be used as distinguishers for hash/ compression functions and present such distinguishers for the compression function of BLAKE ...
Alex Biryukov, Ivica Nikolić, Arnab Roy
openalex +4 more sources
IACR Transactions on Symmetric Cryptology, 2021 This work investigates a generic way of combining two very effective and well-studied cryptanalytic tools, proposed almost 18 years apart, namely the boomerang attack introduced by Wagner in FSE 1999 and the yoyo attack by Ronjom et al. in Asiacrypt 2017.
Mostafizar Rahman +2 more
doaj +3 more sources
New Results on Boomerang and Rectangle Attacks [PDF]
, 2002 The boomerang attack is a new and very powerful cryptanalytic technique. However, due to the adaptive chosen plaintext and ciphertext nature of the attack, boomerang key recovery attacks that retrieve key material on both sides of the boomerang distinguisher are hard to mount.
Eli Biham, Orr Dunkelman, Nathan Keller
openalex +3 more sources
Search framework for neutral bits and boomerangs in SHA‐1 collision attacks [PDF]
IET Information Security, 2023 AbstractNeutral bits and boomerangs are key techniques for accelerating collision search in SHA‐1 attacks. The current acceleration techniques for SHA‐1 near‐collision attacks are reviewed and a generic search framework for neutral bits and boomerangs is presented.
Degang Li, Yang Yang, Guang Zeng
openalex +3 more sources