Welcome to the resource topic for 2006/412
Title:
Preimage Attacks on CellHash, SubHash and Strengthened Versions of CellHash and SubHash
Authors: Donghoon Chang
Abstract:CellHash \cite{DaGoVa91} and SubHash \cite{DaGoVa92} were suggested by J. Daemen, R. Govaerts and J. Vandewalle in 1991 and 1992. SubHash is an improved version from CellHash. They have 257-bit internal state and 256-bit hash output. In this paper, we show a preimage attack on CellHash (SubHash) with the complexity 2^{129+t} and the memory 2^{128-t} for any t (with the complexity about 2^{242} and the memory size 2^{17}). Even though we modify them in a famous way, we show that we can find a preimage on the modified CellHash (the modified SubHash) with the complexity 2^{200} and the memory size 2^{59} (with the complexity about 2^{242} and the memory size 2^{17}).
ePrint: https://eprint.iacr.org/2006/412
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 .