Skip to main content
  • 138 Accesses

The boomerang attack is a chosen plaintext and adaptive chosen ciphertext attack discovered by Wagner [5]. It is an extension of differential attack to two-stage differential–differential attack which is closely related to impossible differential attack as well as to the meet-in-the middle approach. The attack may use characteristics, differentials as well as truncated differentials. The attack breaks constructions in which there are high-probability differential patterns propagating half-way through the cipher both from the top and from the bottom, but there are no good patterns that propagate through the full cipher.

The idea of the boomerang attack is to find good conventional (or truncated) differentials that cover half of the cipher but cannot necessarily be concatenated into a single differential covering the whole cipher. The attack starts with a pair of plaintexts P and \(P'\) with a difference \(\Delta\) which goes to difference \(\Delta^{*}\)through the upper half of the...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Biham, E., O. Dunkelman, and N. Keller (2002). “New results on boomerang and rectangle attacks.” Fast Software Encryption, FSE 2002, Lecture Notes in Computer Science, vol. 2365, eds. J. Daemen and V. Rijmen. Springer-Verlag, Berlin, 1–16.

    Google Scholar 

  2. Biryukov, A., C. De Cannire, and G. Dellkrantz (2003). “Cryptanalysis of SAFER ++.” Advances in Cryptology—CRYPTO 2003, Lecture Notes in Computer Science, vol. 2729, ed. D. Boneh. Springer-Verlag, Berlin. NES/DOC/KUL/WP5/028. Full version available at http://eprint.iacr.org/2003/109/

    Google Scholar 

  3. Kelsey, J., T. Kohno, and B. Schneier (2001). “Amplified boomerang attacks against reduced-round MARS and Serpent.” Fast Software Encryption, FSE 2000, Lecture Notes in Computer Science, vol. 1978, ed. B. Schneier. Springer-Verlag, Berlin, 75–93.

    Google Scholar 

  4. Vaudenay, S. (1998). “Provable security for block ciphers by decorrelation.” STACS, Lecture Notes in Computer Science, vol. 3404, eds. M. Morvan, C. Meinel, and D. Krob. Springer-Verlag, Berlin, 249–275.

    Google Scholar 

  5. Wagner, D. (1999). “The boomerang attack.” Fast Software Encryption, FSE'99, Lecture Notes in Computer Science, vol. 3404, ed. L.R. Knudsen. Springer-Verlag, Berlin, 156–170.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 International Federation for Information Processing

About this entry

Cite this entry

Biryukov, A. (2005). Boomerang Attack. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_41

Download citation

Publish with us

Policies and ethics