Results 1 to 10 of about 420,893 (166)

On Impossible Boomerang Attacks

open access: yesIACR Transactions on Symmetric Cryptology
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

On Boomerang Attacks on Quadratic Feistel Ciphers [PDF]

open access: yesIACR 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

Related-Key Boomerang Attack on Block Cipher SQUARE [PDF]

open access: yesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
Square is an 8-round SPN structure block cipher and its round function and key schedule have been slightly modified to design building blocks of Rijndael. Key schedule of Square is simple and efficient but fully affine, so we apply a related-key attack on it.
Yongjin Yeom
exaly   +5 more sources

Quantum Truncated Differential and Boomerang Attack [PDF]

open access: yesSymmetry
In order to design quantum-safe block ciphers, it is crucial to investigate the application of quantum algorithms to cryptographic analysis tools. In this study, we use the Bernstein–Vazirani algorithm to enhance truncated differential cryptanalysis and boomerang cryptanalysis.
Li Yang, Huiqin Xie
exaly   +7 more sources

Automatic boomerang attacks search on Rijndael

open access: yesJournal of Mathematical Cryptology
Boomerang 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   +7 more sources

A novel systematic byte substitution method to design strong bijective substitution box (S-box) using piece-wise-linear chaotic map. [PDF]

open access: yesPeerJ Comput Sci, 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.
Ali A, Khan MA, Ayyasamy RK, Wasif M.
europepmc   +3 more sources

Quantum Boomerang Attacks and Some Applications

open access: yesLecture Notes in Computer Science, 2022
In this paper, we study quantum key-recovery attacks on block ciphers. While it is well known that a quantum adversary can generically speed up an exhaustive search of the key, much less is known on how to use specific vulnerabilities of the cipher to accelerate this procedure.
Maria Naya-Plasencia
exaly   +6 more sources

Amplified Boomerang Attack against Reduced-Round SHACAL [PDF]

open access: yesLecture Notes in Computer Science, 2002
SHACAL is a 160-bit block cipher based on the hash standard SHA-1, as a submission to NESSIE. SHACAL uses the XOR, modular addition operation and the functions of bit-by-bit manner. These operations and functions make the differential cryptanalysis difficult, i.e, it is hard to find a long differential characteristic with high probability.
Seokhie Hong
exaly   +3 more sources

Impossible Boomerang Attacks Revisited

open access: yesIACR Transactions on Symmetric Cryptology
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

The Retracing Boomerang Attack, with Application to Reduced-Round AES

open access: yesJournal of Cryptology
AbstractBoomerang attacks are extensions of differential attacks that make it possible to combine two unrelated differential properties of the first and second part of a cryptosystem with probabilities p and q into a new differential-like property of the whole cryptosystem with probability $$p^2q^2$$
Orr Dunkelman   +2 more
exaly   +4 more sources

Home - About - Disclaimer - Privacy