Results 11 to 20 of about 348 (151)
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
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
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 +4 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 +2 more
openaire +2 more sources
Quantum Boomerang Attacks and Some Applications
, 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.
Frixons, Paul +2 more
openaire +4 more sources
The QARMAv2 Family of Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2023 We introduce the QARMAv2 family of tweakable block ciphers. It is a redesign of QARMA (from FSE 2017) to improve its security bounds and allow for longer tweaks, while keeping similar latency and area.
Roberto Avanzi +6 more
doaj +1 more source
On the Feistel Counterpart of the Boomerang Connectivity Table
IACR Transactions on Symmetric Cryptology, 2020 At Eurocrypt 2018, Cid et al. introduced the Boomerang Connectivity Table (BCT), a tool to compute the probability of the middle round of a boomerang distinguisher from the description of the cipher’s Sbox(es). Their new table and the following works led
Hamid Boukerrou +4 more
doaj +1 more source
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
openaire +2 more sources
On the Boomerang Uniformity of Cryptographic Sboxes
IACR Transactions on Symmetric Cryptology, 2018 The boomerang attack is a cryptanalysis technique against block ciphers which combines two differentials for the upper part and the lower part of the cipher.
Christina Boura, Anne Canteaut
doaj +1 more source
The Boomerang Attacks on the Round-Reduced Skein-512 [PDF]
, 2013 The hash function Skein is one of the five finalists of the NIST SHA-3 competition. It is based on the block cipher Threefish which only uses three primitive operations: modular addition, rotation and bitwise XOR (ARX). This paper studies the boomerang attacks on Skein-512.
Hongbo Yu +2 more
openaire +4 more sources