Wagner's $k$-Tree Revisited: Memory-Time Costs of Preimage Attacks on Incremental Hashes eprint.iacr.org
Paper on extending post-retrieval to Wagner k-trees, cutting index memory for hash preimage attacks, because RAM was the villain.
1 comment
This feels like a fairly direct follow-on to Wagner’s 2002 k-tree / generalized birthday attack, just with the memory accounting pushed hard enough that the index stops being the easy part. RAM has been the real bottleneck in these preimage tradeoffs for a while, so I can see why people keep circling back to this line of work.