A Related-Key Rectangle Attack on the Full KASUMI

Biham, Eli; Dunkelman, Orr; Keller, Nathan

doi:10.1007/11593447_24

Cited by 73 publications

(63 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The full analysis can be found in [8]. The related-key boomerang and rectangle techniques were used to attack reduced round variants of AES, IDEA, SHACAL-1, and SHACAL-2 and the full KASUMI and COCONUT98 [8,9,15,19,18].…”

Section: Related-key Rectangle Attackmentioning

confidence: 99%

Related-Key Rectangle Attack on the Full SHACAL-1

Dunkelman

Keller

Kim

Selected Areas in Cryptography

Self Cite

View full text Add to dashboard Cite

Abstract. SHACAL-1 is a 160-bit block cipher with variable key length of up to 512-bit key based on the hash function SHA-1. It was submitted to the NESSIE project and was accepted as a finalist for the 2nd phase of the evaluation.In this paper we devise the first known attack on the full 80-round SHACAL-1 faster than exhaustive key search. The related-key differentials used in the attack are based on transformation of the collisionproducing differentials of SHA-1 presented by Wang et al.

show abstract

Section: Related-key Rectangle Attackmentioning

confidence: 99%

Related-Key Rectangle Attack on the Full SHACAL-1

Dunkelman

Keller

Kim

Selected Areas in Cryptography

Self Cite

View full text Add to dashboard Cite

show abstract

“…In 2005, the related-key boomernag attack has been applied to several ciphers KASUMI [3], COCONUT98 [2], IDEA [2], and AES-192/256 [5]. In [3], authors have given a related key boomerang attack on KASUMI reduced to 6-round out of 8-round with 34 related-keys and 2…”

Section: Related Workmentioning

confidence: 99%

“…In [3], authors have given a related key boomerang attack on KASUMI reduced to 6-round out of 8-round with 34 related-keys and 2…”

Section: Related Workmentioning

confidence: 99%

Related-Key Boomerang Attack on Block Cipher SQUARE

Koo¹,

Yeom²,

Song

2011

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

Abstract. Square is 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. We find a 3-round related-key differential trail with probability 2 −28 , which have zero differences both on its input and output states, and this trail is called the local collision in [5]. By extending of this related-key differential, we construct a 7-round related-key boomerang distinguisher and successful attack on full round Square. The best attack on Square have ever been known is the square attack on 6-round reduced variant of Square. In this paper, we present a key recovery attack on the full round of Square using a related-key boomerang distinguisher. We construct a 7-round related-key boomerang distinguisher with probability 2 −119 by finding local collision, and calculate its probability using ladder switch and local amplification techniques. As a result, one round on top of distinguisher is added to construct a full round attack on Square which recovers 16-bit key information with 2 36 encryptions and 2 123 data.

show abstract

“…The related-key differential attack has also been extended into various cryptanalytic techniques such as a related-key differential-linear attack [15], a relatedkey impossible differential attack [18], a related-key boomerang and rectangle attacks [5,22]. Related-key attacks are well-known to be powerful tools to analyze block ciphers: up to now, the best known attacks (in terms of the number of attacked rounds) against AES [24], KASUMI [6], IDEA [7], SHACAL-1 [8] and GOST [26] are all relatedkey attacks. Furthermore, related-key attacks can be used to evaluate the security of message authentication codes and block cipher based enciphering modes (refer to [3] for an example).…”

Section: Introductionmentioning

confidence: 99%