Results 1 to 10 of about 16,934 (147)
The (related-key) impossible boomerang attack and its application to the AES block cipher [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiqiang Lu
semanticscholar +6 more sources
On Impossible Boomerang Attacks
The 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 +4 more sources
Impossible Boomerang Attacks Revisited
The 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 +4 more sources
Impossible Boomerang Attack for Block Cipher Structures [PDF]
Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differential cryptanalysis and boomerang attack. Though such an attack might not be the best attack available, its complexity is still less than that of the exhaustive search.
Jiali Choy, Huihui Yap
semanticscholar +5 more sources
A Holistic Framework for Impossible Boomerang Attacks [PDF]
In 2011, Lu introduced the impossible boomerang attack at DCC. This powerful cryptanalysis technique combines the strengths of the impossible differential and boomerang attacks, thereby inheriting the advantages of both cryptographic techniques. In this paper, we propose a holistic framework comprising two generic and effective algorithms and a MILP ...
Yincen Chen +5 more
semanticscholar +4 more sources
QARMAv2 is a general-purpose and hardware-oriented family of lightweight tweakable block ciphers (TBCs) introduced in ToSC 2023. QARMAv2, as a redesign of QARMAv1 with a longer tweak and tighter security margins, is also designed to be suitable for ...
Hosein Hadipour, Yosuke Todo
doaj +2 more sources
A tutorial of boomerang attack on SMALLPRESENT-[4]
In 2010, Leander proposed a new version of the block cipher PRESENT with smaller block size, namely SMALLPRESENT-[n]. This algorithm is designed to deepen understanding of how the running time of the algorithm and the vulnerability of attack during the ...
I. W. Hutahaean +2 more
semanticscholar +1 more source
Full-round impossible differential attack on shadow block cipher
Lightweight block ciphers are the essential encryption algorithm for devices with limited resources. Its goal is to ensure the security of data transmission through resource-constrained devices.
Yuting Liu +3 more
semanticscholar +1 more source
Related-key Impossible Boomerang Cryptanalysis on LBlock-s
LBlock-s is the core block cipher of authentication encryption algorithm LAC, which uses the same structure of LBlock and an improved key schedule algorithm with better diffusion property.
Minm Xie, Qiya Zeng
semanticscholar +1 more source
Related-key impossible boomerang cryptanalysis on LBlock
The related-key impossible boomerang cryptanalysis and the strength of the lightweight block cipher LBlock against this method were investigated.A new attack on 22-round LBlock was presented combining impossible boomerang attacks with related-key attacks.
Min XIE, Yan-li MU
doaj +2 more sources

