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
See also http://sponge.noekeon.org/
(C) 2007 University of Luxembourg
VeryQuickWiki - HTML Export - Printable Version
Version: 2.7.1 (UniLux: 1.15.0 2006-01-19)
Modified: 2008-01-28 17:56:46
Exported: 2010-01-06 02:36:55