[Resource Topic] 2002/041: New Results on Boomerang and Rectangle Attack

Welcome to the resource topic for 2002/041

New Results on Boomerang and Rectangle Attack

Authors: Eli Biham, Orr Dunkelman, Nathan Keller


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.
We also present
a method for using a boomerang distinguisher,
which enables retrieving subkey bits on both sides of the boomerang
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 2^{67}
adaptive chosen plaintexts and ciphertexts, and
10-round Serpent
with time complexity of 2^{173.8} memory accesses (which are
equivalent to 2^{165.3} Serpent encryptions) with data complexity of
2^{126.3} chosen plaintexts.

ePrint: https://eprint.iacr.org/2002/041

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .