The boomerang attack is a newand 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.We also present a method for using a boomerang distinguisher, which enables retrieving subkey bits on both sides of the boomerang distinguisher. The rectangle attack evolved from the boomerang attack.In this paper we present a new algorithm which improves the results of the rectangle attack. Using these improvements we can attack 3.5-round SC2000 with 267 adaptive chosen plaintexts and ciphertexts, and 10-round Serpent with time complexity of 2173.8 memory accesses (which are equivalent to 2165.3 Serpent encryptions) with data complexity of 2126.3 chosen plaintexts.
|Title of host publication||Fast Software Encryption - 9th International Workshop, FSE 2002, Revised Papers|
|Editors||Joan Daemen, Vincent Rijmen|
|Number of pages||16|
|State||Published - 2002|
|Event||9th International Workshop on Fast Software Encryption, FSE 2002 - Leuven, Belgium|
Duration: 4 Feb 2002 → 6 Feb 2002
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||9th International Workshop on Fast Software Encryption, FSE 2002|
|Period||4/02/02 → 6/02/02|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.