# Tag Info

3

As a simplified case, consider a sponge hash function made from an ideal 160-bit block cipher with a 256-bit key, and mixes in a 32-bit word each round. It would be better to use an LFSR to generate the sequence of keys for each round, but let's say this simplified hash function is  \begin{align} H(0) &= 0 \\ H(N) &= E(0, H(N-1) \oplus ...

Top 50 recent answers are included