Filters

5,003 Hits in 2.0 sec

### The Boomerang Attack [chapter]

David Wagner
1999 Lecture Notes in Computer Science
This paper describes a new differential-style attack, which we call the boomerang attack. This attack has several interesting applications.  ...  Also, to illustrate the power of boomerang techniques, we give new attacks on Khufu-16, FEAL-6, and 16 rounds of CAST-256. 1 Note that Biham et al.'  ...  ∇) or a boomerang attack.  ...

### Boomerang Attacks on BLAKE-32 [chapter]

Alex Biryukov, Ivica Nikolić, Arnab Roy
2011 Lecture Notes in Computer Science
(joint work with Alex Biryukov and Ivica Nikolić)Boomerang attacks on BLAKE-32  ...  attacks on BLAKE-32 f0 f1 ∇ * ∇ P1 P2 P3 P4 Pr [∆ → ∆ * ] = p Pr [∇ → ∇ * ] = q f = f1 • f0 f (P1) ⊕ f (P3) = ∇ * f (P2) ⊕ f (P4) = ∇ * ∆ * ∆ ∆ ∆ * For the boomerang quartet (P 1 , P 2 , P 3 , P 4 ) we  ...  The real probability of the Boomerang isp 2q2 , wherep,q are the amplified probability defined as: Boomerang attack on BLAKE-32 The real probability of the Boomerang isp 2q2 , wherep,q are the amplified  ...

### Rectangle and Boomerang Attacks on DES

Lei ZHANG, Wen-Ling WU
2008 Journal of Software (Chinese)
This paper examines the strength of DES against the Rectangle attack and the Boomerang attack.  ...  By using the best differential characteristic of DES, the paper gets an attack against up to 12-round DES using the Rectangle attack and an attack against 11-round DES using the Boomerang attack respectively  ...  Rounds Attack Data complexity Time complexity Source 8 Rectangle attack 2 42 CP 2 18.17 This paper 8 Differential cryptanalysis 2 14 CP 2 9 Ref.[2] 11 Boomerang attack 2 58 ACPC 2 38  ...

### Related-Key Boomerang and Rectangle Attacks [chapter]

Eli Biham, Orr Dunkelman, Nathan Keller
2005 Lecture Notes in Computer Science
This paper introduces the related-key boomerang and the related-key rectangle attacks. These new attacks can expand the cryptanalytic toolbox, and can be applied to many block ciphers.  ...  Hence, even ciphers which were considered resistant to either boomerang or related-key differential attacks may be broken using the new techniques. ⋆ This paper is partially based on the papers [9, 10,  ...  The Related-Key Rectangle Attack The transformation of the related-key boomerang attack into the related-key rectangle attack is similar to the transformation of the boomerang attack to the rectangle attack  ...

### Amplified Boomerang Attack against Reduced-Round SHACAL [chapter]

Jongsung Kim, Dukjae Moon, Wonil Lee, Seokhie Hong, Sangjin Lee, Seokwon Jung
2002 Lecture Notes in Computer Science
Using this fact, we discuss the security of SHACAL against an amplified boomerang attack. We find a 36-step boomerang-distinguisher and present attacks on reduced-round SHACAL with various key sizes.  ...  We can attack 39-step SHACAL with 256-bit key, and 47-step SHACAL with 512-bit key. In addition, we present differential attacks of reduced-round SHACAL with various key sizes.  ...  attack, while the boomerang attack [8] is an adaptive chosen plaintext and ciphertext attack.  ...

### Impossible Boomerang Attack for Block Cipher Structures [chapter]

Jiali Choy, Huihui Yap
2009 Lecture Notes in Computer Science
In impossible boomerang attack, impossible boomerang distinguishers are used to retrieve some of the subkeys.  ...  Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers.  ...  The Impossible Boomerang Attack The attack, described in [5] , combines the boomerang attack with impossible differential cryptanalysis, and is called the impossible boomerang attack (IBA).  ...

### The Boomerang Attacks on BLAKE and BLAKE2 [chapter]

Yonglin Hao
2015 Lecture Notes in Computer Science
We launch boomerang attacks on all four members of BLAKE and BLAKE2, and compare their complexities.  ...  In this paper, we study the security margins of hash functions BLAKE and BLAKE2 against the boomerang attack.  ...  The Boomerang Attack About the boomerang attack on hash functions, we mainly review the known-related-key boomerang method given in [19] .  ...

### New Results on Boomerang and Rectangle Attacks [chapter]

Eli Biham, Orr Dunkelman, Nathan Keller
2002 Lecture Notes in Computer Science
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  ...  Introduction to Boomerang and Rectangle Attacks The Boomerang Attack The boomerang attack was introduced in [18] .  ...

### Boomerang Attack on Step-Reduced SHA-512 [chapter]

Hongbo Yu, Dongxia Bai
2015 Lecture Notes in Computer Science
In this work, we analyze the security of SHA-512 with respect to boomerang attack.  ...  As far as we know, it is the best practical attack on step-reduced SHA-512.  ...  The Boomerang Attack on Reduced SHA-512 In this section, we apply the boomerang attack to the SHA-512 compression function reduced to 48 steps.  ...

### Related-Key Boomerang Attack on Block Cipher SQUARE

Bonwook KOO, Yongjin YEOM, Junghwan SONG
2011 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
In this paper, we present a key recovery attack on the full round of Square using a related-key boomerang distinguisher.  ...  By extending of this related-key differential, we construct a 7-round related-key boomerang distinguisher and successful attack on full round Square.  ...  could be attacked with 4 relatedkeys and 2 78.7 time complexity by transforming boomerang attack into chosen ciphertext/adaptive chosen plaintext attack.  ...

### Boomerang Attacks on Hash Function Using Auxiliary Differentials [chapter]

Gaëtan Leurent, Arnab Roy
2012 Lecture Notes in Computer Science
In this paper we study boomerang attacks in the chosen-key setting.  ...  The boomerang attack The boomerang attack was introduced by David Wagner in 1999 [16] against block ciphers, and the initial idea has been developed through many later results,  ...  We note that any successful boomerang attack does provide such quartets; therefore, as long as a standard boomerang attack works, our improved attack with auxiliary differentials will also work.  ...

### The Boomerang Attacks on the Round-Reduced Skein-512 [chapter]

Hongbo Yu, Jiazhe Chen, Xiaoyun Wang
2013 Lecture Notes in Computer Science
Because Laurent et al. [14] pointed out that the previous boomerang distinguishers for Threefish-512 are in fact not compatible, our attacks are the first valid boomerang attacks for the final round Skein  ...  In addition, the boomerang distinguishers are applicable to the key-recovery attacks on reduced Threefish-512.  ...  The Boomerang Attack The boomerang attack was introduced by Wagner [ [3] . The basic idea of the boomerang attack is joining two short differential paths with high probabilities in a quartet.  ...

### Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent [chapter]

John Kelsey, Tadayoshi Kohno, Bruce Schneier
2001 Lecture Notes in Computer Science
We introduce a new cryptanalytic technique based on Wagner's boomerang and inside-out attacks.  ...  We first describe this new attack in terms of the original boomerang attack, and then demonstrate its use on reduced-round variants of the MARS core and Serpent.  ...  The Boomerang Attack 7.  ...

### Truncated Boomerang Attacks and Application to AES-based Ciphers [article]

Augustin Bariant, Gaëtan Leurent
2022 IACR Cryptology ePrint Archive
The truncated boomerang attacks is particularly effective against tweakable AES variants.  ...  In this paper, we introduce a general framework for boomerang attacks with truncated differentials.  ...  In particular, the best known attacks against Kiasu and Deoxys are boomerang attacks.  ...

### The Boomerang Attack on 5 and 6-Round Reduced AES [chapter]

Alex Biryukov
2005 Lecture Notes in Computer Science
In this note we study security of 128-bit key 10-round AES against the boomerang attack.  ...  We show attacks on AES reduced to 5 and 6 rounds, much faster than the exhaustive key search and twice faster than the "Square" attack of the AES designers.  ...  Introduction In this paper we study security of 128-bit key AES [2] against the boomerang attack [4] . The boomerang attack was developed in 1999 after the AES competition was already running.  ...
« Previous Showing results 1 — 15 out of 5,003 results