A good cryptographic hash function should behave like a random oracle: it should not have weaknesses that a random oracle does not have. Due to the existence of inner collisions, iterated hash functions can never satisfy this ideal. We propose a construction with a finite state called a sponge and show that a random sponge can only be distinguished from a random oracle due to inner collisions. ...
