Results 1 to 10 of about 10,588 (175)
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
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 +3 more sources
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 +3 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 +3 more sources
Automatic boomerang attacks search on Rijndael
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
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 +1 more source
A Formal Analysis of Boomerang Probabilities
IACR Transactions on Symmetric Cryptology, 2022 In the past 20 years since their conception, boomerang attacks have become an important tool in the cryptanalysis of block ciphers. In the classical estimate of their success probability, assumptions are made about the independence of the underlying ...
Andreas B. Kidmose, Tyge Tiessen
doaj +1 more source
Throwing Boomerangs into Feistel Structures
IACR Transactions on Symmetric Cryptology, 2022 Automatic tools to search for boomerang distinguishers have seen significant advances over the past few years. However, most previous work has focused on ciphers based on a Substitution Permutation Network (SPN), while analyzing the Feistel structure is
Hosein Hadipour +2 more
doaj +1 more source
Improved Rectangle Attacks on SKINNY and CRAFT
IACR Transactions on Symmetric Cryptology, 2021 The boomerang and rectangle attacks are adaptions of differential cryptanalysis that regard the target cipher E as a composition of two sub-ciphers, i.e., E = E1 ∘ E0, to construct a distinguisher for E with probability p2q2 by concatenating two short ...
Hosein Hadipour +2 more
doaj +1 more source
Automatic Search of Rectangle Attacks on Feistel Ciphers: Application to WARP
IACR Transactions on Symmetric Cryptology, 2022 In this paper we present a boomerang analysis of WARP, a recently proposed Generalized Feistel Network with extremely compact hardware implementations.
Virginie Lallemand +2 more
doaj +1 more source