Cryptographic Sponges

A sponge function models the finite memory an iterated hash function or an iterated stream cipher has. Based on a random transformation or permutation, a random sponge can only be distinguished from a random oracle by inner collisions. Owing to this similarity, it can be used as a model for hash function (and stream cipher) designs, which have finite memory.

In this presentation, we first revisit the definition of sponge functions and their properties, present a number of new results and their implications, and finally discuss their applications.

This is a joint work with Guido Bertoni, Joan Daemen and Michaël Peeters.

CryptographicSponges-ESC2008.pdf

See also http://sponge.noekeon.org/.

"VAN ASSCHE Gilles" is mentioned on: BERTONI Guido | Home | Participants