Time-memory trade-offs for near-collisions
(2014) International workshop on fast software encryption, FSE — Location: Singapore, Singapore (11.March.2013)
Files
document.pdf
Restricted Access - Adobe PDF
- 319.94 KB
Details
- Authors
- Abstract
- In this work we consider generic algorithms to find near-collisions for a hash function. If we consider only hash computations, it is easy to compute a lower-bound for the complexity of near-collision algorithms, and to build a matching algorithm. However, this algorithm needs a lot of memory, and makes more than 2n/2 memory accesses. Recently, several algorithms have been proposed without this memory requirement; they require more hash evaluations, but the attack is actually more practical. They can be divided in two main categories: they are either based on truncation, or based on covering codes. In this paper, we give a new insight to the generic complexity of a near-collision attack. First, we consider time-memory trade-offs for truncation-based algorithms. For a practical implementation, it seems reasonable to assume that some memory is available and we show that taking advantage of this memory can significantly reduce the complexity. Second, we show a new method combining truncation and covering codes. The new algorithm is always at least as good as the previous works, and often gives a significant improvement. We illustrate our results by giving a 10-near collision for MD5: our algorithm has a complexity of 245.4 using 1 TB of memory while the best previous algorithm required 252.5 computations.
- Affiliations
Citations
Leurent, G. (2014). Time-memory trade-offs for near-collisions. Lecture Notes in Computer Science, 8424, 205-218. https://doi.org/10.1007/978-3-662-43933-3_11 (Original work published 2014)