How to Improve Rebound Attacks

  • María Naya-Plasencia
Conference paper

DOI: 10.1007/978-3-642-22792-9_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6841)
Cite this paper as:
Naya-Plasencia M. (2011) How to Improve Rebound Attacks. In: Rogaway P. (eds) Advances in Cryptology – CRYPTO 2011. CRYPTO 2011. Lecture Notes in Computer Science, vol 6841. Springer, Berlin, Heidelberg

Abstract

Rebound attacks are a state-of-the-art analysis method for hash functions. These cryptanalysis methods are based on a well chosen differential path and have been applied to several hash functions from the SHA-3 competition, providing the best known analysis in these cases. In this paper we study rebound attacks in detail and find for a large number of cases that the complexities of existing attacks can be improved.

This is done by identifying problems that optimally adapt to the cryptanalytic situation, and by using better algorithms to find solutions for the differential path. Our improvements affect one particular operation that appears in most rebound attacks and which is often the bottleneck of the attacks. This operation, which varies depending on the attack, can be roughly described as merging large lists. As a result, we introduce new general purpose algorithms for enabling further rebound analysis to be as performant as possible. We illustrate our new algorithms on real hash functions.

Keywords

hash functions SHA-3 competition rebound attacks algorithms 
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • María Naya-Plasencia
    • 1
  1. 1.FHNWWindischSwitzerland

Personalised recommendations