Skip to main content

Sponge Functions

Definition

Sponge functions are a class of cryptographic primitives that process input data of arbitrary length to produce output of a desired length. They operate by “absorbing” input blocks into a fixed-size internal state and then “squeezing” out output blocks from that state. This construction allows them to serve as versatile building blocks for various cryptographic applications, including hash functions, stream ciphers, and message authentication codes. Their security relies on the underlying permutation function and the rate at which data is absorbed and squeezed.